./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:30:51,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:30:51,390 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 04:30:51,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:30:51,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:30:51,438 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:30:51,440 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:30:51,440 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:30:51,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:30:51,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:30:51,442 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:30:51,442 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:30:51,442 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:30:51,442 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:30:51,443 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:30:51,443 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:30:51,443 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:30:51,444 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:30:51,444 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:30:51,444 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:30:51,445 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:30:51,445 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:30:51,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:30:51,445 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:30:51,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:30:51,445 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:30:51,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:30:51,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:30:51,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:30:51,446 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 04:30:51,447 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 04:30:51,447 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 04:30:51,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:30:51,447 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:30:51,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:30:51,448 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:30:51,448 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:30:51,448 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:30:51,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:30:51,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:30:51,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:30:51,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:30:51,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:30:51,449 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:30:51,449 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:30:51,449 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:30:51,449 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:30:51,449 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:30:51,449 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:30:51,449 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E 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 -> Taipan 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 -> 3b4637ab5710a1ca22a981e8047278048fbbf856825d3649b2cb9d48de11d175 [2024-11-14 04:30:51,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:30:51,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:30:51,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:30:51,786 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:30:51,787 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:30:51,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i Unable to find full path for "g++" [2024-11-14 04:30:53,700 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:30:54,057 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:30:54,060 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/sv-benchmarks/c/list-ext3-properties/dll_nullified-2.i [2024-11-14 04:30:54,081 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/data/58397392e/feb8c6c8ce5f41d4ac9782217aef024f/FLAG96fce5827 [2024-11-14 04:30:54,106 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/data/58397392e/feb8c6c8ce5f41d4ac9782217aef024f [2024-11-14 04:30:54,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:30:54,112 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:30:54,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:30:54,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:30:54,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:30:54,121 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7488de4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54, skipping insertion in model container [2024-11-14 04:30:54,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,176 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:30:54,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:30:54,636 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:30:54,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:30:54,714 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:30:54,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54 WrapperNode [2024-11-14 04:30:54,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:30:54,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:30:54,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:30:54,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:30:54,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,737 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,767 INFO L138 Inliner]: procedures = 122, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 111 [2024-11-14 04:30:54,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:30:54,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:30:54,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:30:54,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:30:54,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,785 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,808 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:30:54,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:30:54,824 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:30:54,825 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:30:54,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54" (1/1) ... [2024-11-14 04:30:54,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:30:54,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:30:54,870 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:30:54,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:30:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:30:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:30:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:30:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:30:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:30:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:30:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:30:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:30:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:30:54,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:30:55,064 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:30:55,067 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:30:55,489 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-14 04:30:55,489 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:30:55,552 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:30:55,552 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-14 04:30:55,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:30:55 BoogieIcfgContainer [2024-11-14 04:30:55,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:30:55,555 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:30:55,555 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:30:55,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:30:55,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:30:54" (1/3) ... [2024-11-14 04:30:55,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3279dc42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:30:55, skipping insertion in model container [2024-11-14 04:30:55,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:30:54" (2/3) ... [2024-11-14 04:30:55,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3279dc42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:30:55, skipping insertion in model container [2024-11-14 04:30:55,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:30:55" (3/3) ... [2024-11-14 04:30:55,563 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2024-11-14 04:30:55,577 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:30:55,579 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_nullified-2.i that has 1 procedures, 75 locations, 1 initial locations, 3 loop locations, and 35 error locations. [2024-11-14 04:30:55,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:30:55,641 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@736c4de5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:30:55,641 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2024-11-14 04:30:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 39 states have (on average 2.230769230769231) internal successors, (87), 74 states have internal predecessors, (87), 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) [2024-11-14 04:30:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 04:30:55,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:55,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 04:30:55,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:30:55,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash 200592, now seen corresponding path program 1 times [2024-11-14 04:30:55,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:55,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978074502] [2024-11-14 04:30:55,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:55,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:55,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:55,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978074502] [2024-11-14 04:30:55,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978074502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:55,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:55,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:30:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037841526] [2024-11-14 04:30:55,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:55,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:30:55,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:55,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:30:55,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:30:55,873 INFO L87 Difference]: Start difference. First operand has 75 states, 39 states have (on average 2.230769230769231) internal successors, (87), 74 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:55,945 INFO L93 Difference]: Finished difference Result 97 states and 108 transitions. [2024-11-14 04:30:55,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:30:55,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 04:30:55,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:55,955 INFO L225 Difference]: With dead ends: 97 [2024-11-14 04:30:55,955 INFO L226 Difference]: Without dead ends: 94 [2024-11-14 04:30:55,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:30:55,960 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 24 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:55,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 138 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 04:30:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-14 04:30:55,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2024-11-14 04:30:55,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 72 states have internal predecessors, (81), 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) [2024-11-14 04:30:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2024-11-14 04:30:55,999 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 3 [2024-11-14 04:30:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:56,000 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2024-11-14 04:30:56,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:56,000 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2024-11-14 04:30:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 04:30:56,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:56,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 04:30:56,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:30:56,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:30:56,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:56,002 INFO L85 PathProgramCache]: Analyzing trace with hash 6057698, now seen corresponding path program 1 times [2024-11-14 04:30:56,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:56,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108337649] [2024-11-14 04:30:56,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:56,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:56,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:56,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108337649] [2024-11-14 04:30:56,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108337649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:56,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:56,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:30:56,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304252061] [2024-11-14 04:30:56,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:56,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:30:56,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:56,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:30:56,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:30:56,084 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 04:30:56,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:56,235 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2024-11-14 04:30:56,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:30:56,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-14 04:30:56,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:56,238 INFO L225 Difference]: With dead ends: 68 [2024-11-14 04:30:56,238 INFO L226 Difference]: Without dead ends: 68 [2024-11-14 04:30:56,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:30:56,241 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 10 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:56,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 83 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:30:56,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-14 04:30:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-14 04:30:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 38 states have (on average 2.0) internal successors, (76), 67 states have internal predecessors, (76), 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) [2024-11-14 04:30:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2024-11-14 04:30:56,256 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 4 [2024-11-14 04:30:56,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:56,257 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2024-11-14 04:30:56,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 04:30:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2024-11-14 04:30:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 04:30:56,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:56,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 04:30:56,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:30:56,258 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:30:56,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash 6057699, now seen corresponding path program 1 times [2024-11-14 04:30:56,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:56,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175950577] [2024-11-14 04:30:56,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:56,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:56,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:56,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:56,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:56,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175950577] [2024-11-14 04:30:56,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175950577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:56,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:56,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:30:56,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285080569] [2024-11-14 04:30:56,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:56,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:30:56,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:56,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:30:56,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:30:56,457 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 04:30:56,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:56,587 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2024-11-14 04:30:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:30:56,588 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-14 04:30:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:56,589 INFO L225 Difference]: With dead ends: 63 [2024-11-14 04:30:56,591 INFO L226 Difference]: Without dead ends: 63 [2024-11-14 04:30:56,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:30:56,593 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 10 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:56,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 86 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:30:56,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-14 04:30:56,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-14 04:30:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.868421052631579) internal successors, (71), 62 states have internal predecessors, (71), 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) [2024-11-14 04:30:56,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-11-14 04:30:56,603 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 4 [2024-11-14 04:30:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:56,605 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-11-14 04:30:56,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2024-11-14 04:30:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-11-14 04:30:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 04:30:56,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:56,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:56,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:30:56,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:30:56,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:56,607 INFO L85 PathProgramCache]: Analyzing trace with hash -597641655, now seen corresponding path program 1 times [2024-11-14 04:30:56,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:56,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630035713] [2024-11-14 04:30:56,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:56,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:56,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:56,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:56,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630035713] [2024-11-14 04:30:56,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630035713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:30:56,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:30:56,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:30:56,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100685454] [2024-11-14 04:30:56,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:30:56,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:30:56,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:30:56,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:30:56,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:30:56,732 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:56,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:30:56,806 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-11-14 04:30:56,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:30:56,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-14 04:30:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:30:56,807 INFO L225 Difference]: With dead ends: 70 [2024-11-14 04:30:56,807 INFO L226 Difference]: Without dead ends: 70 [2024-11-14 04:30:56,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:30:56,809 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:30:56,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 04:30:56,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-14 04:30:56,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-14 04:30:56,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 69 states have internal predecessors, (78), 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) [2024-11-14 04:30:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2024-11-14 04:30:56,815 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 10 [2024-11-14 04:30:56,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:30:56,815 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2024-11-14 04:30:56,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:30:56,816 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2024-11-14 04:30:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 04:30:56,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:30:56,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:30:56,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:30:56,817 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:30:56,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:30:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1192146478, now seen corresponding path program 1 times [2024-11-14 04:30:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:30:56,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883746228] [2024-11-14 04:30:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:56,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:30:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:57,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:30:57,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883746228] [2024-11-14 04:30:57,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883746228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:30:57,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522949295] [2024-11-14 04:30:57,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:30:57,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:30:57,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:30:57,028 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:30:57,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:30:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:30:57,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 04:30:57,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:30:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:57,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:30:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:30:57,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522949295] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:30:57,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1568299656] [2024-11-14 04:30:57,267 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 04:30:57,267 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:30:57,270 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:30:57,273 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:30:57,274 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:30:59,696 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:31:52,541 WARN L286 SmtUtils]: Spent 5.88s on a formula simplification. DAG size of input: 238 DAG size of output: 233 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:32:13,489 WARN L286 SmtUtils]: Spent 7.12s on a formula simplification. DAG size of input: 246 DAG size of output: 241 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:32:17,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1568299656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:32:17,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:32:17,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [3, 3, 3] total 13 [2024-11-14 04:32:17,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447266457] [2024-11-14 04:32:17,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:32:17,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 04:32:17,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:32:17,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 04:32:17,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=103, Unknown=23, NotChecked=0, Total=182 [2024-11-14 04:32:17,196 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:32:19,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:21,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:23,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:26,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:28,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:30,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:32,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:34,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:37,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:39,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:41,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:44,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:46,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:48,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:51,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:53,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:55,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:32:58,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:00,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:02,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:04,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:07,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:09,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:12,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:14,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:16,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:19,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:21,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:23,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:27,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:30,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:32,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:33,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:39,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:33:43,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:33:43,006 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2024-11-14 04:33:43,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 04:33:43,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-14 04:33:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:33:43,007 INFO L225 Difference]: With dead ends: 80 [2024-11-14 04:33:43,007 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 04:33:43,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 77.5s TimeCoverageRelationStatistics Valid=56, Invalid=103, Unknown=23, NotChecked=0, Total=182 [2024-11-14 04:33:43,008 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 1 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 0 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 85.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:33:43,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 223 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 406 Invalid, 35 Unknown, 0 Unchecked, 85.8s Time] [2024-11-14 04:33:43,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 04:33:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-11-14 04:33:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 78 states have internal predecessors, (88), 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) [2024-11-14 04:33:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2024-11-14 04:33:43,019 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 12 [2024-11-14 04:33:43,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:33:43,019 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2024-11-14 04:33:43,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.2) internal successors, (12), 9 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:33:43,020 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2024-11-14 04:33:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 04:33:43,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:33:43,021 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-14 04:33:43,041 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:33:43,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:33:43,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:33:43,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:33:43,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1022885397, now seen corresponding path program 1 times [2024-11-14 04:33:43,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:33:43,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451021699] [2024-11-14 04:33:43,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:33:43,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:33:43,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:33:43,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:33:43,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:33:43,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451021699] [2024-11-14 04:33:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451021699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:33:43,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575758511] [2024-11-14 04:33:43,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:33:43,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:33:43,731 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:33:43,733 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:33:43,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:33:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:33:43,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 04:33:43,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:33:43,887 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 [2024-11-14 04:33:44,027 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-14 04:33:44,027 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 [2024-11-14 04:33:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:33:44,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:33:44,320 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:33:44,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575758511] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:33:44,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1199008074] [2024-11-14 04:33:44,323 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 04:33:44,323 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:33:44,324 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:33:44,324 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:33:44,324 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:33:45,643 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:34:57,305 WARN L286 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 246 DAG size of output: 241 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:35:42,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1199008074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:35:42,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:35:42,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4, 3, 3] total 14 [2024-11-14 04:35:42,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060899671] [2024-11-14 04:35:42,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:35:42,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 04:35:42,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:35:42,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 04:35:42,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=132, Unknown=38, NotChecked=0, Total=210 [2024-11-14 04:35:42,784 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2024-11-14 04:35:44,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:47,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:49,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:51,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:54,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:56,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:35:58,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:00,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:03,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:05,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:08,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:10,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:12,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:14,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:16,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:19,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:21,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:23,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:25,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:28,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:30,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:32,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:35,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:38,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:40,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:42,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:44,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:47,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:49,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:51,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:54,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:36:57,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:00,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:02,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:04,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:37:06,582 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse33 (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse53 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1))) (let ((.cse0 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse11 (= |c_ULTIMATE.start_dll_create_~len#1| 4)) (.cse12 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse13 (= |c_#valid| (store .cse53 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1))) (.cse14 (= (select .cse53 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)) (.cse15 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse16 (<= (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse17 (exists ((|v_#length_59| (Array Int Int))) (and (= 2 (select |v_#length_59| 1)) (= (store (store |v_#length_59| |c_ULTIMATE.start_dll_create_~head~0#1.base| 20) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 20) |c_#length|) (= (select |v_#length_59| 2) 18)))) (.cse26 (not .cse33)) (.cse27 (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|)) (.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12)) (.cse28 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse29 (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))) (and .cse0 (exists ((|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_63| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_63| (Array Int (Array Int Int))) (|v_#memory_int_77| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int)))) (let ((.cse3 (select |v_#memory_$Pointer$.offset_63| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse34 (select |v_#memory_$Pointer$.base_63| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse35 (select |v_#memory_$Pointer$.base_64| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (select |v_#memory_int_79| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (select |v_#memory_$Pointer$.offset_64| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= (store |v_#memory_int_79| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse1 12 .cse2)) |c_#memory_int|) (= |v_#memory_$Pointer$.offset_64| (store |v_#memory_$Pointer$.offset_63| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 16 (select .cse4 16)))) (let ((.cse25 (select .cse3 8)) (.cse10 (select .cse34 8))) (or (and (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_57| (Array Int (Array Int Int)))) (let ((.cse6 (select |v_#memory_$Pointer$.base_54| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse9 (select |v_#memory_$Pointer$.base_57| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse7 (select |v_#memory_$Pointer$.base_52| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (select |v_#memory_$Pointer$.base_53| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_53| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 16 (select .cse6 16))) |v_#memory_$Pointer$.base_54|) (= |v_#memory_$Pointer$.base_52| (store |v_#memory_$Pointer$.base_51| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.base_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse7 0)))) (= (let ((.cse8 (store |v_#memory_$Pointer$.base_54| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse6 4 0) 12 0)))) (store .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse9 0)))) |v_#memory_$Pointer$.base_57|) (= (store |v_#memory_$Pointer$.base_57| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse9 8 .cse10)) |v_#memory_$Pointer$.base_63|) (= |v_#memory_$Pointer$.base_53| (store |v_#memory_$Pointer$.base_52| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse7 8 (select .cse5 8))))))) .cse0 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (exists ((|v_#memory_int_65| (Array Int (Array Int Int))) (|v_#memory_int_69| (Array Int (Array Int Int))) (|v_#memory_int_70| (Array Int (Array Int Int)))) (let ((.cse18 (select |v_#memory_int_65| 1)) (.cse19 (select |v_#memory_int_69| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (store |v_#memory_int_70| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_70| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 0) 8 0)) |v_#memory_int_77|) (= 48 (select .cse18 0)) (= (store |v_#memory_int_69| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse19 12 (select (select |v_#memory_int_70| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12))) |v_#memory_int_70|) (= (select .cse18 1) 0) (= |v_#memory_int_69| (store |v_#memory_int_65| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store (store (store (select |v_#memory_int_65| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 0) 8 0) 16 0) 4 (select .cse19 4))))))) (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int)))) (let ((.cse21 (select |v_#memory_$Pointer$.offset_54| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse20 (select |v_#memory_$Pointer$.offset_53| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse23 (select |v_#memory_$Pointer$.offset_57| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse24 (select |v_#memory_$Pointer$.offset_52| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_53| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse20 16 (select .cse21 16))) |v_#memory_$Pointer$.offset_54|) (= (let ((.cse22 (store |v_#memory_$Pointer$.offset_54| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse21 4 0) 12 0)))) (store .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse23 0)))) |v_#memory_$Pointer$.offset_57|) (= (store |v_#memory_$Pointer$.offset_52| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse24 8 (select .cse20 8))) |v_#memory_$Pointer$.offset_53|) (= (store |v_#memory_$Pointer$.offset_57| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse23 8 .cse25)) |v_#memory_$Pointer$.offset_63|) (= (store |v_#memory_$Pointer$.offset_51| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.offset_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse24 0))) |v_#memory_$Pointer$.offset_52|)))) .cse26 .cse27 .cse28 .cse29) (and .cse12 .cse15 (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int)))) (let ((.cse30 (select |v_#memory_$Pointer$.offset_52| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |v_#memory_$Pointer$.offset_52| (store |v_#memory_$Pointer$.offset_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse30 0)))) (= (store |v_#memory_$Pointer$.offset_52| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse30 8 .cse25)) |v_#memory_$Pointer$.offset_63|)))) .cse16 (exists ((|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_$Pointer$.base_52| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |v_#memory_$Pointer$.base_63| (store |v_#memory_$Pointer$.base_52| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse31 8 .cse10))) (= (store |v_#memory_$Pointer$.base_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_51| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse31 0))) |v_#memory_$Pointer$.base_52|)))) (exists ((|v_#memory_int_65| (Array Int (Array Int Int)))) (let ((.cse32 (select |v_#memory_int_65| 1))) (and (= 48 (select .cse32 0)) (= (select .cse32 1) 0) (= (store |v_#memory_int_65| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_65| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 0) 8 0)) |v_#memory_int_77|)))) (= 5 |c_ULTIMATE.start_dll_create_~len#1|) .cse33 (exists ((|v_#length_59| (Array Int Int))) (and (= (store |v_#length_59| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 20) |c_#length|) (= 2 (select |v_#length_59| 1)) (= (select |v_#length_59| 2) 18))) .cse28 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) .cse29 (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1))))) (= |v_#memory_$Pointer$.base_64| (store |v_#memory_$Pointer$.base_63| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse34 16 (select .cse35 16)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_64| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse35 4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12 0))) (= (store |v_#memory_int_77| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_77| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 16 0) 4 (select .cse1 4))) |v_#memory_int_79|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_64| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse4 4 0) 12 0)))))) .cse11 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) .cse12 .cse13 (<= 1 |c_#StackHeapBarrier|) .cse14 .cse15 .cse16 .cse17 (exists ((|v_#memory_$Pointer$.base_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_64| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_63| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_57| (Array Int (Array Int Int)))) (let ((.cse40 (select |v_#memory_$Pointer$.base_64| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse37 (select |v_#memory_$Pointer$.base_54| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse42 (select |v_#memory_$Pointer$.base_57| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse39 (select |v_#memory_$Pointer$.base_63| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse38 (select |v_#memory_$Pointer$.base_52| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse36 (select |v_#memory_$Pointer$.base_53| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_53| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse36 16 (select .cse37 16))) |v_#memory_$Pointer$.base_54|) (= |v_#memory_$Pointer$.base_52| (store |v_#memory_$Pointer$.base_51| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.base_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse38 0)))) (= |v_#memory_$Pointer$.base_64| (store |v_#memory_$Pointer$.base_63| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse39 16 (select .cse40 16)))) (= |c_#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_64| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse40 4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12 0))) (= (let ((.cse41 (store |v_#memory_$Pointer$.base_54| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse37 4 0) 12 0)))) (store .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse42 0)))) |v_#memory_$Pointer$.base_57|) (= (store |v_#memory_$Pointer$.base_57| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse42 8 (select .cse39 8))) |v_#memory_$Pointer$.base_63|) (= |v_#memory_$Pointer$.base_53| (store |v_#memory_$Pointer$.base_52| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse38 8 (select .cse36 8))))))) .cse26 .cse27 (exists ((|v_#memory_int_65| (Array Int (Array Int Int))) (|v_#memory_int_79| (Array Int (Array Int Int))) (|v_#memory_int_69| (Array Int (Array Int Int))) (|v_#memory_int_70| (Array Int (Array Int Int)))) (let ((.cse43 (select |v_#memory_int_79| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse44 (select |v_#memory_int_65| 1)) (.cse45 (select |v_#memory_int_69| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= |v_#memory_int_79| (store |v_#memory_int_70| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (store (select |v_#memory_int_70| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 0) 8 0) 16 0) 4 (select .cse43 4)))) (= (store |v_#memory_int_79| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse43 12 .cse2)) |c_#memory_int|) (= 48 (select .cse44 0)) (= (store |v_#memory_int_69| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse45 12 (select (select |v_#memory_int_70| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12))) |v_#memory_int_70|) (= (select .cse44 1) 0) (= |v_#memory_int_69| (store |v_#memory_int_65| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store (store (store (select |v_#memory_int_65| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 0) 8 0) 16 0) 4 (select .cse45 4))))))) .cse28 (exists ((|v_#memory_$Pointer$.offset_51| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_64| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_53| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_63| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_52| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_54| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_57| (Array Int (Array Int Int)))) (let ((.cse47 (select |v_#memory_$Pointer$.offset_54| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse46 (select |v_#memory_$Pointer$.offset_53| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse51 (select |v_#memory_$Pointer$.offset_57| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse48 (select |v_#memory_$Pointer$.offset_63| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse52 (select |v_#memory_$Pointer$.offset_52| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse49 (select |v_#memory_$Pointer$.offset_64| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_53| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse46 16 (select .cse47 16))) |v_#memory_$Pointer$.offset_54|) (= |v_#memory_$Pointer$.offset_64| (store |v_#memory_$Pointer$.offset_63| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse48 16 (select .cse49 16)))) (= (let ((.cse50 (store |v_#memory_$Pointer$.offset_54| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse47 4 0) 12 0)))) (store .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse50 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse51 0)))) |v_#memory_$Pointer$.offset_57|) (= (store |v_#memory_$Pointer$.offset_52| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse52 8 (select .cse46 8))) |v_#memory_$Pointer$.offset_53|) (= (store |v_#memory_$Pointer$.offset_57| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse51 8 (select .cse48 8))) |v_#memory_$Pointer$.offset_63|) (= (store |v_#memory_$Pointer$.offset_51| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.offset_51| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse52 0))) |v_#memory_$Pointer$.offset_52|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_64| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse49 4 0) 12 0)))))) .cse29))) is different from false [2024-11-14 04:37:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:37:09,738 INFO L93 Difference]: Finished difference Result 80 states and 90 transitions. [2024-11-14 04:37:09,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 04:37:09,738 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 04:37:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:37:09,739 INFO L225 Difference]: With dead ends: 80 [2024-11-14 04:37:09,739 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 04:37:09,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 119.8s TimeCoverageRelationStatistics Valid=42, Invalid=133, Unknown=39, NotChecked=26, Total=240 [2024-11-14 04:37:09,740 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 0 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 82.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 84.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:37:09,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 451 Invalid, 36 Unknown, 22 Unchecked, 84.4s Time] [2024-11-14 04:37:09,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 04:37:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-14 04:37:09,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 79 states have internal predecessors, (90), 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) [2024-11-14 04:37:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2024-11-14 04:37:09,747 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 19 [2024-11-14 04:37:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:37:09,747 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2024-11-14 04:37:09,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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) [2024-11-14 04:37:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2024-11-14 04:37:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 04:37:09,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:37:09,748 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-14 04:37:09,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 04:37:09,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 04:37:09,952 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:37:09,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:37:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1022885396, now seen corresponding path program 1 times [2024-11-14 04:37:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:37:09,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609441618] [2024-11-14 04:37:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:37:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:37:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:37:10,614 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:37:10,615 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:37:10,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609441618] [2024-11-14 04:37:10,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609441618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:37:10,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603298690] [2024-11-14 04:37:10,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:37:10,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:37:10,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:37:10,617 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:37:10,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 04:37:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:37:10,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 04:37:10,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:37:10,780 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 8 treesize of output 1 [2024-11-14 04:37:11,030 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:37:11,031 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 13 [2024-11-14 04:37:11,268 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:37:11,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:37:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:37:12,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603298690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:37:12,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1493681767] [2024-11-14 04:37:12,128 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 04:37:12,128 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:37:12,129 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:37:12,129 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:37:12,129 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:37:13,286 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:38:26,378 WARN L286 SmtUtils]: Spent 6.71s on a formula simplification. DAG size of input: 246 DAG size of output: 241 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:38:48,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1493681767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:38:48,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:38:48,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 3, 4] total 17 [2024-11-14 04:38:48,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097742486] [2024-11-14 04:38:48,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:38:48,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 04:38:48,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:38:48,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 04:38:48,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=209, Unknown=27, NotChecked=0, Total=306 [2024-11-14 04:38:48,956 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:38:51,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:53,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:57,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:38:59,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:01,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:03,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:06,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:08,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:10,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:13,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:15,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:17,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:19,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:21,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:23,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:26,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:29,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:32,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:33,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:35,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:37,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:40,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:42,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:45,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:47,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:49,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:52,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 04:39:54,207 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse53 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~head~0#1.base| 1))) (let ((.cse0 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0)) (.cse1 (= |c_ULTIMATE.start_dll_create_~len#1| 4)) (.cse2 (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0)) (.cse3 (= |c_#valid| (store .cse53 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1))) (.cse4 (= (select .cse53 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0)) (.cse5 (= (select |c_ULTIMATE.start_main_old_#valid#1| 2) 1)) (.cse6 (<= (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|)) (.cse7 (exists ((|v_#length_67| (Array Int Int))) (and (= 2 (select |v_#length_67| 1)) (= (select |v_#length_67| 2) 18) (= (store (store |v_#length_67| |c_ULTIMATE.start_dll_create_~head~0#1.base| 20) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 20) |c_#length|)))) (.cse21 (not .cse11)) (.cse27 (<= (+ 1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) |c_#StackHeapBarrier|)) (.cse12 (= (select |c_ULTIMATE.start_main_old_#valid#1| 1) 1)) (.cse13 (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) (.cse34 (select (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12))) (and .cse0 .cse1 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) .cse2 .cse3 (<= 1 |c_#StackHeapBarrier|) .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_int_103| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_89| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_90| (Array Int (Array Int Int)))) (let ((.cse32 (select |v_#memory_int_105| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse30 (select |v_#memory_$Pointer$.offset_89| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse31 (select |v_#memory_$Pointer$.base_89| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse33 (select |v_#memory_$Pointer$.base_90| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse35 (select |v_#memory_$Pointer$.offset_90| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (let ((.cse15 (select .cse31 8)) (.cse9 (select .cse30 8))) (or (and .cse2 (exists ((|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int)))) (let ((.cse8 (select |v_#memory_$Pointer$.offset_78| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.offset_77| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_77| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse8 0))) |v_#memory_$Pointer$.offset_78|) (= (store |v_#memory_$Pointer$.offset_78| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse8 8 .cse9)) |v_#memory_$Pointer$.offset_89|)))) .cse5 .cse6 (exists ((|v_#memory_int_91| (Array Int (Array Int Int)))) (let ((.cse10 (select |v_#memory_int_91| 1))) (and (= (select .cse10 1) 0) (= (store |v_#memory_int_91| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_91| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 0) 8 0)) |v_#memory_int_103|) (= (select .cse10 0) 48)))) (= 5 |c_ULTIMATE.start_dll_create_~len#1|) .cse11 .cse12 (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (exists ((|v_#length_67| (Array Int Int))) (and (= (store |v_#length_67| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 20) |c_#length|) (= 2 (select |v_#length_67| 1)) (= (select |v_#length_67| 2) 18))) .cse13 (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 1)) (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_78| (Array Int (Array Int Int)))) (let ((.cse14 (select |v_#memory_$Pointer$.base_78| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_78| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse14 8 .cse15)) |v_#memory_$Pointer$.base_89|) (= (store |v_#memory_$Pointer$.base_77| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_77| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse14 0))) |v_#memory_$Pointer$.base_78|))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_78| (Array Int (Array Int Int)))) (let ((.cse17 (select |v_#memory_$Pointer$.base_79| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse19 (select |v_#memory_$Pointer$.base_83| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse18 (select |v_#memory_$Pointer$.base_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse16 (select |v_#memory_$Pointer$.base_78| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_78| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse16 8 (select .cse17 8))) |v_#memory_$Pointer$.base_79|) (= (store |v_#memory_$Pointer$.base_79| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse17 16 (select .cse18 16))) |v_#memory_$Pointer$.base_80|) (= (store |v_#memory_$Pointer$.base_83| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse19 8 .cse15)) |v_#memory_$Pointer$.base_89|) (= |v_#memory_$Pointer$.base_83| (let ((.cse20 (store |v_#memory_$Pointer$.base_80| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse18 4 0) 12 0)))) (store .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse19 0))))) (= (store |v_#memory_$Pointer$.base_77| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.base_77| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse16 0))) |v_#memory_$Pointer$.base_78|)))) .cse21 (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int)))) (let ((.cse25 (select |v_#memory_$Pointer$.offset_78| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse26 (select |v_#memory_$Pointer$.offset_79| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse24 (select |v_#memory_$Pointer$.offset_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse23 (select |v_#memory_$Pointer$.offset_83| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |v_#memory_$Pointer$.offset_83| (let ((.cse22 (store |v_#memory_$Pointer$.offset_80| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse24 4 0) 12 0)))) (store .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse23 0))))) (= (store |v_#memory_$Pointer$.offset_78| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse25 8 (select .cse26 8))) |v_#memory_$Pointer$.offset_79|) (= (store |v_#memory_$Pointer$.offset_77| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.offset_77| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse25 0))) |v_#memory_$Pointer$.offset_78|) (= (store |v_#memory_$Pointer$.offset_79| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse26 16 (select .cse24 16))) |v_#memory_$Pointer$.offset_80|) (= (store |v_#memory_$Pointer$.offset_83| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse23 8 .cse9)) |v_#memory_$Pointer$.offset_89|)))) .cse27 (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_#memory_int_96| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int)))) (let ((.cse28 (select |v_#memory_int_95| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse29 (select |v_#memory_int_91| 1))) (and (= (store |v_#memory_int_91| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store (store (store (select |v_#memory_int_91| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 0) 8 0) 16 0) 4 (select .cse28 4))) |v_#memory_int_95|) (= (select .cse29 1) 0) (= |v_#memory_int_96| (store |v_#memory_int_95| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse28 12 (select (select |v_#memory_int_96| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12)))) (= (select .cse29 0) 48) (= (store |v_#memory_int_96| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_96| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 0) 8 0)) |v_#memory_int_103|)))) .cse12 .cse13))) (= |v_#memory_int_105| (store |v_#memory_int_103| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_103| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 16 0) 4 (select .cse32 4)))) (= (store |v_#memory_$Pointer$.base_90| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse33 4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12 0)) |c_#memory_$Pointer$.base|) (= |c_#memory_int| (store |v_#memory_int_105| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse32 12 .cse34))) (= (store |v_#memory_$Pointer$.offset_89| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse30 16 (select .cse35 16))) |v_#memory_$Pointer$.offset_90|) (= |v_#memory_$Pointer$.base_90| (store |v_#memory_$Pointer$.base_89| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse31 16 (select .cse33 16)))) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_90| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse35 4 0) 12 0)))))) .cse21 .cse27 .cse12 (exists ((|v_#memory_$Pointer$.offset_83| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_79| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_89| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_80| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_90| (Array Int (Array Int Int)))) (let ((.cse39 (select |v_#memory_$Pointer$.offset_78| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse40 (select |v_#memory_$Pointer$.offset_79| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse38 (select |v_#memory_$Pointer$.offset_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse37 (select |v_#memory_$Pointer$.offset_83| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse41 (select |v_#memory_$Pointer$.offset_89| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse42 (select |v_#memory_$Pointer$.offset_90| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |v_#memory_$Pointer$.offset_83| (let ((.cse36 (store |v_#memory_$Pointer$.offset_80| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse38 4 0) 12 0)))) (store .cse36 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse36 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse37 0))))) (= (store |v_#memory_$Pointer$.offset_78| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse39 8 (select .cse40 8))) |v_#memory_$Pointer$.offset_79|) (= (store |v_#memory_$Pointer$.offset_77| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.offset_77| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse39 0))) |v_#memory_$Pointer$.offset_78|) (= (store |v_#memory_$Pointer$.offset_79| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse40 16 (select .cse38 16))) |v_#memory_$Pointer$.offset_80|) (= (store |v_#memory_$Pointer$.offset_83| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse37 8 (select .cse41 8))) |v_#memory_$Pointer$.offset_89|) (= (store |v_#memory_$Pointer$.offset_89| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse41 16 (select .cse42 16))) |v_#memory_$Pointer$.offset_90|) (= |c_#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_90| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse42 4 0) 12 0)))))) (exists ((|v_#memory_$Pointer$.base_77| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_83| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_80| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_90| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_79| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_78| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_89| (Array Int (Array Int Int)))) (let ((.cse44 (select |v_#memory_$Pointer$.base_79| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse47 (select |v_#memory_$Pointer$.base_83| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse45 (select |v_#memory_$Pointer$.base_80| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse48 (select |v_#memory_$Pointer$.base_89| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse46 (select |v_#memory_$Pointer$.base_90| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse43 (select |v_#memory_$Pointer$.base_78| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (= (store |v_#memory_$Pointer$.base_78| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse43 8 (select .cse44 8))) |v_#memory_$Pointer$.base_79|) (= (store |v_#memory_$Pointer$.base_79| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse44 16 (select .cse45 16))) |v_#memory_$Pointer$.base_80|) (= (store |v_#memory_$Pointer$.base_90| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store .cse46 4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12 0)) |c_#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_83| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse47 8 (select .cse48 8))) |v_#memory_$Pointer$.base_89|) (= |v_#memory_$Pointer$.base_83| (let ((.cse49 (store |v_#memory_$Pointer$.base_80| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store .cse45 4 0) 12 0)))) (store .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 (select .cse47 0))))) (= |v_#memory_$Pointer$.base_90| (store |v_#memory_$Pointer$.base_89| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse48 16 (select .cse46 16)))) (= (store |v_#memory_$Pointer$.base_77| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |v_#memory_$Pointer$.base_77| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 (select .cse43 0))) |v_#memory_$Pointer$.base_78|)))) .cse13 (exists ((|v_#memory_int_95| (Array Int (Array Int Int))) (|v_#memory_int_96| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_int_91| (Array Int (Array Int Int)))) (let ((.cse50 (select |v_#memory_int_95| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse51 (select |v_#memory_int_91| 1)) (.cse52 (select |v_#memory_int_105| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= (store |v_#memory_int_91| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (store (store (store (select |v_#memory_int_91| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0 0) 8 0) 16 0) 4 (select .cse50 4))) |v_#memory_int_95|) (= (select .cse51 1) 0) (= (store |v_#memory_int_96| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (store (store (select |v_#memory_int_96| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0 0) 8 0) 16 0) 4 (select .cse52 4))) |v_#memory_int_105|) (= |v_#memory_int_96| (store |v_#memory_int_95| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse50 12 (select (select |v_#memory_int_96| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 12)))) (= (select .cse51 0) 48) (= |c_#memory_int| (store |v_#memory_int_105| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse52 12 .cse34))))))))) is different from false [2024-11-14 04:39:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:39:57,094 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2024-11-14 04:39:57,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 04:39:57,095 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 04:39:57,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:39:57,096 INFO L225 Difference]: With dead ends: 80 [2024-11-14 04:39:57,096 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 04:39:57,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 98.2s TimeCoverageRelationStatistics Valid=72, Invalid=210, Unknown=28, NotChecked=32, Total=342 [2024-11-14 04:39:57,097 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 0 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 63.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 66.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:39:57,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 248 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 451 Invalid, 27 Unknown, 10 Unchecked, 66.1s Time] [2024-11-14 04:39:57,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 04:39:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-14 04:39:57,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.6181818181818182) internal successors, (89), 79 states have internal predecessors, (89), 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) [2024-11-14 04:39:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2024-11-14 04:39:57,103 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 19 [2024-11-14 04:39:57,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:39:57,104 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2024-11-14 04:39:57,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:39:57,104 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2024-11-14 04:39:57,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 04:39:57,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:39:57,105 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 04:39:57,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 04:39:57,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-14 04:39:57,306 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:39:57,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:39:57,306 INFO L85 PathProgramCache]: Analyzing trace with hash 14119173, now seen corresponding path program 1 times [2024-11-14 04:39:57,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:39:57,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621025798] [2024-11-14 04:39:57,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:39:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:39:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:39:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:39:57,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:39:57,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621025798] [2024-11-14 04:39:57,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621025798] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:39:57,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:39:57,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:39:57,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187130169] [2024-11-14 04:39:57,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:39:57,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:39:57,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:39:57,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:39:57,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:39:57,551 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-11-14 04:39:58,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:39:58,265 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2024-11-14 04:39:58,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:39:58,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2024-11-14 04:39:58,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:39:58,267 INFO L225 Difference]: With dead ends: 74 [2024-11-14 04:39:58,267 INFO L226 Difference]: Without dead ends: 74 [2024-11-14 04:39:58,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:39:58,268 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 41 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:39:58,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 69 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 04:39:58,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-14 04:39:58,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-14 04:39:58,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 73 states have internal predecessors, (86), 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) [2024-11-14 04:39:58,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-11-14 04:39:58,273 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 22 [2024-11-14 04:39:58,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:39:58,274 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-14 04:39:58,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2024-11-14 04:39:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2024-11-14 04:39:58,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 04:39:58,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:39:58,275 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 04:39:58,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 04:39:58,275 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:39:58,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:39:58,275 INFO L85 PathProgramCache]: Analyzing trace with hash 14119174, now seen corresponding path program 1 times [2024-11-14 04:39:58,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:39:58,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651695076] [2024-11-14 04:39:58,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:39:58,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:39:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:39:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:39:58,485 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:39:58,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651695076] [2024-11-14 04:39:58,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651695076] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:39:58,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272964225] [2024-11-14 04:39:58,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:39:58,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:39:58,486 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:39:58,488 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:39:58,490 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 04:39:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:39:58,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 04:39:58,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:39:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:39:58,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:39:59,018 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:39:59,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272964225] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:39:59,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [15860409] [2024-11-14 04:39:59,020 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2024-11-14 04:39:59,021 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:39:59,021 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:39:59,021 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:39:59,021 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:40:04,867 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:40:33,345 WARN L286 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 199 DAG size of output: 187 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:40:50,149 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1630#true' at error location [2024-11-14 04:40:50,150 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:40:50,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:40:50,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-14 04:40:50,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473003203] [2024-11-14 04:40:50,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:40:50,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 04:40:50,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:40:50,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 04:40:50,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=206, Unknown=14, NotChecked=0, Total=272 [2024-11-14 04:40:50,152 INFO L87 Difference]: Start difference. First operand 74 states and 86 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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) [2024-11-14 04:40:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:40:50,312 INFO L93 Difference]: Finished difference Result 130 states and 147 transitions. [2024-11-14 04:40:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 04:40:50,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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 22 [2024-11-14 04:40:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:40:50,314 INFO L225 Difference]: With dead ends: 130 [2024-11-14 04:40:50,314 INFO L226 Difference]: Without dead ends: 130 [2024-11-14 04:40:50,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=52, Invalid=206, Unknown=14, NotChecked=0, Total=272 [2024-11-14 04:40:50,315 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 20 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:40:50,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 126 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:40:50,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-14 04:40:50,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2024-11-14 04:40:50,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 110 states have (on average 1.3181818181818181) internal successors, (145), 125 states have internal predecessors, (145), 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) [2024-11-14 04:40:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 145 transitions. [2024-11-14 04:40:50,322 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 145 transitions. Word has length 22 [2024-11-14 04:40:50,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:40:50,322 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 145 transitions. [2024-11-14 04:40:50,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 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) [2024-11-14 04:40:50,323 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2024-11-14 04:40:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 04:40:50,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:40:50,323 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2024-11-14 04:40:50,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 04:40:50,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:40:50,524 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:40:50,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:40:50,525 INFO L85 PathProgramCache]: Analyzing trace with hash -789137611, now seen corresponding path program 1 times [2024-11-14 04:40:50,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:40:50,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354457340] [2024-11-14 04:40:50,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:40:50,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:40:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:40:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:40:50,976 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:40:50,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354457340] [2024-11-14 04:40:50,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354457340] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:40:50,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118246811] [2024-11-14 04:40:50,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:40:50,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:40:50,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:40:50,980 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:40:50,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 04:40:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:40:51,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-14 04:40:51,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:40:51,174 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 [2024-11-14 04:40:51,199 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 8 treesize of output 1 [2024-11-14 04:40:51,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 04:40:51,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-14 04:40:51,703 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 04:40:51,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 04:40:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:40:51,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:40:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:40:52,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118246811] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:40:52,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [65074642] [2024-11-14 04:40:52,873 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2024-11-14 04:40:52,874 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:40:52,874 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:40:52,874 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:40:52,874 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:40:58,020 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:41:25,025 WARN L286 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 200 DAG size of output: 189 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:42:03,186 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2207#(and (= (select |#valid| |ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (<= 0 (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (exists ((|v_#memory_int_161| (Array Int (Array Int Int))) (|v_#memory_int_163| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_163| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_int_163| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) (select (select |#memory_int| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12))))) (= (store |v_#memory_int_161| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_int_161| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) (select (select |v_#memory_int_163| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)))) |v_#memory_int_163|))) (exists ((|v_#memory_$Pointer$.offset_148| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.base_50| Int) (|v_#memory_$Pointer$.base_148| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_48| Int) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (and (or (< (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_48| 12) 0) (< (select |#length| |v_ULTIMATE.start_dll_create_~head~0#1.base_50|) (+ 16 |v_ULTIMATE.start_dll_create_~head~0#1.offset_48|))) (or (not (= 0 |v_ULTIMATE.start_dll_create_~head~0#1.base_50|)) (not (= |v_ULTIMATE.start_dll_create_~head~0#1.offset_48| 0))) (= (store |v_#memory_$Pointer$.base_148| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_$Pointer$.base_148| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) |v_ULTIMATE.start_dll_create_~head~0#1.base_50|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) 0)) |#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.base_148| (store |v_#memory_$Pointer$.base_147| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.base_147| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (select (select |v_#memory_$Pointer$.base_148| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_148| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_148| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) |v_ULTIMATE.start_dll_create_~head~0#1.offset_48|) (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 12) 0))) (= (store |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |v_#memory_$Pointer$.offset_147| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |ULTIMATE.start_dll_create_~new_head~0#1.offset|) (select (select |v_#memory_$Pointer$.offset_148| |ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 16 |ULTIMATE.start_dll_create_~new_head~0#1.offset|)))) |v_#memory_$Pointer$.offset_148|))) (<= (+ |ULTIMATE.start_dll_create_~new_head~0#1.offset| 20) (select |#length| |ULTIMATE.start_dll_create_~new_head~0#1.base|)))' at error location [2024-11-14 04:42:03,186 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:42:03,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:42:03,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2024-11-14 04:42:03,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480030768] [2024-11-14 04:42:03,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:42:03,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 04:42:03,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:42:03,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 04:42:03,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=292, Unknown=19, NotChecked=0, Total=380 [2024-11-14 04:42:03,188 INFO L87 Difference]: Start difference. First operand 126 states and 145 transitions. Second operand has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 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) [2024-11-14 04:42:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:42:04,527 INFO L93 Difference]: Finished difference Result 125 states and 142 transitions. [2024-11-14 04:42:04,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:42:04,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 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 29 [2024-11-14 04:42:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:42:04,528 INFO L225 Difference]: With dead ends: 125 [2024-11-14 04:42:04,529 INFO L226 Difference]: Without dead ends: 125 [2024-11-14 04:42:04,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 66.1s TimeCoverageRelationStatistics Valid=98, Invalid=383, Unknown=25, NotChecked=0, Total=506 [2024-11-14 04:42:04,530 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 04:42:04,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 172 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 04:42:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-14 04:42:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2024-11-14 04:42:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 121 states have internal predecessors, (139), 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) [2024-11-14 04:42:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2024-11-14 04:42:04,536 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 29 [2024-11-14 04:42:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:42:04,536 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2024-11-14 04:42:04,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 10 states have internal predecessors, (67), 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) [2024-11-14 04:42:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2024-11-14 04:42:04,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 04:42:04,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:42:04,538 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2024-11-14 04:42:04,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 04:42:04,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 04:42:04,742 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:42:04,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:42:04,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1545111078, now seen corresponding path program 2 times [2024-11-14 04:42:04,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:42:04,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687093070] [2024-11-14 04:42:04,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:42:04,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:42:04,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:42:04,964 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 04:42:04,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:42:04,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687093070] [2024-11-14 04:42:04,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687093070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:42:04,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903986950] [2024-11-14 04:42:04,964 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:42:04,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:42:04,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:42:04,967 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:42:04,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 04:42:05,152 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 04:42:05,152 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 04:42:05,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-14 04:42:05,156 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:42:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-14 04:42:05,573 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:42:05,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903986950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:42:05,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:42:05,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 8 [2024-11-14 04:42:05,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114602401] [2024-11-14 04:42:05,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:42:05,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 04:42:05,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:42:05,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 04:42:05,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:42:05,575 INFO L87 Difference]: Start difference. First operand 122 states and 139 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:42:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:42:06,284 INFO L93 Difference]: Finished difference Result 145 states and 169 transitions. [2024-11-14 04:42:06,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:42:06,285 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-14 04:42:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:42:06,286 INFO L225 Difference]: With dead ends: 145 [2024-11-14 04:42:06,286 INFO L226 Difference]: Without dead ends: 145 [2024-11-14 04:42:06,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-14 04:42:06,287 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 36 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:42:06,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 118 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 04:42:06,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-14 04:42:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2024-11-14 04:42:06,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 138 states have internal predecessors, (162), 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) [2024-11-14 04:42:06,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 162 transitions. [2024-11-14 04:42:06,293 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 162 transitions. Word has length 49 [2024-11-14 04:42:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:42:06,294 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 162 transitions. [2024-11-14 04:42:06,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:42:06,294 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 162 transitions. [2024-11-14 04:42:06,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-14 04:42:06,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:42:06,295 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:42:06,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 04:42:06,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-14 04:42:06,500 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:42:06,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:42:06,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1239612593, now seen corresponding path program 1 times [2024-11-14 04:42:06,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:42:06,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560112778] [2024-11-14 04:42:06,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:42:06,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:42:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:42:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 04:42:06,794 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:42:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560112778] [2024-11-14 04:42:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560112778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:42:06,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724288988] [2024-11-14 04:42:06,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:42:06,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:42:06,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:42:06,797 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:42:06,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 04:42:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:42:07,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:42:07,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:42:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 04:42:07,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:42:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 74 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 04:42:07,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724288988] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:42:07,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [233482165] [2024-11-14 04:42:07,437 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-14 04:42:07,438 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:42:07,438 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:42:07,438 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:42:07,438 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:42:09,847 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:42:30,711 WARN L286 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 186 DAG size of output: 178 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:42:39,366 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3218#(and (= (select |#valid| 0) 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_old_#valid#1_10| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_10| |#valid|))) (= (select (select |#memory_$Pointer$.base| 0) 4) 0) (<= 8 (select |#length| 0)) (= (select (select |#memory_$Pointer$.offset| 0) 4) 0) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-14 04:42:39,366 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:42:39,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:42:39,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-11-14 04:42:39,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171714995] [2024-11-14 04:42:39,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:42:39,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:42:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:42:39,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:42:39,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=240, Unknown=9, NotChecked=0, Total=306 [2024-11-14 04:42:39,369 INFO L87 Difference]: Start difference. First operand 139 states and 162 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2024-11-14 04:42:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:42:39,855 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2024-11-14 04:42:39,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 04:42:39,856 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 52 [2024-11-14 04:42:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:42:39,859 INFO L225 Difference]: With dead ends: 112 [2024-11-14 04:42:39,860 INFO L226 Difference]: Without dead ends: 112 [2024-11-14 04:42:39,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 138 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 29.7s TimeCoverageRelationStatistics Valid=61, Invalid=272, Unknown=9, NotChecked=0, Total=342 [2024-11-14 04:42:39,861 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:42:39,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 118 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 04:42:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-14 04:42:39,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-14 04:42:39,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 97 states have (on average 1.3195876288659794) internal successors, (128), 111 states have internal predecessors, (128), 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) [2024-11-14 04:42:39,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 128 transitions. [2024-11-14 04:42:39,874 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 128 transitions. Word has length 52 [2024-11-14 04:42:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:42:39,874 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 128 transitions. [2024-11-14 04:42:39,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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) [2024-11-14 04:42:39,874 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 128 transitions. [2024-11-14 04:42:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-14 04:42:39,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:42:39,880 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:42:39,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 04:42:40,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-14 04:42:40,081 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:42:40,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:42:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash -975387010, now seen corresponding path program 2 times [2024-11-14 04:42:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:42:40,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960931519] [2024-11-14 04:42:40,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:42:40,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:42:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:42:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-14 04:42:40,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:42:40,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960931519] [2024-11-14 04:42:40,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960931519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:42:40,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:42:40,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 04:42:40,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038297777] [2024-11-14 04:42:40,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:42:40,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:42:40,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:42:40,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:42:40,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:42:40,439 INFO L87 Difference]: Start difference. First operand 112 states and 128 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:42:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:42:41,181 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2024-11-14 04:42:41,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:42:41,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-14 04:42:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:42:41,182 INFO L225 Difference]: With dead ends: 121 [2024-11-14 04:42:41,182 INFO L226 Difference]: Without dead ends: 121 [2024-11-14 04:42:41,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:42:41,183 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 38 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 04:42:41,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 128 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 04:42:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-14 04:42:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 112. [2024-11-14 04:42:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 97 states have (on average 1.309278350515464) internal successors, (127), 111 states have internal predecessors, (127), 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) [2024-11-14 04:42:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2024-11-14 04:42:41,187 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 55 [2024-11-14 04:42:41,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:42:41,187 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2024-11-14 04:42:41,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:42:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2024-11-14 04:42:41,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-14 04:42:41,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:42:41,189 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:42:41,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 04:42:41,190 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:42:41,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:42:41,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1851031181, now seen corresponding path program 1 times [2024-11-14 04:42:41,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:42:41,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325879642] [2024-11-14 04:42:41,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:42:41,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:42:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:42:41,369 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-14 04:42:41,369 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:42:41,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325879642] [2024-11-14 04:42:41,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325879642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:42:41,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:42:41,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:42:41,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920325910] [2024-11-14 04:42:41,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:42:41,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:42:41,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:42:41,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:42:41,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:42:41,370 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:42:41,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:42:41,561 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2024-11-14 04:42:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:42:41,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-14 04:42:41,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:42:41,563 INFO L225 Difference]: With dead ends: 114 [2024-11-14 04:42:41,563 INFO L226 Difference]: Without dead ends: 114 [2024-11-14 04:42:41,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:42:41,564 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:42:41,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:42:41,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-14 04:42:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-14 04:42:41,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 98 states have (on average 1.3061224489795917) internal successors, (128), 112 states have internal predecessors, (128), 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) [2024-11-14 04:42:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2024-11-14 04:42:41,567 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 60 [2024-11-14 04:42:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:42:41,568 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2024-11-14 04:42:41,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:42:41,568 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2024-11-14 04:42:41,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-14 04:42:41,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:42:41,569 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:42:41,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 04:42:41,570 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:42:41,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:42:41,570 INFO L85 PathProgramCache]: Analyzing trace with hash -951272162, now seen corresponding path program 1 times [2024-11-14 04:42:41,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:42:41,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812334859] [2024-11-14 04:42:41,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:42:41,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:42:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:42:41,707 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2024-11-14 04:42:41,708 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:42:41,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812334859] [2024-11-14 04:42:41,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812334859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:42:41,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:42:41,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:42:41,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865778011] [2024-11-14 04:42:41,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:42:41,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:42:41,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:42:41,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:42:41,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:42:41,709 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:42:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:42:41,900 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2024-11-14 04:42:41,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:42:41,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-14 04:42:41,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:42:41,903 INFO L225 Difference]: With dead ends: 114 [2024-11-14 04:42:41,903 INFO L226 Difference]: Without dead ends: 114 [2024-11-14 04:42:41,904 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:42:41,904 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 04:42:41,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 04:42:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-14 04:42:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-14 04:42:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.303030303030303) internal successors, (129), 113 states have internal predecessors, (129), 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) [2024-11-14 04:42:41,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2024-11-14 04:42:41,910 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 61 [2024-11-14 04:42:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:42:41,911 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2024-11-14 04:42:41,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:42:41,911 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2024-11-14 04:42:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-14 04:42:41,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:42:41,912 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:42:41,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 04:42:41,912 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:42:41,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:42:41,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1547471123, now seen corresponding path program 1 times [2024-11-14 04:42:41,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:42:41,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604252054] [2024-11-14 04:42:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:42:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:42:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:42:43,510 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 56 proven. 8 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-14 04:42:43,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:42:43,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604252054] [2024-11-14 04:42:43,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604252054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:42:43,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351994901] [2024-11-14 04:42:43,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:42:43,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:42:43,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:42:43,514 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:42:43,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 04:42:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:42:43,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 04:42:43,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:42:43,832 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 [2024-11-14 04:42:43,990 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 04:42:43,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 04:42:44,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-11-14 04:42:44,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-14 04:42:44,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:42:44,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-14 04:42:44,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:42:44,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2024-11-14 04:42:44,479 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:42:44,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2024-11-14 04:42:44,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-14 04:42:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-14 04:42:45,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:42:47,484 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2368 Int) (v_ArrVal_2370 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2368)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2370) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) is different from false [2024-11-14 04:42:50,094 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 1 not checked. [2024-11-14 04:42:50,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351994901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:42:50,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1696874964] [2024-11-14 04:42:50,096 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 04:42:50,096 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:42:50,096 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:42:50,097 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:42:50,097 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:42:55,817 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:43:29,050 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 199 DAG size of output: 187 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:43:49,092 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4539#(and (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~1#1.base|) (+ |ULTIMATE.start_main_~head~1#1.offset| 4)) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~1#1.base|) (+ |ULTIMATE.start_main_~head~1#1.offset| 4)) 0))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~head~1#1.base|) |ULTIMATE.start_main_~head~1#1.offset|) 0)) (<= 0 |ULTIMATE.start_main_~head~1#1.offset|) (<= (+ |ULTIMATE.start_main_~head~1#1.offset| 8) (select |#length| |ULTIMATE.start_main_~head~1#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~head~1#1.base|) 1))' at error location [2024-11-14 04:43:49,092 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:43:49,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:43:49,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 19 [2024-11-14 04:43:49,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219929118] [2024-11-14 04:43:49,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:43:49,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 04:43:49,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:43:49,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 04:43:49,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=966, Unknown=28, NotChecked=64, Total=1190 [2024-11-14 04:43:49,095 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 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) [2024-11-14 04:43:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:43:53,220 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2024-11-14 04:43:53,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 04:43:53,221 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 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 61 [2024-11-14 04:43:53,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:43:53,222 INFO L225 Difference]: With dead ends: 122 [2024-11-14 04:43:53,222 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 04:43:53,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 161 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=299, Invalid=1837, Unknown=30, NotChecked=90, Total=2256 [2024-11-14 04:43:53,224 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 48 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:43:53,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 398 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 443 Invalid, 0 Unknown, 67 Unchecked, 2.3s Time] [2024-11-14 04:43:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 04:43:53,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2024-11-14 04:43:53,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.292929292929293) internal successors, (128), 113 states have internal predecessors, (128), 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) [2024-11-14 04:43:53,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2024-11-14 04:43:53,228 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 61 [2024-11-14 04:43:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:43:53,228 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2024-11-14 04:43:53,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 19 states have internal predecessors, (70), 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) [2024-11-14 04:43:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2024-11-14 04:43:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 04:43:53,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:43:53,229 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:43:53,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 04:43:53,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 04:43:53,430 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:43:53,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:43:53,430 INFO L85 PathProgramCache]: Analyzing trace with hash 575423530, now seen corresponding path program 1 times [2024-11-14 04:43:53,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:43:53,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324191355] [2024-11-14 04:43:53,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:43:53,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:43:53,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:43:53,727 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-14 04:43:53,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:43:53,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324191355] [2024-11-14 04:43:53,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324191355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:43:53,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:43:53,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:43:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688753373] [2024-11-14 04:43:53,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:43:53,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 04:43:53,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:43:53,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 04:43:53,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:43:53,730 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:43:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:43:54,310 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2024-11-14 04:43:54,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 04:43:54,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-14 04:43:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:43:54,312 INFO L225 Difference]: With dead ends: 122 [2024-11-14 04:43:54,312 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 04:43:54,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 04:43:54,312 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 26 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:43:54,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 131 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 04:43:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 04:43:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 116. [2024-11-14 04:43:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 101 states have (on average 1.297029702970297) internal successors, (131), 115 states have internal predecessors, (131), 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) [2024-11-14 04:43:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2024-11-14 04:43:54,317 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 62 [2024-11-14 04:43:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:43:54,317 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2024-11-14 04:43:54,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:43:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2024-11-14 04:43:54,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 04:43:54,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:43:54,318 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:43:54,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 04:43:54,318 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:43:54,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:43:54,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1962689183, now seen corresponding path program 1 times [2024-11-14 04:43:54,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:43:54,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151434234] [2024-11-14 04:43:54,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:43:54,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:43:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:43:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-14 04:43:56,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:43:56,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151434234] [2024-11-14 04:43:56,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151434234] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:43:56,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738837972] [2024-11-14 04:43:56,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:43:56,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:43:56,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:43:56,319 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:43:56,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 04:43:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:43:56,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 04:43:56,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:43:56,635 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 [2024-11-14 04:43:56,782 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 04:43:56,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 04:43:56,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-11-14 04:43:57,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-14 04:43:57,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:43:57,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-14 04:43:57,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:43:57,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 25 [2024-11-14 04:43:57,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 04:43:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-14 04:43:57,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:43:58,321 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2930 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2930) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2024-11-14 04:43:58,362 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2929 Int) (v_ArrVal_2930 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2929)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2930) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) 0)) is different from false [2024-11-14 04:44:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 60 proven. 7 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2024-11-14 04:44:13,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738837972] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:44:13,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [424882188] [2024-11-14 04:44:13,150 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 04:44:13,150 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:44:13,151 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:44:13,151 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:44:13,151 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:44:14,907 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:44:34,824 WARN L286 SmtUtils]: Spent 5.20s on a formula simplification. DAG size of input: 186 DAG size of output: 178 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:44:46,137 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5456#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~1#1.base|)) (<= 1 |#StackHeapBarrier|) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~1#1.base|) 4) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~1#1.base|) 4) 0))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~head~1#1.base|) 8) 0)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~head~1#1.base|) 0)) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~1#1.base|) 1))' at error location [2024-11-14 04:44:46,137 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:44:46,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:44:46,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 26 [2024-11-14 04:44:46,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598643098] [2024-11-14 04:44:46,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:44:46,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 04:44:46,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:44:46,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 04:44:46,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1537, Unknown=12, NotChecked=162, Total=1892 [2024-11-14 04:44:46,140 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 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) [2024-11-14 04:44:49,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:44:49,697 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2024-11-14 04:44:49,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 04:44:49,698 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 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 62 [2024-11-14 04:44:49,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:44:49,698 INFO L225 Difference]: With dead ends: 121 [2024-11-14 04:44:49,698 INFO L226 Difference]: Without dead ends: 121 [2024-11-14 04:44:49,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 152 SyntacticMatches, 8 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 49.0s TimeCoverageRelationStatistics Valid=298, Invalid=2350, Unknown=12, NotChecked=202, Total=2862 [2024-11-14 04:44:49,700 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 83 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:44:49,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 500 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 412 Invalid, 0 Unknown, 109 Unchecked, 2.1s Time] [2024-11-14 04:44:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-14 04:44:49,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2024-11-14 04:44:49,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 101 states have (on average 1.2772277227722773) internal successors, (129), 115 states have internal predecessors, (129), 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) [2024-11-14 04:44:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2024-11-14 04:44:49,703 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 62 [2024-11-14 04:44:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:44:49,703 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2024-11-14 04:44:49,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.576923076923077) internal successors, (93), 26 states have internal predecessors, (93), 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) [2024-11-14 04:44:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2024-11-14 04:44:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 04:44:49,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:44:49,704 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:44:49,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 04:44:49,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 04:44:49,905 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:44:49,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:44:49,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1966981496, now seen corresponding path program 1 times [2024-11-14 04:44:49,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:44:49,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060193312] [2024-11-14 04:44:49,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:44:49,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:44:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:44:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 50 proven. 33 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-14 04:44:51,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:44:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060193312] [2024-11-14 04:44:51,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060193312] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:44:51,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312517178] [2024-11-14 04:44:51,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:44:51,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:44:51,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:44:51,587 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:44:51,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 04:44:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:44:51,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 04:44:51,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:44:51,920 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 [2024-11-14 04:44:52,062 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 04:44:52,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 04:44:52,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-11-14 04:44:52,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-14 04:44:52,557 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 04:44:52,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2024-11-14 04:44:53,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:44:53,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2024-11-14 04:44:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-14 04:44:53,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:44:53,858 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-14 04:44:53,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-14 04:44:53,876 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3304 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3304) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-11-14 04:44:53,910 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3304 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3304) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-11-14 04:44:53,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:44:53,955 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-11-14 04:44:53,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:44:53,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 28 [2024-11-14 04:44:53,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-14 04:44:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2024-11-14 04:44:54,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312517178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:44:54,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1301732368] [2024-11-14 04:44:54,411 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 04:44:54,411 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:44:54,412 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:44:54,412 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:44:54,412 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:44:58,923 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:45:17,202 WARN L286 SmtUtils]: Spent 5.17s on a formula simplification. DAG size of input: 186 DAG size of output: 178 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:45:33,687 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6123#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_~head~1#1.base_83| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_main_~head~1#1.base_83|) 1)) (or (exists ((|v_ULTIMATE.start_main_~head~1#1.base_82| Int) (|v_ULTIMATE.start_main_~head~1#1.offset_71| Int)) (and (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~head~1#1.base_82|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_71| 4)) |v_ULTIMATE.start_main_~head~1#1.base_83|) (= (select |#valid| |v_ULTIMATE.start_main_~head~1#1.base_82|) 1) (<= 0 |v_ULTIMATE.start_main_~head~1#1.offset_71|) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~head~1#1.base_82|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_71| 8)) 0) (= |ULTIMATE.start_main_~head~1#1.offset| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~head~1#1.base_82|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_71| 4))) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~head~1#1.base_82|) (+ |v_ULTIMATE.start_main_~head~1#1.offset_71| 16)) 0) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~head~1#1.base_82|) |v_ULTIMATE.start_main_~head~1#1.offset_71|) 0) (<= (+ |v_ULTIMATE.start_main_~head~1#1.offset_71| 20) (select |#length| |v_ULTIMATE.start_main_~head~1#1.base_82|)))) (= |ULTIMATE.start_main_~head~1#1.offset| 0)))))' at error location [2024-11-14 04:45:33,687 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:45:33,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:45:33,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-11-14 04:45:33,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904674738] [2024-11-14 04:45:33,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:45:33,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 04:45:33,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:45:33,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 04:45:33,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1462, Unknown=9, NotChecked=158, Total=1806 [2024-11-14 04:45:33,689 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 24 states have internal predecessors, (102), 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) [2024-11-14 04:45:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:45:39,103 INFO L93 Difference]: Finished difference Result 122 states and 135 transitions. [2024-11-14 04:45:39,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 04:45:39,103 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 24 states have internal predecessors, (102), 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 62 [2024-11-14 04:45:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:45:39,104 INFO L225 Difference]: With dead ends: 122 [2024-11-14 04:45:39,104 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 04:45:39,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 149 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=317, Invalid=2232, Unknown=9, NotChecked=198, Total=2756 [2024-11-14 04:45:39,105 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 104 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 202 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:45:39,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 352 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 770 Invalid, 0 Unknown, 202 Unchecked, 3.8s Time] [2024-11-14 04:45:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 04:45:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2024-11-14 04:45:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.2843137254901962) internal successors, (131), 116 states have internal predecessors, (131), 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) [2024-11-14 04:45:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2024-11-14 04:45:39,109 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 62 [2024-11-14 04:45:39,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:45:39,110 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2024-11-14 04:45:39,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 24 states have internal predecessors, (102), 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) [2024-11-14 04:45:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2024-11-14 04:45:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-14 04:45:39,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:45:39,111 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:45:39,128 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 04:45:39,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:45:39,311 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 32 more)] === [2024-11-14 04:45:39,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:45:39,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1966981497, now seen corresponding path program 1 times [2024-11-14 04:45:39,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:45:39,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857628251] [2024-11-14 04:45:39,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:45:39,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:45:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:45:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-14 04:45:41,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:45:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857628251] [2024-11-14 04:45:41,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857628251] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:45:41,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803659957] [2024-11-14 04:45:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:45:41,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:45:41,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:45:41,816 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:45:41,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9600a392-87f7-4c68-bc28-de0e742548e5/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 04:45:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:45:42,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-14 04:45:42,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:45:42,172 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 8 treesize of output 1 [2024-11-14 04:45:42,182 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 [2024-11-14 04:45:42,897 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 04:45:42,897 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 13 [2024-11-14 04:45:42,970 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 04:45:42,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 04:45:43,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-11-14 04:45:43,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 [2024-11-14 04:45:43,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-14 04:45:43,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 04:45:43,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 04:45:43,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2024-11-14 04:45:43,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-14 04:45:44,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-14 04:45:44,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-14 04:45:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-14 04:45:44,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:45:45,893 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3685 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3685) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_3684 (Array Int Int)) (v_ArrVal_3685 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3685) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3684) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)))))) is different from false [2024-11-14 04:45:45,952 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 12 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_3685 (Array Int Int)) (v_ArrVal_3683 Int)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_3683)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3685) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_3684 (Array Int Int)) (v_ArrVal_3685 (Array Int Int)) (v_ArrVal_3683 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_3683)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3685) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 0)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3684) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2)))))) is different from false [2024-11-14 04:45:45,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:45:45,999 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 61 [2024-11-14 04:45:46,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:45:46,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2024-11-14 04:45:46,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 54 [2024-11-14 04:45:46,068 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 96 treesize of output 78 [2024-11-14 04:45:46,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 11 [2024-11-14 04:45:46,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2024-11-14 04:45:46,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 04:45:46,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-11-14 04:45:46,159 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 04:45:46,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 04:45:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 31 trivial. 3 not checked. [2024-11-14 04:45:47,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803659957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:45:47,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1045037313] [2024-11-14 04:45:47,476 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 04:45:47,476 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:45:47,477 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:45:47,477 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:45:47,477 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:45:50,128 INFO L180 IcfgInterpreter]: Interpretation finished