./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 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_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --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 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:08:36,491 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:08:36,633 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 22:08:36,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:08:36,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:08:36,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:08:36,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:08:36,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:08:36,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:08:36,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:08:36,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:08:36,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:08:36,691 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:08:36,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:08:36,694 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:08:36,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:08:36,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:08:36,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:08:36,696 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:08:36,696 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:08:36,697 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:08:36,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:08:36,698 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:08:36,699 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:08:36,699 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:08:36,700 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:08:36,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:08:36,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:08:36,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:08:36,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:08:36,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:08:36,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:08:36,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:08:36,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:08:36,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 22:08:36,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:08:36,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:08:36,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:08:36,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:08:36,706 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_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/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_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2023-11-21 22:08:37,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:08:37,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:08:37,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:08:37,109 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:08:37,110 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:08:37,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2023-11-21 22:08:40,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:08:40,526 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:08:40,527 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2023-11-21 22:08:40,556 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/data/0dbccc7a0/37153710eaa24c45a1ac7bf6955d4c35/FLAG1c6e4307e [2023-11-21 22:08:40,579 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/data/0dbccc7a0/37153710eaa24c45a1ac7bf6955d4c35 [2023-11-21 22:08:40,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:08:40,584 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:08:40,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:08:40,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:08:40,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:08:40,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:08:40" (1/1) ... [2023-11-21 22:08:40,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@473b1f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:40, skipping insertion in model container [2023-11-21 22:08:40,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:08:40" (1/1) ... [2023-11-21 22:08:40,640 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:08:40,986 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:08:41,005 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:08:41,085 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:08:41,122 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:08:41,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41 WrapperNode [2023-11-21 22:08:41,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:08:41,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:08:41,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:08:41,125 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:08:41,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41" (1/1) ... [2023-11-21 22:08:41,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41" (1/1) ... [2023-11-21 22:08:41,199 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2023-11-21 22:08:41,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:08:41,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:08:41,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:08:41,201 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:08:41,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41" (1/1) ... [2023-11-21 22:08:41,212 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41" (1/1) ... [2023-11-21 22:08:41,223 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41" (1/1) ... [2023-11-21 22:08:41,223 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41" (1/1) ... [2023-11-21 22:08:41,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41" (1/1) ... [2023-11-21 22:08:41,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41" (1/1) ... [2023-11-21 22:08:41,256 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41" (1/1) ... [2023-11-21 22:08:41,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41" (1/1) ... [2023-11-21 22:08:41,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:08:41,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:08:41,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:08:41,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:08:41,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41" (1/1) ... [2023-11-21 22:08:41,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:08:41,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:08:41,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:08:41,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:08:41,358 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-21 22:08:41,358 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-21 22:08:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-21 22:08:41,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 22:08:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:08:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:08:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 22:08:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 22:08:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:08:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 22:08:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:08:41,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:08:41,485 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:08:41,488 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:08:41,936 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:08:42,060 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:08:42,060 INFO L308 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-21 22:08:42,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:08:42 BoogieIcfgContainer [2023-11-21 22:08:42,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:08:42,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:08:42,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:08:42,069 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:08:42,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:08:40" (1/3) ... [2023-11-21 22:08:42,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d6a088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:08:42, skipping insertion in model container [2023-11-21 22:08:42,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:41" (2/3) ... [2023-11-21 22:08:42,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d6a088 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:08:42, skipping insertion in model container [2023-11-21 22:08:42,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:08:42" (3/3) ... [2023-11-21 22:08:42,072 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2023-11-21 22:08:42,092 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:08:42,093 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2023-11-21 22:08:42,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:08:42,152 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;@44c2f946, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:08:42,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-21 22:08:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 52 states have (on average 2.3461538461538463) internal successors, (122), 105 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 22:08:42,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 22:08:42,163 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:42,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 22:08:42,164 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:42,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:42,170 INFO L85 PathProgramCache]: Analyzing trace with hash 8135, now seen corresponding path program 1 times [2023-11-21 22:08:42,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:08:42,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054360647] [2023-11-21 22:08:42,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:42,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:08:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:42,456 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-21 22:08:42,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:08:42,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054360647] [2023-11-21 22:08:42,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054360647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:42,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:42,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:08:42,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265963618] [2023-11-21 22:08:42,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:42,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:08:42,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:08:42,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:08:42,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:08:42,499 INFO L87 Difference]: Start difference. First operand has 110 states, 52 states have (on average 2.3461538461538463) internal successors, (122), 105 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 22:08:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:42,684 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2023-11-21 22:08:42,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:08:42,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-21 22:08:42,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:42,696 INFO L225 Difference]: With dead ends: 104 [2023-11-21 22:08:42,697 INFO L226 Difference]: Without dead ends: 103 [2023-11-21 22:08:42,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-21 22:08:42,706 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:42,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 58 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:08:42,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-21 22:08:42,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2023-11-21 22:08:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 50 states have (on average 2.12) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:42,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2023-11-21 22:08:42,764 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 2 [2023-11-21 22:08:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:42,764 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2023-11-21 22:08:42,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 22:08:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2023-11-21 22:08:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 22:08:42,767 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:42,767 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 22:08:42,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 22:08:42,769 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:42,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:42,770 INFO L85 PathProgramCache]: Analyzing trace with hash 8136, now seen corresponding path program 1 times [2023-11-21 22:08:42,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:08:42,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874098300] [2023-11-21 22:08:42,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:42,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:08:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:42,891 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-21 22:08:42,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:08:42,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874098300] [2023-11-21 22:08:42,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874098300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:42,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:42,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:08:42,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419984977] [2023-11-21 22:08:42,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:42,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:08:42,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:08:42,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:08:42,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:08:42,895 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 22:08:43,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:43,028 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2023-11-21 22:08:43,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:08:43,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-21 22:08:43,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:43,030 INFO L225 Difference]: With dead ends: 114 [2023-11-21 22:08:43,031 INFO L226 Difference]: Without dead ends: 114 [2023-11-21 22:08:43,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-21 22:08:43,033 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 81 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:43,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 64 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:08:43,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-21 22:08:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2023-11-21 22:08:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 55 states have (on average 1.981818181818182) internal successors, (109), 101 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2023-11-21 22:08:43,045 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 2 [2023-11-21 22:08:43,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:43,045 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2023-11-21 22:08:43,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 22:08:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2023-11-21 22:08:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-21 22:08:43,046 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:43,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:08:43,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 22:08:43,047 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:43,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:43,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1071020683, now seen corresponding path program 1 times [2023-11-21 22:08:43,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:08:43,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353418320] [2023-11-21 22:08:43,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:43,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:08:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:43,258 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-21 22:08:43,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:08:43,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353418320] [2023-11-21 22:08:43,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353418320] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:43,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:43,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:08:43,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083665963] [2023-11-21 22:08:43,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:43,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:08:43,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:08:43,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:08:43,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:08:43,261 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-21 22:08:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:43,450 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2023-11-21 22:08:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:08:43,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2023-11-21 22:08:43,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:43,456 INFO L225 Difference]: With dead ends: 106 [2023-11-21 22:08:43,457 INFO L226 Difference]: Without dead ends: 106 [2023-11-21 22:08:43,458 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-21 22:08:43,467 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 129 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:43,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 48 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:08:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-21 22:08:43,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2023-11-21 22:08:43,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.793103448275862) internal successors, (104), 93 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2023-11-21 22:08:43,498 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 6 [2023-11-21 22:08:43,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:43,498 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2023-11-21 22:08:43,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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-21 22:08:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2023-11-21 22:08:43,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-21 22:08:43,500 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:43,500 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:08:43,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 22:08:43,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:43,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:43,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1071020682, now seen corresponding path program 1 times [2023-11-21 22:08:43,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:08:43,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199382448] [2023-11-21 22:08:43,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:43,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:08:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:43,799 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-21 22:08:43,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:08:43,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199382448] [2023-11-21 22:08:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199382448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:43,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:43,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:08:43,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201195151] [2023-11-21 22:08:43,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:43,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:08:43,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:08:43,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:08:43,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:08:43,802 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 22:08:44,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:44,037 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2023-11-21 22:08:44,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:08:44,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-11-21 22:08:44,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:44,040 INFO L225 Difference]: With dead ends: 124 [2023-11-21 22:08:44,040 INFO L226 Difference]: Without dead ends: 124 [2023-11-21 22:08:44,040 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-21 22:08:44,043 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 117 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:44,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 70 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:08:44,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-21 22:08:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2023-11-21 22:08:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.6911764705882353) internal successors, (115), 102 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:44,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-11-21 22:08:44,059 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 6 [2023-11-21 22:08:44,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:44,059 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-11-21 22:08:44,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 22:08:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-11-21 22:08:44,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 22:08:44,061 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:44,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:08:44,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 22:08:44,061 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:44,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1541477145, now seen corresponding path program 1 times [2023-11-21 22:08:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:08:44,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402460518] [2023-11-21 22:08:44,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:44,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:08:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:44,212 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-21 22:08:44,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:08:44,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402460518] [2023-11-21 22:08:44,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402460518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:44,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:44,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:08:44,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234954844] [2023-11-21 22:08:44,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:44,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:08:44,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:08:44,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:08:44,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:08:44,218 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-21 22:08:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:44,418 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2023-11-21 22:08:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:08:44,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2023-11-21 22:08:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:44,419 INFO L225 Difference]: With dead ends: 111 [2023-11-21 22:08:44,420 INFO L226 Difference]: Without dead ends: 111 [2023-11-21 22:08:44,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:08:44,421 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 44 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:44,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 141 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:08:44,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-21 22:08:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2023-11-21 22:08:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 101 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2023-11-21 22:08:44,441 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 8 [2023-11-21 22:08:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:44,442 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2023-11-21 22:08:44,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-21 22:08:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2023-11-21 22:08:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 22:08:44,443 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:44,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:08:44,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 22:08:44,444 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:44,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:44,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1541477146, now seen corresponding path program 1 times [2023-11-21 22:08:44,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:08:44,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140029389] [2023-11-21 22:08:44,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:44,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:08:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:44,686 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-21 22:08:44,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:08:44,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140029389] [2023-11-21 22:08:44,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140029389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:44,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:44,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:08:44,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338565969] [2023-11-21 22:08:44,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:44,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:08:44,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:08:44,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:08:44,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:08:44,689 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-21 22:08:44,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:44,886 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2023-11-21 22:08:44,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:08:44,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2023-11-21 22:08:44,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:44,887 INFO L225 Difference]: With dead ends: 103 [2023-11-21 22:08:44,888 INFO L226 Difference]: Without dead ends: 103 [2023-11-21 22:08:44,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:08:44,889 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:44,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 183 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:08:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-21 22:08:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2023-11-21 22:08:44,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.6029411764705883) internal successors, (109), 96 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:44,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2023-11-21 22:08:44,903 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 8 [2023-11-21 22:08:44,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:44,904 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2023-11-21 22:08:44,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-21 22:08:44,905 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2023-11-21 22:08:44,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 22:08:44,906 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:44,906 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:08:44,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 22:08:44,906 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:44,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash -615643891, now seen corresponding path program 1 times [2023-11-21 22:08:44,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:08:44,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837019822] [2023-11-21 22:08:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:08:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:44,979 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-21 22:08:44,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:08:44,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837019822] [2023-11-21 22:08:44,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837019822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:44,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:44,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:08:44,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043494691] [2023-11-21 22:08:44,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:44,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:08:44,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:08:44,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:08:44,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:08:44,981 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:45,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:45,099 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-11-21 22:08:45,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:08:45,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-21 22:08:45,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:45,100 INFO L225 Difference]: With dead ends: 112 [2023-11-21 22:08:45,100 INFO L226 Difference]: Without dead ends: 112 [2023-11-21 22:08:45,101 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-21 22:08:45,104 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 91 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:45,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 97 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:08:45,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-21 22:08:45,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2023-11-21 22:08:45,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 95 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:45,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2023-11-21 22:08:45,122 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 10 [2023-11-21 22:08:45,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:45,123 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2023-11-21 22:08:45,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:45,123 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2023-11-21 22:08:45,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-21 22:08:45,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:45,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:08:45,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 22:08:45,125 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:45,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:45,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1281614861, now seen corresponding path program 1 times [2023-11-21 22:08:45,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:08:45,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19008729] [2023-11-21 22:08:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:45,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:08:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:45,294 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-21 22:08:45,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:08:45,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19008729] [2023-11-21 22:08:45,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19008729] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:45,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:45,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:08:45,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882125469] [2023-11-21 22:08:45,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:45,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 22:08:45,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:08:45,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:08:45,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:08:45,297 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:45,529 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2023-11-21 22:08:45,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:08:45,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-21 22:08:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:45,531 INFO L225 Difference]: With dead ends: 150 [2023-11-21 22:08:45,531 INFO L226 Difference]: Without dead ends: 150 [2023-11-21 22:08:45,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-21 22:08:45,532 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 184 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:45,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 161 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-21 22:08:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-21 22:08:45,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 104. [2023-11-21 22:08:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.52) internal successors, (114), 102 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2023-11-21 22:08:45,538 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 13 [2023-11-21 22:08:45,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:45,539 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2023-11-21 22:08:45,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:45,539 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2023-11-21 22:08:45,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-21 22:08:45,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:45,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:08:45,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 22:08:45,540 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:45,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:45,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1074885830, now seen corresponding path program 1 times [2023-11-21 22:08:45,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:08:45,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748754286] [2023-11-21 22:08:45,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:45,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:08:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:45,681 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-21 22:08:45,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:08:45,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748754286] [2023-11-21 22:08:45,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748754286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:45,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:45,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:08:45,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701494559] [2023-11-21 22:08:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:45,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:08:45,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:08:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:08:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:08:45,684 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-21 22:08:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:45,822 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2023-11-21 22:08:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:08:45,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2023-11-21 22:08:45,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:45,828 INFO L225 Difference]: With dead ends: 104 [2023-11-21 22:08:45,828 INFO L226 Difference]: Without dead ends: 104 [2023-11-21 22:08:45,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:08:45,831 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 31 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:45,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 133 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:08:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-21 22:08:45,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2023-11-21 22:08:45,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 101 states have internal predecessors, (113), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2023-11-21 22:08:45,839 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 13 [2023-11-21 22:08:45,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:45,839 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2023-11-21 22:08:45,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-21 22:08:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2023-11-21 22:08:45,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-21 22:08:45,840 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:45,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:08:45,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 22:08:45,841 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:45,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:45,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1074885829, now seen corresponding path program 1 times [2023-11-21 22:08:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:08:45,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347639873] [2023-11-21 22:08:45,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:08:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:46,088 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-21 22:08:46,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:08:46,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347639873] [2023-11-21 22:08:46,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347639873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:46,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:46,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:08:46,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737138177] [2023-11-21 22:08:46,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:46,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:08:46,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:08:46,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:08:46,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:08:46,091 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-21 22:08:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:46,240 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2023-11-21 22:08:46,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:08:46,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2023-11-21 22:08:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:46,242 INFO L225 Difference]: With dead ends: 100 [2023-11-21 22:08:46,242 INFO L226 Difference]: Without dead ends: 100 [2023-11-21 22:08:46,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:08:46,243 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:46,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 174 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:08:46,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-21 22:08:46,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2023-11-21 22:08:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 93 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2023-11-21 22:08:46,248 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 13 [2023-11-21 22:08:46,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:46,248 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2023-11-21 22:08:46,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-21 22:08:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2023-11-21 22:08:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-21 22:08:46,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:46,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:08:46,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 22:08:46,250 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:46,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:46,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2065078586, now seen corresponding path program 1 times [2023-11-21 22:08:46,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:08:46,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855532331] [2023-11-21 22:08:46,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:46,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:08:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:46,310 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-21 22:08:46,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:08:46,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855532331] [2023-11-21 22:08:46,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855532331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:46,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:46,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:08:46,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247341089] [2023-11-21 22:08:46,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:46,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:08:46,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:08:46,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:08:46,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:08:46,313 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-21 22:08:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:46,430 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2023-11-21 22:08:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:08:46,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-21 22:08:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:46,432 INFO L225 Difference]: With dead ends: 95 [2023-11-21 22:08:46,432 INFO L226 Difference]: Without dead ends: 95 [2023-11-21 22:08:46,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:08:46,433 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 9 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:46,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 170 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-21 22:08:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-21 22:08:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2023-11-21 22:08:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.457142857142857) internal successors, (102), 92 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2023-11-21 22:08:46,437 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 16 [2023-11-21 22:08:46,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:46,437 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2023-11-21 22:08:46,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-21 22:08:46,437 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2023-11-21 22:08:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-21 22:08:46,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:46,441 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-21 22:08:46,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 22:08:46,441 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:46,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:46,442 INFO L85 PathProgramCache]: Analyzing trace with hash -153465007, now seen corresponding path program 1 times [2023-11-21 22:08:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:08:46,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534596423] [2023-11-21 22:08:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:08:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:08:46,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:08:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:08:46,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:08:46,494 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:08:46,495 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2023-11-21 22:08:46,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2023-11-21 22:08:46,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2023-11-21 22:08:46,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2023-11-21 22:08:46,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2023-11-21 22:08:46,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2023-11-21 22:08:46,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2023-11-21 22:08:46,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2023-11-21 22:08:46,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2023-11-21 22:08:46,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2023-11-21 22:08:46,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2023-11-21 22:08:46,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2023-11-21 22:08:46,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2023-11-21 22:08:46,499 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2023-11-21 22:08:46,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2023-11-21 22:08:46,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2023-11-21 22:08:46,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2023-11-21 22:08:46,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2023-11-21 22:08:46,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2023-11-21 22:08:46,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2023-11-21 22:08:46,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2023-11-21 22:08:46,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2023-11-21 22:08:46,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2023-11-21 22:08:46,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2023-11-21 22:08:46,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2023-11-21 22:08:46,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2023-11-21 22:08:46,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2023-11-21 22:08:46,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2023-11-21 22:08:46,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2023-11-21 22:08:46,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2023-11-21 22:08:46,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2023-11-21 22:08:46,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 53 remaining) [2023-11-21 22:08:46,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 53 remaining) [2023-11-21 22:08:46,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 53 remaining) [2023-11-21 22:08:46,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 53 remaining) [2023-11-21 22:08:46,506 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2023-11-21 22:08:46,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2023-11-21 22:08:46,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2023-11-21 22:08:46,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2023-11-21 22:08:46,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (13 of 53 remaining) [2023-11-21 22:08:46,507 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (12 of 53 remaining) [2023-11-21 22:08:46,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (11 of 53 remaining) [2023-11-21 22:08:46,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2023-11-21 22:08:46,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2023-11-21 22:08:46,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (8 of 53 remaining) [2023-11-21 22:08:46,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (7 of 53 remaining) [2023-11-21 22:08:46,508 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (6 of 53 remaining) [2023-11-21 22:08:46,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2023-11-21 22:08:46,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2023-11-21 22:08:46,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (3 of 53 remaining) [2023-11-21 22:08:46,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (2 of 53 remaining) [2023-11-21 22:08:46,509 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (1 of 53 remaining) [2023-11-21 22:08:46,510 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (0 of 53 remaining) [2023-11-21 22:08:46,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 22:08:46,515 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:08:46,519 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:08:46,535 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated [2023-11-21 22:08:46,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated [2023-11-21 22:08:46,537 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem12 [2023-11-21 22:08:46,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:08:46 BoogieIcfgContainer [2023-11-21 22:08:46,547 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:08:46,547 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:08:46,548 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:08:46,548 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:08:46,548 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:08:42" (3/4) ... [2023-11-21 22:08:46,551 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 22:08:46,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:08:46,552 INFO L158 Benchmark]: Toolchain (without parser) took 5968.49ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 113.0MB in the beginning and 106.0MB in the end (delta: 7.1MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2023-11-21 22:08:46,553 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 111.1MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:08:46,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 537.27ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 94.6MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-21 22:08:46,553 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.41ms. Allocated memory is still 153.1MB. Free memory was 94.6MB in the beginning and 92.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:08:46,554 INFO L158 Benchmark]: Boogie Preprocessor took 74.00ms. Allocated memory is still 153.1MB. Free memory was 92.6MB in the beginning and 90.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 22:08:46,555 INFO L158 Benchmark]: RCFGBuilder took 787.29ms. Allocated memory is still 153.1MB. Free memory was 90.5MB in the beginning and 121.0MB in the end (delta: -30.5MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2023-11-21 22:08:46,555 INFO L158 Benchmark]: TraceAbstraction took 4482.06ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 120.2MB in the beginning and 107.0MB in the end (delta: 13.2MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2023-11-21 22:08:46,556 INFO L158 Benchmark]: Witness Printer took 4.48ms. Allocated memory is still 184.5MB. Free memory was 107.0MB in the beginning and 106.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:08:46,557 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.28ms. Allocated memory is still 111.1MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 537.27ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 94.6MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.41ms. Allocated memory is still 153.1MB. Free memory was 94.6MB in the beginning and 92.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.00ms. Allocated memory is still 153.1MB. Free memory was 92.6MB in the beginning and 90.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 787.29ms. Allocated memory is still 153.1MB. Free memory was 90.5MB in the beginning and 121.0MB in the end (delta: -30.5MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4482.06ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 120.2MB in the beginning and 107.0MB in the end (delta: 13.2MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Witness Printer took 4.48ms. Allocated memory is still 184.5MB. Free memory was 107.0MB in the beginning and 106.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem12 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 993. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) VAL [list={-1:0}] [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={-1:0}, list={-1:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1039] EXPR end->colour VAL [end={-1:0}, list={-1:0}] [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}] [L1043] EXPR end->colour VAL [end={-1:0}, list={-1:0}] [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next VAL [end={-1:0}, list={-1:0}] [L1049] COND TRUE !(end->next) [L1049] CALL reach_error() [L993] COND FALSE !(0) [L993] __assert_fail ("0", "sll-rb-cnstr_1-2.c", 13, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 786 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 786 mSDsluCounter, 1299 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 735 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1456 IncrementalHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 564 mSDtfsCounter, 1456 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=0, InterpolantAutomatonStates: 53, 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, 11 MinimizatonAttempts, 126 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 362 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-21 22:08:46,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --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 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:08:49,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:08:49,351 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-21 22:08:49,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:08:49,362 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:08:49,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:08:49,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:08:49,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:08:49,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 22:08:49,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 22:08:49,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:08:49,423 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:08:49,423 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:08:49,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:08:49,426 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:08:49,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:08:49,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:08:49,427 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:08:49,427 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 22:08:49,428 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 22:08:49,429 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 22:08:49,429 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 22:08:49,430 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 22:08:49,430 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-21 22:08:49,430 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-21 22:08:49,431 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:08:49,431 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:08:49,432 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:08:49,432 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:08:49,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:08:49,434 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 22:08:49,434 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 22:08:49,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:08:49,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:08:49,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 22:08:49,436 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-21 22:08:49,436 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-21 22:08:49,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 22:08:49,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 22:08:49,437 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 22:08:49,437 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 22:08:49,438 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-21 22:08:49,438 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_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/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_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 95643fe6222ef6bf06c5549a97aa2ed3c03be56764b1592b76d2122ae82e7069 [2023-11-21 22:08:49,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:08:49,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:08:49,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:08:49,894 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:08:49,895 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:08:49,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2023-11-21 22:08:52,985 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:08:53,327 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:08:53,328 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-2.i [2023-11-21 22:08:53,345 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/data/6953a8560/b1c9c62c9d8f44f58675f98ff899c609/FLAG8efdb0007 [2023-11-21 22:08:53,364 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/data/6953a8560/b1c9c62c9d8f44f58675f98ff899c609 [2023-11-21 22:08:53,370 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:08:53,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:08:53,378 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:08:53,378 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:08:53,384 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:08:53,385 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:08:53" (1/1) ... [2023-11-21 22:08:53,386 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c3b736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:53, skipping insertion in model container [2023-11-21 22:08:53,387 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:08:53" (1/1) ... [2023-11-21 22:08:53,462 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:08:53,886 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:08:53,902 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:08:53,943 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:08:54,006 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:08:54,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54 WrapperNode [2023-11-21 22:08:54,007 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:08:54,008 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:08:54,008 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:08:54,009 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:08:54,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54" (1/1) ... [2023-11-21 22:08:54,062 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54" (1/1) ... [2023-11-21 22:08:54,101 INFO L138 Inliner]: procedures = 122, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2023-11-21 22:08:54,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:08:54,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:08:54,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:08:54,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:08:54,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54" (1/1) ... [2023-11-21 22:08:54,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54" (1/1) ... [2023-11-21 22:08:54,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54" (1/1) ... [2023-11-21 22:08:54,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54" (1/1) ... [2023-11-21 22:08:54,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54" (1/1) ... [2023-11-21 22:08:54,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54" (1/1) ... [2023-11-21 22:08:54,164 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54" (1/1) ... [2023-11-21 22:08:54,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54" (1/1) ... [2023-11-21 22:08:54,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:08:54,177 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:08:54,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:08:54,184 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:08:54,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54" (1/1) ... [2023-11-21 22:08:54,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 22:08:54,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:08:54,233 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 22:08:54,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 22:08:54,282 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-21 22:08:54,282 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-21 22:08:54,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-21 22:08:54,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-21 22:08:54,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:08:54,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-21 22:08:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-21 22:08:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:08:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-21 22:08:54,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-21 22:08:54,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:08:54,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:08:54,460 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:08:54,471 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:08:55,130 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:08:55,222 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:08:55,222 INFO L308 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-21 22:08:55,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:08:55 BoogieIcfgContainer [2023-11-21 22:08:55,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:08:55,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 22:08:55,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 22:08:55,230 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 22:08:55,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 10:08:53" (1/3) ... [2023-11-21 22:08:55,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ff3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:08:55, skipping insertion in model container [2023-11-21 22:08:55,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:08:54" (2/3) ... [2023-11-21 22:08:55,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ff3b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 10:08:55, skipping insertion in model container [2023-11-21 22:08:55,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:08:55" (3/3) ... [2023-11-21 22:08:55,233 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-2.i [2023-11-21 22:08:55,252 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 22:08:55,252 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 53 error locations. [2023-11-21 22:08:55,301 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 22:08:55,307 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;@3aee4055, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 22:08:55,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 53 error locations. [2023-11-21 22:08:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 52 states have (on average 2.3461538461538463) internal successors, (122), 105 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 22:08:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 22:08:55,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:55,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 22:08:55,320 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:55,326 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash 8135, now seen corresponding path program 1 times [2023-11-21 22:08:55,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:08:55,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [99641315] [2023-11-21 22:08:55,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:55,342 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:08:55,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:08:55,349 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:08:55,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-21 22:08:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:55,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:08:55,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:08:55,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-21 22:08:55,538 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-21 22:08:55,539 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:08:55,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:08:55,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [99641315] [2023-11-21 22:08:55,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [99641315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:55,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:55,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:08:55,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911288121] [2023-11-21 22:08:55,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:55,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:08:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:08:55,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:08:55,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:08:55,593 INFO L87 Difference]: Start difference. First operand has 110 states, 52 states have (on average 2.3461538461538463) internal successors, (122), 105 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 22:08:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:55,933 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2023-11-21 22:08:55,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:08:55,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-21 22:08:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:55,967 INFO L225 Difference]: With dead ends: 104 [2023-11-21 22:08:55,967 INFO L226 Difference]: Without dead ends: 103 [2023-11-21 22:08:55,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-21 22:08:55,973 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:55,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 58 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 22:08:55,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-21 22:08:56,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2023-11-21 22:08:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 50 states have (on average 2.12) internal successors, (106), 98 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2023-11-21 22:08:56,027 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 2 [2023-11-21 22:08:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:56,028 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2023-11-21 22:08:56,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 22:08:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2023-11-21 22:08:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-21 22:08:56,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:56,031 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-21 22:08:56,039 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-21 22:08:56,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:08:56,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:56,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash 8136, now seen corresponding path program 1 times [2023-11-21 22:08:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:08:56,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125719570] [2023-11-21 22:08:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:56,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:08:56,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:08:56,245 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:08:56,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-21 22:08:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:56,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-21 22:08:56,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:08:56,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:08:56,360 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-21 22:08:56,361 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:08:56,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:08:56,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125719570] [2023-11-21 22:08:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125719570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:56,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:56,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 22:08:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836408957] [2023-11-21 22:08:56,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:56,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 22:08:56,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:08:56,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 22:08:56,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 22:08:56,369 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 22:08:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:56,719 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2023-11-21 22:08:56,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 22:08:56,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2023-11-21 22:08:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:56,721 INFO L225 Difference]: With dead ends: 114 [2023-11-21 22:08:56,722 INFO L226 Difference]: Without dead ends: 114 [2023-11-21 22:08:56,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-21 22:08:56,723 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 81 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:56,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 64 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 22:08:56,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-21 22:08:56,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2023-11-21 22:08:56,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 55 states have (on average 1.981818181818182) internal successors, (109), 101 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:56,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2023-11-21 22:08:56,749 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 2 [2023-11-21 22:08:56,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:56,749 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2023-11-21 22:08:56,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-21 22:08:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2023-11-21 22:08:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-21 22:08:56,751 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:56,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:08:56,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-21 22:08:56,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:08:56,954 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:56,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1071020683, now seen corresponding path program 1 times [2023-11-21 22:08:56,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:08:56,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794091921] [2023-11-21 22:08:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:56,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:08:56,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:08:56,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:08:56,962 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-21 22:08:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:57,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 22:08:57,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:08:57,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-21 22:08:57,105 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-21 22:08:57,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-21 22:08:57,123 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-21 22:08:57,124 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:08:57,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:08:57,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794091921] [2023-11-21 22:08:57,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794091921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:57,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:57,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:08:57,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693883908] [2023-11-21 22:08:57,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:57,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:08:57,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:08:57,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:08:57,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:08:57,127 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 22:08:57,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:57,536 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2023-11-21 22:08:57,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:08:57,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-11-21 22:08:57,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:57,539 INFO L225 Difference]: With dead ends: 106 [2023-11-21 22:08:57,539 INFO L226 Difference]: Without dead ends: 106 [2023-11-21 22:08:57,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:08:57,541 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 129 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:57,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 48 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 22:08:57,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-21 22:08:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 95. [2023-11-21 22:08:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 58 states have (on average 1.793103448275862) internal successors, (104), 93 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2023-11-21 22:08:57,551 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 6 [2023-11-21 22:08:57,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:57,551 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2023-11-21 22:08:57,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 22:08:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2023-11-21 22:08:57,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-21 22:08:57,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:57,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-21 22:08:57,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-21 22:08:57,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:08:57,767 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:57,768 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1071020682, now seen corresponding path program 1 times [2023-11-21 22:08:57,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:08:57,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082636744] [2023-11-21 22:08:57,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:57,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:08:57,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:08:57,771 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:08:57,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-21 22:08:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:57,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-21 22:08:57,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:08:57,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:08:57,979 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-21 22:08:57,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-21 22:08:57,996 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-21 22:08:57,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:08:57,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:08:57,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1082636744] [2023-11-21 22:08:57,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1082636744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:57,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:57,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 22:08:57,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724821107] [2023-11-21 22:08:57,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:57,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:08:57,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:08:57,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:08:57,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:08:57,999 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 22:08:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:58,503 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2023-11-21 22:08:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:08:58,504 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2023-11-21 22:08:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:58,506 INFO L225 Difference]: With dead ends: 124 [2023-11-21 22:08:58,506 INFO L226 Difference]: Without dead ends: 124 [2023-11-21 22:08:58,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:08:58,507 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 117 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:58,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 70 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 22:08:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-21 22:08:58,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 104. [2023-11-21 22:08:58,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 68 states have (on average 1.6911764705882353) internal successors, (115), 102 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:58,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 118 transitions. [2023-11-21 22:08:58,516 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 118 transitions. Word has length 6 [2023-11-21 22:08:58,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:58,516 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 118 transitions. [2023-11-21 22:08:58,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-21 22:08:58,517 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 118 transitions. [2023-11-21 22:08:58,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 22:08:58,523 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:58,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:08:58,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-21 22:08:58,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:08:58,725 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:58,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:58,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1541477145, now seen corresponding path program 1 times [2023-11-21 22:08:58,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:08:58,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009879827] [2023-11-21 22:08:58,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:58,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:08:58,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:08:58,729 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:08:58,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-21 22:08:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:58,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-21 22:08:58,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:08:58,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-21 22:08:58,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 22:08:58,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-21 22:08:58,872 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-21 22:08:58,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:08:58,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:08:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009879827] [2023-11-21 22:08:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009879827] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:58,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:58,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:08:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248203917] [2023-11-21 22:08:58,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:58,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:08:58,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:08:58,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:08:58,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:08:58,876 INFO L87 Difference]: Start difference. First operand 104 states and 118 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-21 22:08:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:08:59,357 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2023-11-21 22:08:59,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:08:59,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2023-11-21 22:08:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:08:59,361 INFO L225 Difference]: With dead ends: 111 [2023-11-21 22:08:59,361 INFO L226 Difference]: Without dead ends: 111 [2023-11-21 22:08:59,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:08:59,363 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 44 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 22:08:59,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 141 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 22:08:59,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-21 22:08:59,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 103. [2023-11-21 22:08:59,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.6764705882352942) internal successors, (114), 101 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:08:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 117 transitions. [2023-11-21 22:08:59,371 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 117 transitions. Word has length 8 [2023-11-21 22:08:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:08:59,371 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 117 transitions. [2023-11-21 22:08:59,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-21 22:08:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 117 transitions. [2023-11-21 22:08:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-21 22:08:59,372 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:08:59,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:08:59,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-21 22:08:59,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:08:59,575 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:08:59,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:08:59,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1541477146, now seen corresponding path program 1 times [2023-11-21 22:08:59,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:08:59,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997988071] [2023-11-21 22:08:59,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:08:59,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:08:59,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:08:59,578 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:08:59,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-21 22:08:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:08:59,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-21 22:08:59,700 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:08:59,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:08:59,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:08:59,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 22:08:59,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-21 22:08:59,819 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-21 22:08:59,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:08:59,820 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:08:59,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997988071] [2023-11-21 22:08:59,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997988071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:08:59,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:08:59,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:08:59,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057553783] [2023-11-21 22:08:59,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:08:59,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:08:59,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:08:59,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:08:59,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:08:59,823 INFO L87 Difference]: Start difference. First operand 103 states and 117 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-21 22:09:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:09:00,349 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2023-11-21 22:09:00,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 22:09:00,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2023-11-21 22:09:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:09:00,351 INFO L225 Difference]: With dead ends: 103 [2023-11-21 22:09:00,351 INFO L226 Difference]: Without dead ends: 103 [2023-11-21 22:09:00,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:09:00,352 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 10 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:09:00,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 183 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 22:09:00,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-11-21 22:09:00,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2023-11-21 22:09:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.6029411764705883) internal successors, (109), 96 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:00,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2023-11-21 22:09:00,359 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 8 [2023-11-21 22:09:00,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:09:00,360 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2023-11-21 22:09:00,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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-21 22:09:00,360 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2023-11-21 22:09:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-21 22:09:00,361 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:09:00,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:09:00,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-21 22:09:00,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:00,564 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:09:00,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:09:00,564 INFO L85 PathProgramCache]: Analyzing trace with hash -615643891, now seen corresponding path program 1 times [2023-11-21 22:09:00,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:09:00,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738948617] [2023-11-21 22:09:00,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:00,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:00,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:09:00,566 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:09:00,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-21 22:09:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:00,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-21 22:09:00,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:09:00,655 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-21 22:09:00,655 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:09:00,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:09:00,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738948617] [2023-11-21 22:09:00,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738948617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:09:00,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:09:00,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 22:09:00,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815755840] [2023-11-21 22:09:00,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:09:00,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 22:09:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:09:00,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 22:09:00,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 22:09:00,658 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:09:00,954 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-11-21 22:09:00,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 22:09:00,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-21 22:09:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:09:00,960 INFO L225 Difference]: With dead ends: 112 [2023-11-21 22:09:00,960 INFO L226 Difference]: Without dead ends: 112 [2023-11-21 22:09:00,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-21 22:09:00,961 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 91 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-21 22:09:00,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 97 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-21 22:09:00,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-21 22:09:00,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 97. [2023-11-21 22:09:00,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 95 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:00,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2023-11-21 22:09:00,968 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 10 [2023-11-21 22:09:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:09:00,969 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2023-11-21 22:09:00,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2023-11-21 22:09:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-21 22:09:00,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:09:00,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:09:00,977 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-21 22:09:01,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:01,173 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:09:01,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:09:01,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1281614861, now seen corresponding path program 1 times [2023-11-21 22:09:01,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:09:01,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69846989] [2023-11-21 22:09:01,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:01,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:01,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:09:01,175 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:09:01,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-21 22:09:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:01,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 22:09:01,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:09:01,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-21 22:09:01,326 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-21 22:09:01,327 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:09:01,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:09:01,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69846989] [2023-11-21 22:09:01,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69846989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:09:01,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:09:01,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:09:01,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275692202] [2023-11-21 22:09:01,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:09:01,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:09:01,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:09:01,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:09:01,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:09:01,330 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:01,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:09:01,867 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2023-11-21 22:09:01,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:09:01,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-21 22:09:01,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:09:01,870 INFO L225 Difference]: With dead ends: 150 [2023-11-21 22:09:01,870 INFO L226 Difference]: Without dead ends: 150 [2023-11-21 22:09:01,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:09:01,871 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 71 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:09:01,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 159 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 22:09:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-21 22:09:01,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 104. [2023-11-21 22:09:01,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.52) internal successors, (114), 102 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:01,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2023-11-21 22:09:01,888 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 13 [2023-11-21 22:09:01,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:09:01,888 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2023-11-21 22:09:01,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2023-11-21 22:09:01,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-21 22:09:01,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:09:01,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:09:01,896 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-21 22:09:02,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:02,090 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:09:02,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:09:02,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1074885830, now seen corresponding path program 1 times [2023-11-21 22:09:02,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:09:02,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307682712] [2023-11-21 22:09:02,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:02,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:02,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:09:02,092 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:09:02,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-21 22:09:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:02,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 22:09:02,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:09:02,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-21 22:09:02,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 22:09:02,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-21 22:09:02,248 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-21 22:09:02,248 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:09:02,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:09:02,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307682712] [2023-11-21 22:09:02,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307682712] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:09:02,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:09:02,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:09:02,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964307206] [2023-11-21 22:09:02,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:09:02,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:09:02,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:09:02,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:09:02,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:09:02,251 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-21 22:09:02,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:09:02,698 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2023-11-21 22:09:02,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:09:02,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2023-11-21 22:09:02,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:09:02,701 INFO L225 Difference]: With dead ends: 104 [2023-11-21 22:09:02,701 INFO L226 Difference]: Without dead ends: 104 [2023-11-21 22:09:02,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:09:02,702 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 31 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 22:09:02,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 133 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 22:09:02,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-21 22:09:02,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2023-11-21 22:09:02,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 101 states have internal predecessors, (113), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2023-11-21 22:09:02,707 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 13 [2023-11-21 22:09:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:09:02,707 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2023-11-21 22:09:02,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-21 22:09:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2023-11-21 22:09:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-21 22:09:02,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:09:02,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:09:02,715 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-21 22:09:02,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:02,909 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:09:02,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:09:02,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1074885829, now seen corresponding path program 1 times [2023-11-21 22:09:02,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:09:02,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1736585933] [2023-11-21 22:09:02,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:02,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:02,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:09:02,911 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:09:02,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-21 22:09:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:03,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-21 22:09:03,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:09:03,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-21 22:09:03,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 22:09:03,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:09:03,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-21 22:09:03,125 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-21 22:09:03,126 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:09:03,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:09:03,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1736585933] [2023-11-21 22:09:03,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1736585933] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:09:03,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:09:03,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 22:09:03,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843245186] [2023-11-21 22:09:03,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:09:03,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:09:03,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:09:03,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:09:03,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:09:03,128 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-21 22:09:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:09:03,590 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2023-11-21 22:09:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 22:09:03,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2023-11-21 22:09:03,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:09:03,591 INFO L225 Difference]: With dead ends: 100 [2023-11-21 22:09:03,591 INFO L226 Difference]: Without dead ends: 100 [2023-11-21 22:09:03,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:09:03,592 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 5 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-21 22:09:03,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 174 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-21 22:09:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-21 22:09:03,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2023-11-21 22:09:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 93 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2023-11-21 22:09:03,597 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 13 [2023-11-21 22:09:03,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:09:03,597 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2023-11-21 22:09:03,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 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-21 22:09:03,598 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2023-11-21 22:09:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-21 22:09:03,599 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:09:03,599 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:09:03,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-21 22:09:03,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:03,802 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:09:03,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:09:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash 2065078586, now seen corresponding path program 1 times [2023-11-21 22:09:03,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:09:03,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319806449] [2023-11-21 22:09:03,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:03,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:03,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:09:03,805 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:09:03,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-21 22:09:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:09:03,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-21 22:09:03,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:09:03,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-21 22:09:03,959 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-21 22:09:03,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-21 22:09:03,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-21 22:09:03,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319806449] [2023-11-21 22:09:03,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319806449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:09:03,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:09:03,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 22:09:03,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524155894] [2023-11-21 22:09:03,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:09:03,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 22:09:03,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-21 22:09:03,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 22:09:03,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-21 22:09:03,962 INFO L87 Difference]: Start difference. First operand 95 states and 106 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-21 22:09:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:09:04,455 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2023-11-21 22:09:04,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:09:04,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-21 22:09:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-21 22:09:04,460 INFO L225 Difference]: With dead ends: 140 [2023-11-21 22:09:04,460 INFO L226 Difference]: Without dead ends: 140 [2023-11-21 22:09:04,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 22:09:04,461 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 62 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-21 22:09:04,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 150 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-21 22:09:04,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-21 22:09:04,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2023-11-21 22:09:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.44) internal successors, (108), 97 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 22:09:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2023-11-21 22:09:04,465 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 16 [2023-11-21 22:09:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-21 22:09:04,466 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2023-11-21 22:09:04,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-21 22:09:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2023-11-21 22:09:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-21 22:09:04,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-21 22:09:04,467 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-21 22:09:04,474 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-21 22:09:04,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:04,670 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 50 more)] === [2023-11-21 22:09:04,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:09:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash -153465007, now seen corresponding path program 1 times [2023-11-21 22:09:04,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-21 22:09:04,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1508829304] [2023-11-21 22:09:04,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:09:04,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:04,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat [2023-11-21 22:09:04,672 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-21 22:09:04,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-21 22:09:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:09:04,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:09:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:09:04,848 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-21 22:09:04,848 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 22:09:04,849 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK (52 of 53 remaining) [2023-11-21 22:09:04,851 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 53 remaining) [2023-11-21 22:09:04,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 53 remaining) [2023-11-21 22:09:04,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 53 remaining) [2023-11-21 22:09:04,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 53 remaining) [2023-11-21 22:09:04,852 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 53 remaining) [2023-11-21 22:09:04,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 53 remaining) [2023-11-21 22:09:04,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 53 remaining) [2023-11-21 22:09:04,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 53 remaining) [2023-11-21 22:09:04,853 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 53 remaining) [2023-11-21 22:09:04,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 53 remaining) [2023-11-21 22:09:04,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 53 remaining) [2023-11-21 22:09:04,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 53 remaining) [2023-11-21 22:09:04,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 53 remaining) [2023-11-21 22:09:04,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 53 remaining) [2023-11-21 22:09:04,854 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 53 remaining) [2023-11-21 22:09:04,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 53 remaining) [2023-11-21 22:09:04,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 53 remaining) [2023-11-21 22:09:04,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 53 remaining) [2023-11-21 22:09:04,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 53 remaining) [2023-11-21 22:09:04,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 53 remaining) [2023-11-21 22:09:04,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 53 remaining) [2023-11-21 22:09:04,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 53 remaining) [2023-11-21 22:09:04,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 53 remaining) [2023-11-21 22:09:04,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 53 remaining) [2023-11-21 22:09:04,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 53 remaining) [2023-11-21 22:09:04,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 53 remaining) [2023-11-21 22:09:04,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 53 remaining) [2023-11-21 22:09:04,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 53 remaining) [2023-11-21 22:09:04,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 53 remaining) [2023-11-21 22:09:04,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 53 remaining) [2023-11-21 22:09:04,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 53 remaining) [2023-11-21 22:09:04,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 53 remaining) [2023-11-21 22:09:04,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 53 remaining) [2023-11-21 22:09:04,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 53 remaining) [2023-11-21 22:09:04,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 53 remaining) [2023-11-21 22:09:04,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 53 remaining) [2023-11-21 22:09:04,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 53 remaining) [2023-11-21 22:09:04,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 53 remaining) [2023-11-21 22:09:04,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (13 of 53 remaining) [2023-11-21 22:09:04,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (12 of 53 remaining) [2023-11-21 22:09:04,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (11 of 53 remaining) [2023-11-21 22:09:04,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 53 remaining) [2023-11-21 22:09:04,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 53 remaining) [2023-11-21 22:09:04,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (8 of 53 remaining) [2023-11-21 22:09:04,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (7 of 53 remaining) [2023-11-21 22:09:04,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (6 of 53 remaining) [2023-11-21 22:09:04,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 53 remaining) [2023-11-21 22:09:04,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 53 remaining) [2023-11-21 22:09:04,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE (3 of 53 remaining) [2023-11-21 22:09:04,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE (2 of 53 remaining) [2023-11-21 22:09:04,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (1 of 53 remaining) [2023-11-21 22:09:04,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK (0 of 53 remaining) [2023-11-21 22:09:04,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-21 22:09:05,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-21 22:09:05,070 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:09:05,074 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 22:09:05,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated [2023-11-21 22:09:05,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated [2023-11-21 22:09:05,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~mem12 [2023-11-21 22:09:05,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 10:09:05 BoogieIcfgContainer [2023-11-21 22:09:05,097 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 22:09:05,098 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 22:09:05,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 22:09:05,098 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 22:09:05,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:08:55" (3/4) ... [2023-11-21 22:09:05,101 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 22:09:05,102 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 22:09:05,103 INFO L158 Benchmark]: Toolchain (without parser) took 11731.58ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 65.3MB in the beginning and 77.1MB in the end (delta: -11.8MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2023-11-21 22:09:05,103 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 62.9MB. Free memory is still 38.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:09:05,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 629.43ms. Allocated memory is still 90.2MB. Free memory was 65.1MB in the beginning and 66.4MB in the end (delta: -1.3MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2023-11-21 22:09:05,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.89ms. Allocated memory is still 90.2MB. Free memory was 66.4MB in the beginning and 64.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-21 22:09:05,104 INFO L158 Benchmark]: Boogie Preprocessor took 73.96ms. Allocated memory is still 90.2MB. Free memory was 64.3MB in the beginning and 62.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:09:05,105 INFO L158 Benchmark]: RCFGBuilder took 1046.51ms. Allocated memory is still 90.2MB. Free memory was 62.2MB in the beginning and 60.0MB in the end (delta: 2.2MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2023-11-21 22:09:05,105 INFO L158 Benchmark]: TraceAbstraction took 9871.54ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 59.6MB in the beginning and 77.1MB in the end (delta: -17.5MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. [2023-11-21 22:09:05,106 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 109.1MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 22:09:05,107 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.29ms. Allocated memory is still 62.9MB. Free memory is still 38.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 629.43ms. Allocated memory is still 90.2MB. Free memory was 65.1MB in the beginning and 66.4MB in the end (delta: -1.3MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.89ms. Allocated memory is still 90.2MB. Free memory was 66.4MB in the beginning and 64.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.96ms. Allocated memory is still 90.2MB. Free memory was 64.3MB in the beginning and 62.2MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1046.51ms. Allocated memory is still 90.2MB. Free memory was 62.2MB in the beginning and 60.0MB in the end (delta: 2.2MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9871.54ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 59.6MB in the beginning and 77.1MB in the end (delta: -17.5MB). Peak memory consumption was 43.8MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 109.1MB. Free memory is still 77.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem8 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~mem12 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 993. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) VAL [list={6:0}] [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={6:0}, list={6:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list VAL [end={6:0}, list={6:0}] [L1038] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}] [L1039] EXPR end->colour VAL [end={6:0}, list={6:0}] [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end VAL [end={6:0}, list={6:0}] [L1043] EXPR end->colour VAL [end={6:0}, list={6:0}] [L1043] COND FALSE !(RED == end->colour) [L1049] EXPR end->next VAL [end={6:0}, list={6:0}] [L1049] COND TRUE !(end->next) [L1049] CALL reach_error() [L993] COND FALSE !(0) [L993] __assert_fail ("0", "sll-rb-cnstr_1-2.c", 13, __extension__ __PRETTY_FUNCTION__) - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 53 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 726 mSDsluCounter, 1277 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 723 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1472 IncrementalHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 554 mSDtfsCounter, 1472 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=0, InterpolantAutomatonStates: 53, 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, 11 MinimizatonAttempts, 166 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 428 SizeOfPredicates, 22 NumberOfNonLiveVariables, 779 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-21 22:09:05,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ae8b4159-df83-4581-a85c-dde7329652e4/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample