./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-regression/test11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-regression/test11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eff30860b93e12e0f427a39d6e133ecae4dea669b3383f2efa9b7561bb59ead3 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:34:22,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:34:22,528 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:34:22,540 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:34:22,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:34:22,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:34:22,589 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:34:22,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:34:22,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:34:22,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:34:22,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:34:22,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:34:22,600 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:34:22,603 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:34:22,603 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:34:22,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:34:22,604 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:34:22,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:34:22,605 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:34:22,606 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:34:22,607 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:34:22,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:34:22,608 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:34:22,608 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:34:22,609 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:34:22,609 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:34:22,610 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:34:22,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:34:22,611 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:34:22,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:34:22,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:34:22,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:34:22,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:34:22,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:34:22,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:34:22,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:34:22,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:34:22,616 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:34:22,616 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eff30860b93e12e0f427a39d6e133ecae4dea669b3383f2efa9b7561bb59ead3 [2023-11-06 22:34:22,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:34:23,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:34:23,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:34:23,015 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:34:23,016 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:34:23,018 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/ldv-regression/test11.c [2023-11-06 22:34:26,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:34:27,013 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:34:27,014 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/sv-benchmarks/c/ldv-regression/test11.c [2023-11-06 22:34:27,023 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/data/dd381972c/2482770701704ef3b8c28519e0e8dd15/FLAG2d15c73c9 [2023-11-06 22:34:27,048 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/data/dd381972c/2482770701704ef3b8c28519e0e8dd15 [2023-11-06 22:34:27,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:34:27,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:34:27,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:34:27,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:34:27,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:34:27,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,075 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@512c8c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27, skipping insertion in model container [2023-11-06 22:34:27,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,106 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:34:27,347 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:34:27,362 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:34:27,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:34:27,402 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:34:27,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27 WrapperNode [2023-11-06 22:34:27,403 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:34:27,404 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:34:27,404 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:34:27,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:34:27,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,468 INFO L138 Inliner]: procedures = 15, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2023-11-06 22:34:27,469 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:34:27,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:34:27,470 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:34:27,470 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:34:27,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,503 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,505 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,506 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:34:27,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:34:27,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:34:27,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:34:27,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27" (1/1) ... [2023-11-06 22:34:27,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:34:27,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:34:27,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:34:27,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:34:27,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:34:27,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:34:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:34:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:34:27,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:34:27,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:34:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:34:27,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:34:27,714 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:34:27,716 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:34:27,966 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:34:27,973 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:34:27,973 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:34:27,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:34:27 BoogieIcfgContainer [2023-11-06 22:34:27,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:34:27,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:34:27,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:34:27,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:34:27,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:34:27" (1/3) ... [2023-11-06 22:34:27,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a088afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:34:27, skipping insertion in model container [2023-11-06 22:34:27,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:34:27" (2/3) ... [2023-11-06 22:34:27,986 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a088afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:34:27, skipping insertion in model container [2023-11-06 22:34:27,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:34:27" (3/3) ... [2023-11-06 22:34:27,987 INFO L112 eAbstractionObserver]: Analyzing ICFG test11.c [2023-11-06 22:34:28,013 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:34:28,013 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-11-06 22:34:28,069 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:34:28,078 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@db40c33, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:34:28,078 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-11-06 22:34:28,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:28,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:34:28,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:28,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:34:28,092 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:28,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:28,099 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-11-06 22:34:28,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:28,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485121192] [2023-11-06 22:34:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:28,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:28,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:28,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:28,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485121192] [2023-11-06 22:34:28,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485121192] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:28,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:28,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:34:28,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656788246] [2023-11-06 22:34:28,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:28,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:28,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:28,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:28,703 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:28,783 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2023-11-06 22:34:28,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:34:28,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-06 22:34:28,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:28,799 INFO L225 Difference]: With dead ends: 35 [2023-11-06 22:34:28,799 INFO L226 Difference]: Without dead ends: 33 [2023-11-06 22:34:28,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:28,807 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 31 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:28,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 24 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:34:28,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-06 22:34:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-06 22:34:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.75) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:28,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2023-11-06 22:34:28,843 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 3 [2023-11-06 22:34:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:28,843 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2023-11-06 22:34:28,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2023-11-06 22:34:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-06 22:34:28,844 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:28,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-06 22:34:28,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:34:28,845 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:28,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:28,846 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-11-06 22:34:28,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:28,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748383894] [2023-11-06 22:34:28,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:28,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:28,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:28,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748383894] [2023-11-06 22:34:28,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748383894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:28,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:28,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:34:28,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73826877] [2023-11-06 22:34:28,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:28,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:28,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:28,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:28,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:28,991 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:29,030 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2023-11-06 22:34:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:34:29,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-06 22:34:29,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:29,032 INFO L225 Difference]: With dead ends: 32 [2023-11-06 22:34:29,032 INFO L226 Difference]: Without dead ends: 32 [2023-11-06 22:34:29,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:29,035 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:29,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 15 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:29,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-06 22:34:29,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-06 22:34:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.7) internal successors, (34), 31 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:29,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-11-06 22:34:29,042 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 3 [2023-11-06 22:34:29,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:29,042 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-11-06 22:34:29,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:29,043 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-11-06 22:34:29,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 22:34:29,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:29,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:34:29,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:34:29,044 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:29,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:29,045 INFO L85 PathProgramCache]: Analyzing trace with hash 28691810, now seen corresponding path program 1 times [2023-11-06 22:34:29,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:29,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231166485] [2023-11-06 22:34:29,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:29,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:29,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:29,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231166485] [2023-11-06 22:34:29,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231166485] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:29,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:29,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:34:29,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368408050] [2023-11-06 22:34:29,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:29,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:34:29,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:29,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:34:29,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:29,184 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:29,213 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2023-11-06 22:34:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:34:29,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-06 22:34:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:29,215 INFO L225 Difference]: With dead ends: 31 [2023-11-06 22:34:29,215 INFO L226 Difference]: Without dead ends: 31 [2023-11-06 22:34:29,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:29,218 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:29,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 19 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-11-06 22:34:29,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-11-06 22:34:29,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.65) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:29,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2023-11-06 22:34:29,224 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 5 [2023-11-06 22:34:29,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:29,225 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2023-11-06 22:34:29,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:29,225 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2023-11-06 22:34:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-06 22:34:29,226 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:29,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:34:29,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:34:29,227 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:29,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:29,228 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2023-11-06 22:34:29,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:29,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026316793] [2023-11-06 22:34:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:29,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:29,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:29,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026316793] [2023-11-06 22:34:29,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026316793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:29,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:29,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:34:29,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038288815] [2023-11-06 22:34:29,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:29,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:34:29,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:29,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:34:29,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:29,343 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:29,369 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-11-06 22:34:29,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:34:29,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-06 22:34:29,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:29,371 INFO L225 Difference]: With dead ends: 30 [2023-11-06 22:34:29,371 INFO L226 Difference]: Without dead ends: 30 [2023-11-06 22:34:29,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:29,373 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:29,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 20 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:29,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-06 22:34:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-06 22:34:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.6) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2023-11-06 22:34:29,379 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 5 [2023-11-06 22:34:29,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:29,380 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2023-11-06 22:34:29,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2023-11-06 22:34:29,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:34:29,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:29,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:29,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:34:29,382 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:29,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:29,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1056639248, now seen corresponding path program 1 times [2023-11-06 22:34:29,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:29,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27391865] [2023-11-06 22:34:29,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:29,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:29,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:29,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:29,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27391865] [2023-11-06 22:34:29,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27391865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:29,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:29,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:34:29,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855738789] [2023-11-06 22:34:29,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:29,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:34:29,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:29,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:34:29,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:34:29,522 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:29,592 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2023-11-06 22:34:29,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:34:29,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-06 22:34:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:29,594 INFO L225 Difference]: With dead ends: 29 [2023-11-06 22:34:29,594 INFO L226 Difference]: Without dead ends: 29 [2023-11-06 22:34:29,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:34:29,596 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 93 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:29,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 18 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:29,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-06 22:34:29,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-06 22:34:29,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.55) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-11-06 22:34:29,601 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 10 [2023-11-06 22:34:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:29,602 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-11-06 22:34:29,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-11-06 22:34:29,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:34:29,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:29,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:29,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:34:29,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:29,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1056639249, now seen corresponding path program 1 times [2023-11-06 22:34:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634884061] [2023-11-06 22:34:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:29,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:29,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:29,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:29,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634884061] [2023-11-06 22:34:29,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634884061] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:29,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:29,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:34:29,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250829025] [2023-11-06 22:34:29,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:29,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:34:29,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:29,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:34:29,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:34:29,893 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:30,095 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-11-06 22:34:30,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:34:30,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-06 22:34:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:30,097 INFO L225 Difference]: With dead ends: 28 [2023-11-06 22:34:30,097 INFO L226 Difference]: Without dead ends: 28 [2023-11-06 22:34:30,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:34:30,099 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 98 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:30,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 15 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:34:30,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-06 22:34:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-06 22:34:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-11-06 22:34:30,106 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 10 [2023-11-06 22:34:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:30,106 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-11-06 22:34:30,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-11-06 22:34:30,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-06 22:34:30,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:30,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:30,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:34:30,109 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:30,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:30,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1056637870, now seen corresponding path program 1 times [2023-11-06 22:34:30,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:30,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173884595] [2023-11-06 22:34:30,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:30,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:30,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:30,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173884595] [2023-11-06 22:34:30,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173884595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:30,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:30,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:34:30,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889992243] [2023-11-06 22:34:30,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:30,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:34:30,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:30,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:34:30,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:30,167 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:30,180 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2023-11-06 22:34:30,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:34:30,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-06 22:34:30,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:30,182 INFO L225 Difference]: With dead ends: 29 [2023-11-06 22:34:30,182 INFO L226 Difference]: Without dead ends: 29 [2023-11-06 22:34:30,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:30,184 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:30,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:30,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-06 22:34:30,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-06 22:34:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2023-11-06 22:34:30,190 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 10 [2023-11-06 22:34:30,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:30,191 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2023-11-06 22:34:30,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2023-11-06 22:34:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:34:30,192 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:30,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:30,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:34:30,193 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:30,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:30,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1603921686, now seen corresponding path program 1 times [2023-11-06 22:34:30,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:30,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467639283] [2023-11-06 22:34:30,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:30,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:30,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:30,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:30,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467639283] [2023-11-06 22:34:30,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467639283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:30,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:30,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:34:30,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027083750] [2023-11-06 22:34:30,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:30,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:30,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:30,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:30,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:30,251 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:30,309 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2023-11-06 22:34:30,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:34:30,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-06 22:34:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:30,312 INFO L225 Difference]: With dead ends: 40 [2023-11-06 22:34:30,313 INFO L226 Difference]: Without dead ends: 40 [2023-11-06 22:34:30,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:34:30,315 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 33 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:30,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-11-06 22:34:30,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2023-11-06 22:34:30,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 27 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-11-06 22:34:30,327 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 11 [2023-11-06 22:34:30,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:30,327 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-11-06 22:34:30,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,328 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-11-06 22:34:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:34:30,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:30,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:30,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:34:30,330 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:30,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:30,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1603921685, now seen corresponding path program 1 times [2023-11-06 22:34:30,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:30,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741087669] [2023-11-06 22:34:30,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:30,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:30,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:30,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:30,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741087669] [2023-11-06 22:34:30,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741087669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:30,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:30,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:34:30,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749860060] [2023-11-06 22:34:30,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:30,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:34:30,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:30,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:34:30,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:34:30,547 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:30,641 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2023-11-06 22:34:30,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:34:30,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-06 22:34:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:30,646 INFO L225 Difference]: With dead ends: 41 [2023-11-06 22:34:30,648 INFO L226 Difference]: Without dead ends: 41 [2023-11-06 22:34:30,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:34:30,653 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 80 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:30,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 45 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-06 22:34:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2023-11-06 22:34:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.380952380952381) internal successors, (29), 26 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-11-06 22:34:30,668 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 11 [2023-11-06 22:34:30,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:30,669 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-11-06 22:34:30,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-11-06 22:34:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 22:34:30,670 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:30,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:30,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:34:30,671 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:30,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:30,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1603965928, now seen corresponding path program 1 times [2023-11-06 22:34:30,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:30,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352611060] [2023-11-06 22:34:30,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:30,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:30,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:30,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352611060] [2023-11-06 22:34:30,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352611060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:30,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:30,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:34:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538263062] [2023-11-06 22:34:30,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:30,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:30,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:30,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:30,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:30,724 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:30,763 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2023-11-06 22:34:30,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:34:30,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-06 22:34:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:30,765 INFO L225 Difference]: With dead ends: 26 [2023-11-06 22:34:30,765 INFO L226 Difference]: Without dead ends: 26 [2023-11-06 22:34:30,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:34:30,766 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:30,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 36 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-06 22:34:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-06 22:34:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2023-11-06 22:34:30,769 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 11 [2023-11-06 22:34:30,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:30,770 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2023-11-06 22:34:30,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,770 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2023-11-06 22:34:30,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 22:34:30,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:30,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:30,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:34:30,772 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:30,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:30,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1818313426, now seen corresponding path program 1 times [2023-11-06 22:34:30,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:30,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393131245] [2023-11-06 22:34:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:30,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:30,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:30,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:30,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393131245] [2023-11-06 22:34:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393131245] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:30,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:30,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:34:30,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350051886] [2023-11-06 22:34:30,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:30,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:30,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:30,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:30,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:30,840 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:30,867 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2023-11-06 22:34:30,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:34:30,868 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-06 22:34:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:30,869 INFO L225 Difference]: With dead ends: 26 [2023-11-06 22:34:30,869 INFO L226 Difference]: Without dead ends: 26 [2023-11-06 22:34:30,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:34:30,870 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:30,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:30,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-06 22:34:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-11-06 22:34:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.3) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2023-11-06 22:34:30,877 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 12 [2023-11-06 22:34:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:30,877 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2023-11-06 22:34:30,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2023-11-06 22:34:30,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:34:30,881 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:30,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:30,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:34:30,881 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:30,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:30,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1551514479, now seen corresponding path program 1 times [2023-11-06 22:34:30,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:30,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161906509] [2023-11-06 22:34:30,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:30,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:30,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:30,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161906509] [2023-11-06 22:34:30,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161906509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:30,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:30,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:34:30,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583898100] [2023-11-06 22:34:30,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:30,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:34:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:34:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:30,944 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:30,975 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2023-11-06 22:34:30,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:34:30,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-06 22:34:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:30,977 INFO L225 Difference]: With dead ends: 25 [2023-11-06 22:34:30,977 INFO L226 Difference]: Without dead ends: 25 [2023-11-06 22:34:30,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:30,979 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:30,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 15 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-06 22:34:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-06 22:34:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 24 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2023-11-06 22:34:30,988 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 15 [2023-11-06 22:34:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:30,988 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2023-11-06 22:34:30,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2023-11-06 22:34:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-06 22:34:30,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:30,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:30,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:34:30,990 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:30,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:30,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1551514480, now seen corresponding path program 1 times [2023-11-06 22:34:30,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:30,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573957606] [2023-11-06 22:34:30,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:30,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:31,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:31,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:31,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573957606] [2023-11-06 22:34:31,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573957606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:31,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:31,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:34:31,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349446712] [2023-11-06 22:34:31,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:31,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:34:31,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:31,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:34:31,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:31,090 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:31,112 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2023-11-06 22:34:31,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:34:31,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-06 22:34:31,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:31,113 INFO L225 Difference]: With dead ends: 24 [2023-11-06 22:34:31,113 INFO L226 Difference]: Without dead ends: 24 [2023-11-06 22:34:31,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:34:31,115 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:31,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 16 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-06 22:34:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-06 22:34:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.2) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2023-11-06 22:34:31,119 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 15 [2023-11-06 22:34:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:31,120 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2023-11-06 22:34:31,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2023-11-06 22:34:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:34:31,121 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:31,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:31,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:34:31,122 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:31,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:31,123 INFO L85 PathProgramCache]: Analyzing trace with hash 852307063, now seen corresponding path program 1 times [2023-11-06 22:34:31,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:31,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367867052] [2023-11-06 22:34:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:31,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:31,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:31,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367867052] [2023-11-06 22:34:31,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367867052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:31,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:31,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:34:31,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024101645] [2023-11-06 22:34:31,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:31,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:34:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:31,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:34:31,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:34:31,264 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:31,381 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2023-11-06 22:34:31,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:34:31,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 22:34:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:31,382 INFO L225 Difference]: With dead ends: 24 [2023-11-06 22:34:31,382 INFO L226 Difference]: Without dead ends: 24 [2023-11-06 22:34:31,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-06 22:34:31,384 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:31,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 77 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:31,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-06 22:34:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-06 22:34:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 23 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2023-11-06 22:34:31,399 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 16 [2023-11-06 22:34:31,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:31,401 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2023-11-06 22:34:31,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,401 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2023-11-06 22:34:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:34:31,403 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:31,403 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:31,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:34:31,405 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:31,405 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:31,405 INFO L85 PathProgramCache]: Analyzing trace with hash 852308604, now seen corresponding path program 1 times [2023-11-06 22:34:31,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:31,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936631780] [2023-11-06 22:34:31,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:31,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:31,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:31,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:31,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:31,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936631780] [2023-11-06 22:34:31,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936631780] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:31,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:31,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:34:31,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863102534] [2023-11-06 22:34:31,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:31,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:31,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:31,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:31,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:31,498 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:31,531 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2023-11-06 22:34:31,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:34:31,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 22:34:31,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:31,533 INFO L225 Difference]: With dead ends: 23 [2023-11-06 22:34:31,534 INFO L226 Difference]: Without dead ends: 23 [2023-11-06 22:34:31,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:34:31,537 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:31,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 13 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-06 22:34:31,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-06 22:34:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2023-11-06 22:34:31,543 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 16 [2023-11-06 22:34:31,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:31,543 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2023-11-06 22:34:31,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2023-11-06 22:34:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 22:34:31,545 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:31,545 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:31,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:34:31,546 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:31,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:31,547 INFO L85 PathProgramCache]: Analyzing trace with hash 852308605, now seen corresponding path program 1 times [2023-11-06 22:34:31,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:31,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109279258] [2023-11-06 22:34:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:31,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:31,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:31,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109279258] [2023-11-06 22:34:31,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109279258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:31,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:31,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:34:31,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524168986] [2023-11-06 22:34:31,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:31,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:31,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:31,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:31,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:31,692 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:31,720 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2023-11-06 22:34:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:34:31,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-06 22:34:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:31,722 INFO L225 Difference]: With dead ends: 22 [2023-11-06 22:34:31,722 INFO L226 Difference]: Without dead ends: 22 [2023-11-06 22:34:31,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:31,723 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:31,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 15 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-11-06 22:34:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-11-06 22:34:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2023-11-06 22:34:31,727 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 16 [2023-11-06 22:34:31,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:31,727 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2023-11-06 22:34:31,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,728 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2023-11-06 22:34:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:34:31,728 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:31,729 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:31,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:34:31,729 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:31,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:31,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1270184509, now seen corresponding path program 1 times [2023-11-06 22:34:31,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:31,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109597217] [2023-11-06 22:34:31,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:31,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:31,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:31,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109597217] [2023-11-06 22:34:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109597217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:31,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:34:31,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2765422] [2023-11-06 22:34:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:31,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:34:31,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:31,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:34:31,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:31,857 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:31,883 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2023-11-06 22:34:31,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:34:31,884 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-06 22:34:31,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:31,885 INFO L225 Difference]: With dead ends: 21 [2023-11-06 22:34:31,885 INFO L226 Difference]: Without dead ends: 20 [2023-11-06 22:34:31,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:34:31,887 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:31,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 24 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:31,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-06 22:34:31,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-06 22:34:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 19 transitions. [2023-11-06 22:34:31,890 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 19 transitions. Word has length 18 [2023-11-06 22:34:31,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:31,890 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 19 transitions. [2023-11-06 22:34:31,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 19 transitions. [2023-11-06 22:34:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 22:34:31,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:34:31,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:31,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 22:34:31,893 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2023-11-06 22:34:31,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:34:31,894 INFO L85 PathProgramCache]: Analyzing trace with hash -721016172, now seen corresponding path program 1 times [2023-11-06 22:34:31,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:34:31,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328544194] [2023-11-06 22:34:31,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:34:31,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:34:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:34:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:34:32,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:34:32,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328544194] [2023-11-06 22:34:32,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328544194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:34:32,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:34:32,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:34:32,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801676271] [2023-11-06 22:34:32,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:34:32,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:34:32,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:34:32,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:34:32,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:34:32,006 INFO L87 Difference]: Start difference. First operand 20 states and 19 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:34:32,062 INFO L93 Difference]: Finished difference Result 17 states and 16 transitions. [2023-11-06 22:34:32,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:34:32,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-06 22:34:32,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:34:32,063 INFO L225 Difference]: With dead ends: 17 [2023-11-06 22:34:32,063 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:34:32,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:34:32,064 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 3 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:34:32,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 33 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:34:32,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:34:32,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:34:32,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:32,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:34:32,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2023-11-06 22:34:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:34:32,066 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:34:32,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:34:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:34:32,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:34:32,070 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2023-11-06 22:34:32,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2023-11-06 22:34:32,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2023-11-06 22:34:32,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2023-11-06 22:34:32,071 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2023-11-06 22:34:32,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2023-11-06 22:34:32,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2023-11-06 22:34:32,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2023-11-06 22:34:32,072 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2023-11-06 22:34:32,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2023-11-06 22:34:32,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 14 remaining) [2023-11-06 22:34:32,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 14 remaining) [2023-11-06 22:34:32,073 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (1 of 14 remaining) [2023-11-06 22:34:32,074 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2023-11-06 22:34:32,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 22:34:32,078 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:34:32,080 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:34:32,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:34:32 BoogieIcfgContainer [2023-11-06 22:34:32,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:34:32,085 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:34:32,085 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:34:32,085 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:34:32,086 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:34:27" (3/4) ... [2023-11-06 22:34:32,089 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:34:32,100 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2023-11-06 22:34:32,100 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-06 22:34:32,100 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:34:32,101 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:34:32,168 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:34:32,169 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:34:32,169 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:34:32,170 INFO L158 Benchmark]: Toolchain (without parser) took 5109.19ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 137.4MB in the beginning and 89.0MB in the end (delta: 48.4MB). Peak memory consumption was 87.7MB. Max. memory is 16.1GB. [2023-11-06 22:34:32,171 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 113.2MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:34:32,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.07ms. Allocated memory is still 180.4MB. Free memory was 136.9MB in the beginning and 126.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:34:32,172 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.92ms. Allocated memory is still 180.4MB. Free memory was 126.9MB in the beginning and 125.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:34:32,172 INFO L158 Benchmark]: Boogie Preprocessor took 39.33ms. Allocated memory is still 180.4MB. Free memory was 125.3MB in the beginning and 124.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:34:32,172 INFO L158 Benchmark]: RCFGBuilder took 466.07ms. Allocated memory is still 180.4MB. Free memory was 124.3MB in the beginning and 110.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:34:32,173 INFO L158 Benchmark]: TraceAbstraction took 4104.97ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 109.6MB in the beginning and 92.1MB in the end (delta: 17.5MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. [2023-11-06 22:34:32,173 INFO L158 Benchmark]: Witness Printer took 84.34ms. Allocated memory is still 218.1MB. Free memory was 92.1MB in the beginning and 89.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:34:32,176 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.37ms. Allocated memory is still 113.2MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.07ms. Allocated memory is still 180.4MB. Free memory was 136.9MB in the beginning and 126.9MB in the end (delta: 10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.92ms. Allocated memory is still 180.4MB. Free memory was 126.9MB in the beginning and 125.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.33ms. Allocated memory is still 180.4MB. Free memory was 125.3MB in the beginning and 124.3MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 466.07ms. Allocated memory is still 180.4MB. Free memory was 124.3MB in the beginning and 110.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4104.97ms. Allocated memory was 180.4MB in the beginning and 218.1MB in the end (delta: 37.7MB). Free memory was 109.6MB in the beginning and 92.1MB in the end (delta: 17.5MB). Peak memory consumption was 56.3MB. Max. memory is 16.1GB. * Witness Printer took 84.34ms. Allocated memory is still 218.1MB. Free memory was 92.1MB in the beginning and 89.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 14]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 569 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 569 mSDsluCounter, 524 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 341 IncrementalHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 332 mSDtfsCounter, 341 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1164 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-06 22:34:32,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_170380a7-3a75-4e62-b286-c93beb9afaed/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE