./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.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_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/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_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/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_3733a994-87b3-40be-85eb-31843cbeed40/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 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:03:32,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:03:32,321 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:03:32,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:03:32,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:03:32,364 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:03:32,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:03:32,365 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:03:32,365 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:03:32,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:03:32,365 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:03:32,365 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:03:32,366 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:03:32,366 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:03:32,366 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:03:32,366 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:03:32,366 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:03:32,366 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:03:32,366 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:03:32,366 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:03:32,366 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:03:32,366 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:03:32,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:03:32,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:03:32,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:03:32,370 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:03:32,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:03:32,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:03:32,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:03:32,371 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:03:32,372 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:03:32,372 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:03:32,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:03:32,372 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:03:32,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:03:32,373 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:03:32,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:03:32,374 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:03:32,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:03:32,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:03:32,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:03:32,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:03:32,374 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:03:32,374 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:03:32,375 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:03:32,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:03:32,375 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:03:32,375 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:03:32,375 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:03:32,375 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_3733a994-87b3-40be-85eb-31843cbeed40/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 -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2024-11-14 03:03:32,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:03:32,732 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:03:32,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:03:32,738 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:03:32,738 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:03:32,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i Unable to find full path for "g++" [2024-11-14 03:03:34,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:03:35,068 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:03:35,069 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2024-11-14 03:03:35,081 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/data/899fa7ea3/00d721a5d0c940b49527a8dbceaeaaf6/FLAG81fa8b1a6 [2024-11-14 03:03:35,098 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/data/899fa7ea3/00d721a5d0c940b49527a8dbceaeaaf6 [2024-11-14 03:03:35,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:03:35,102 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:03:35,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:03:35,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:03:35,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:03:35,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67321f50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35, skipping insertion in model container [2024-11-14 03:03:35,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:03:35,426 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 03:03:35,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:03:35,459 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:03:35,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:03:35,536 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:03:35,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35 WrapperNode [2024-11-14 03:03:35,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:03:35,538 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:03:35,538 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:03:35,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:03:35,546 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,582 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 117 [2024-11-14 03:03:35,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:03:35,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:03:35,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:03:35,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:03:35,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,594 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,595 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,603 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:03:35,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:03:35,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:03:35,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:03:35,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35" (1/1) ... [2024-11-14 03:03:35,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:03:35,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:03:35,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:03:35,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:03:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 03:03:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:03:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:03:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:03:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:03:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:03:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:03:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-14 03:03:35,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:03:35,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:03:35,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:03:35,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:03:35,822 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:03:36,274 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-14 03:03:36,274 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:03:36,330 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:03:36,331 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-14 03:03:36,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:03:36 BoogieIcfgContainer [2024-11-14 03:03:36,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:03:36,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:03:36,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:03:36,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:03:36,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:03:35" (1/3) ... [2024-11-14 03:03:36,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e479ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:03:36, skipping insertion in model container [2024-11-14 03:03:36,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:03:35" (2/3) ... [2024-11-14 03:03:36,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e479ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:03:36, skipping insertion in model container [2024-11-14 03:03:36,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:03:36" (3/3) ... [2024-11-14 03:03:36,344 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2024-11-14 03:03:36,361 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:03:36,364 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG optional_data_creation_test04-1.i that has 1 procedures, 88 locations, 1 initial locations, 3 loop locations, and 46 error locations. [2024-11-14 03:03:36,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:03:36,425 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;@50479d5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:03:36,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-14 03:03:36,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 41 states have (on average 2.341463414634146) internal successors, (96), 87 states have internal predecessors, (96), 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 03:03:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:03:36,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:36,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:03:36,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:36,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash 180862, now seen corresponding path program 1 times [2024-11-14 03:03:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:36,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588385854] [2024-11-14 03:03:36,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:36,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:36,805 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 03:03:36,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:36,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588385854] [2024-11-14 03:03:36,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588385854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:36,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:36,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:03:36,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747456172] [2024-11-14 03:03:36,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:36,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:03:36,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:36,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:03:36,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:03:36,838 INFO L87 Difference]: Start difference. First operand has 88 states, 41 states have (on average 2.341463414634146) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:37,066 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2024-11-14 03:03:37,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:03:37,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 03:03:37,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:37,077 INFO L225 Difference]: With dead ends: 91 [2024-11-14 03:03:37,078 INFO L226 Difference]: Without dead ends: 90 [2024-11-14 03:03:37,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:03:37,083 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 99 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:37,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 72 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:03:37,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-14 03:03:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2024-11-14 03:03:37,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 43 states have (on average 2.116279069767442) internal successors, (91), 83 states have internal predecessors, (91), 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 03:03:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2024-11-14 03:03:37,132 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 3 [2024-11-14 03:03:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:37,134 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2024-11-14 03:03:37,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2024-11-14 03:03:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-14 03:03:37,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:37,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-14 03:03:37,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:03:37,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:37,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash 180863, now seen corresponding path program 1 times [2024-11-14 03:03:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:37,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201132506] [2024-11-14 03:03:37,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:37,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:37,394 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 03:03:37,395 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:37,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201132506] [2024-11-14 03:03:37,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201132506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:37,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:37,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:03:37,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095311082] [2024-11-14 03:03:37,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:37,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:03:37,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:37,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:03:37,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:03:37,397 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:37,677 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2024-11-14 03:03:37,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:03:37,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-14 03:03:37,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:37,679 INFO L225 Difference]: With dead ends: 127 [2024-11-14 03:03:37,679 INFO L226 Difference]: Without dead ends: 127 [2024-11-14 03:03:37,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:03:37,680 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 84 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:37,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 81 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:03:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-14 03:03:37,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 95. [2024-11-14 03:03:37,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 55 states have (on average 2.0) internal successors, (110), 94 states have internal predecessors, (110), 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 03:03:37,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2024-11-14 03:03:37,688 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 3 [2024-11-14 03:03:37,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:37,688 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2024-11-14 03:03:37,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:37,689 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2024-11-14 03:03:37,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:03:37,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:37,689 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:03:37,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:03:37,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:37,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:37,690 INFO L85 PathProgramCache]: Analyzing trace with hash 5606702, now seen corresponding path program 1 times [2024-11-14 03:03:37,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:37,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546414443] [2024-11-14 03:03:37,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:37,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:37,728 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 03:03:37,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:37,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546414443] [2024-11-14 03:03:37,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546414443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:37,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:37,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:03:37,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486772197] [2024-11-14 03:03:37,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:37,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:03:37,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:37,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:03:37,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:03:37,731 INFO L87 Difference]: Start difference. First operand 95 states and 110 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 03:03:37,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:37,839 INFO L93 Difference]: Finished difference Result 93 states and 107 transitions. [2024-11-14 03:03:37,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:03:37,839 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 03:03:37,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:37,840 INFO L225 Difference]: With dead ends: 93 [2024-11-14 03:03:37,840 INFO L226 Difference]: Without dead ends: 93 [2024-11-14 03:03:37,841 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 03:03:37,841 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 24 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:37,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 92 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:03:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-14 03:03:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-14 03:03:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 55 states have (on average 1.9454545454545455) internal successors, (107), 92 states have internal predecessors, (107), 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 03:03:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 107 transitions. [2024-11-14 03:03:37,855 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 107 transitions. Word has length 4 [2024-11-14 03:03:37,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:37,855 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 107 transitions. [2024-11-14 03:03:37,855 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 03:03:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 107 transitions. [2024-11-14 03:03:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 03:03:37,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:37,855 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 03:03:37,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:03:37,859 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:37,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:37,859 INFO L85 PathProgramCache]: Analyzing trace with hash 5606703, now seen corresponding path program 1 times [2024-11-14 03:03:37,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:37,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182771722] [2024-11-14 03:03:37,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:37,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:37,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:37,989 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 03:03:37,990 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:37,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182771722] [2024-11-14 03:03:37,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182771722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:37,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:37,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:03:37,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550822725] [2024-11-14 03:03:37,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:37,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:03:37,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:37,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:03:37,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:03:37,991 INFO L87 Difference]: Start difference. First operand 93 states and 107 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 03:03:38,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:38,092 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2024-11-14 03:03:38,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:03:38,092 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 03:03:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:38,093 INFO L225 Difference]: With dead ends: 91 [2024-11-14 03:03:38,093 INFO L226 Difference]: Without dead ends: 91 [2024-11-14 03:03:38,093 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 03:03:38,094 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 24 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:38,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 96 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:03:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-14 03:03:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-14 03:03:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.8909090909090909) internal successors, (104), 90 states have internal predecessors, (104), 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 03:03:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2024-11-14 03:03:38,100 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 4 [2024-11-14 03:03:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:38,100 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2024-11-14 03:03:38,101 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 03:03:38,101 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2024-11-14 03:03:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 03:03:38,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:38,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:38,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:03:38,101 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:38,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:38,102 INFO L85 PathProgramCache]: Analyzing trace with hash -470068013, now seen corresponding path program 1 times [2024-11-14 03:03:38,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:38,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659974919] [2024-11-14 03:03:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:38,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:38,226 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 03:03:38,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:38,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659974919] [2024-11-14 03:03:38,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659974919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:38,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:38,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:03:38,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295357535] [2024-11-14 03:03:38,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:38,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:03:38,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:38,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:03:38,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:03:38,228 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 03:03:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:38,327 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2024-11-14 03:03:38,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:03:38,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-14 03:03:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:38,328 INFO L225 Difference]: With dead ends: 87 [2024-11-14 03:03:38,328 INFO L226 Difference]: Without dead ends: 87 [2024-11-14 03:03:38,328 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 03:03:38,329 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:38,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 92 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:03:38,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-14 03:03:38,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-14 03:03:38,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.8181818181818181) internal successors, (100), 86 states have internal predecessors, (100), 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 03:03:38,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 100 transitions. [2024-11-14 03:03:38,337 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 100 transitions. Word has length 7 [2024-11-14 03:03:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:38,337 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 100 transitions. [2024-11-14 03:03:38,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 03:03:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 100 transitions. [2024-11-14 03:03:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 03:03:38,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:38,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:38,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:03:38,342 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:38,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:38,343 INFO L85 PathProgramCache]: Analyzing trace with hash -470068012, now seen corresponding path program 1 times [2024-11-14 03:03:38,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:38,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408985644] [2024-11-14 03:03:38,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:38,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:38,523 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 03:03:38,524 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:38,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408985644] [2024-11-14 03:03:38,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408985644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:38,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:38,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:03:38,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806229089] [2024-11-14 03:03:38,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:38,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:03:38,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:38,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:03:38,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:03:38,528 INFO L87 Difference]: Start difference. First operand 87 states and 100 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 03:03:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:38,658 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2024-11-14 03:03:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:03:38,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2024-11-14 03:03:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:38,659 INFO L225 Difference]: With dead ends: 83 [2024-11-14 03:03:38,659 INFO L226 Difference]: Without dead ends: 83 [2024-11-14 03:03:38,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:03:38,660 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:38,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:03:38,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-14 03:03:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-14 03:03:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 82 states have internal predecessors, (96), 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 03:03:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 96 transitions. [2024-11-14 03:03:38,665 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 96 transitions. Word has length 7 [2024-11-14 03:03:38,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:38,665 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 96 transitions. [2024-11-14 03:03:38,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 03:03:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 96 transitions. [2024-11-14 03:03:38,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:03:38,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:38,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:38,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:03:38,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:38,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:38,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2096354479, now seen corresponding path program 1 times [2024-11-14 03:03:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:38,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922685456] [2024-11-14 03:03:38,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:38,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:38,853 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 03:03:38,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:38,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922685456] [2024-11-14 03:03:38,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922685456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:38,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:38,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:03:38,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152291247] [2024-11-14 03:03:38,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:38,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:03:38,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:38,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:03:38,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:03:38,854 INFO L87 Difference]: Start difference. First operand 83 states and 96 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 03:03:39,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:39,008 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2024-11-14 03:03:39,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:03:39,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 03:03:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:39,010 INFO L225 Difference]: With dead ends: 89 [2024-11-14 03:03:39,010 INFO L226 Difference]: Without dead ends: 89 [2024-11-14 03:03:39,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:03:39,011 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:39,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 171 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:03:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-14 03:03:39,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-14 03:03:39,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 85 states have internal predecessors, (101), 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 03:03:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2024-11-14 03:03:39,016 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 10 [2024-11-14 03:03:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:39,016 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2024-11-14 03:03:39,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 03:03:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2024-11-14 03:03:39,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 03:03:39,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:39,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:39,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:03:39,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:39,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2096354480, now seen corresponding path program 1 times [2024-11-14 03:03:39,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:39,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660621804] [2024-11-14 03:03:39,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:39,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:39,328 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 03:03:39,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:39,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660621804] [2024-11-14 03:03:39,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660621804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:39,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:03:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665001164] [2024-11-14 03:03:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:39,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:03:39,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:39,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:03:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:03:39,329 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 03:03:39,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:39,508 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2024-11-14 03:03:39,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:03:39,508 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 03:03:39,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:39,509 INFO L225 Difference]: With dead ends: 86 [2024-11-14 03:03:39,509 INFO L226 Difference]: Without dead ends: 86 [2024-11-14 03:03:39,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 03:03:39,510 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 1 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:39,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:03:39,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-14 03:03:39,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-14 03:03:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.706896551724138) internal successors, (99), 85 states have internal predecessors, (99), 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 03:03:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2024-11-14 03:03:39,517 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 10 [2024-11-14 03:03:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:39,518 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2024-11-14 03:03:39,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 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 03:03:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2024-11-14 03:03:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:03:39,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:39,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:39,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:03:39,519 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:39,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:39,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1388722595, now seen corresponding path program 1 times [2024-11-14 03:03:39,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:39,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612966863] [2024-11-14 03:03:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:39,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:39,806 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 03:03:39,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:39,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612966863] [2024-11-14 03:03:39,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612966863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:39,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:39,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:03:39,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261342815] [2024-11-14 03:03:39,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:39,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:03:39,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:39,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:03:39,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:03:39,811 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 03:03:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:39,987 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2024-11-14 03:03:39,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:03:39,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 03:03:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:39,988 INFO L225 Difference]: With dead ends: 85 [2024-11-14 03:03:39,988 INFO L226 Difference]: Without dead ends: 85 [2024-11-14 03:03:39,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:03:39,989 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 87 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:39,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 110 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:03:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-14 03:03:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-14 03:03:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 81 states have internal predecessors, (95), 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 03:03:39,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2024-11-14 03:03:39,996 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 12 [2024-11-14 03:03:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:39,996 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2024-11-14 03:03:39,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 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 03:03:39,997 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2024-11-14 03:03:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 03:03:39,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:39,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:39,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:03:39,997 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:39,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:39,998 INFO L85 PathProgramCache]: Analyzing trace with hash -347614495, now seen corresponding path program 1 times [2024-11-14 03:03:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:39,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685571900] [2024-11-14 03:03:39,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:40,147 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 03:03:40,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:40,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685571900] [2024-11-14 03:03:40,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685571900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:40,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:40,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:03:40,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594409674] [2024-11-14 03:03:40,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:40,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:03:40,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:40,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:03:40,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:03:40,149 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:40,291 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2024-11-14 03:03:40,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:03:40,292 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 03:03:40,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:40,293 INFO L225 Difference]: With dead ends: 117 [2024-11-14 03:03:40,293 INFO L226 Difference]: Without dead ends: 117 [2024-11-14 03:03:40,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:03:40,294 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 56 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:40,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 177 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:03:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-14 03:03:40,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 82. [2024-11-14 03:03:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.709090909090909) internal successors, (94), 81 states have internal predecessors, (94), 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 03:03:40,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 94 transitions. [2024-11-14 03:03:40,305 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 94 transitions. Word has length 13 [2024-11-14 03:03:40,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:40,305 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 94 transitions. [2024-11-14 03:03:40,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2024-11-14 03:03:40,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 03:03:40,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:40,306 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:40,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 03:03:40,306 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:40,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:40,307 INFO L85 PathProgramCache]: Analyzing trace with hash -347614523, now seen corresponding path program 1 times [2024-11-14 03:03:40,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:40,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076610028] [2024-11-14 03:03:40,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:40,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:40,493 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 03:03:40,493 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:40,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076610028] [2024-11-14 03:03:40,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076610028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:40,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:40,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:03:40,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147314565] [2024-11-14 03:03:40,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:40,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:03:40,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:40,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:03:40,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:03:40,497 INFO L87 Difference]: Start difference. First operand 82 states and 94 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:40,704 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2024-11-14 03:03:40,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:03:40,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 03:03:40,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:40,706 INFO L225 Difference]: With dead ends: 113 [2024-11-14 03:03:40,706 INFO L226 Difference]: Without dead ends: 113 [2024-11-14 03:03:40,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:03:40,706 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 48 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:40,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 155 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:03:40,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-14 03:03:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 82. [2024-11-14 03:03:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.690909090909091) internal successors, (93), 81 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 03:03:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2024-11-14 03:03:40,710 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 13 [2024-11-14 03:03:40,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:40,711 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2024-11-14 03:03:40,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:40,711 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2024-11-14 03:03:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 03:03:40,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:40,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:40,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 03:03:40,711 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:40,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:40,712 INFO L85 PathProgramCache]: Analyzing trace with hash -347614522, now seen corresponding path program 1 times [2024-11-14 03:03:40,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:40,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380803455] [2024-11-14 03:03:40,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:40,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:40,978 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 03:03:40,978 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:40,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380803455] [2024-11-14 03:03:40,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380803455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:03:40,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:03:40,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:03:40,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884732323] [2024-11-14 03:03:40,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:03:40,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:03:40,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:40,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:03:40,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:03:40,979 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:41,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:41,179 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2024-11-14 03:03:41,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:03:41,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 03:03:41,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:41,180 INFO L225 Difference]: With dead ends: 130 [2024-11-14 03:03:41,180 INFO L226 Difference]: Without dead ends: 130 [2024-11-14 03:03:41,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:03:41,181 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 42 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:41,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 157 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:03:41,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-14 03:03:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 92. [2024-11-14 03:03:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.6) internal successors, (104), 91 states have internal predecessors, (104), 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 03:03:41,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2024-11-14 03:03:41,189 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 13 [2024-11-14 03:03:41,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:41,189 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2024-11-14 03:03:41,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:03:41,189 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2024-11-14 03:03:41,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 03:03:41,190 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:41,190 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:41,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:03:41,190 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:41,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:41,192 INFO L85 PathProgramCache]: Analyzing trace with hash -619645143, now seen corresponding path program 1 times [2024-11-14 03:03:41,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:41,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534469105] [2024-11-14 03:03:41,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:41,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:03:41,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:41,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534469105] [2024-11-14 03:03:41,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534469105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:03:41,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897122812] [2024-11-14 03:03:41,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:41,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:03:41,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:03:41,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:03:41,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:03:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:41,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 03:03:41,618 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:03:41,668 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 03:03:41,693 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:03:41,694 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 03:03:41,733 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 19 treesize of output 1 [2024-11-14 03:03:41,812 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:03:41,812 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 42 treesize of output 41 [2024-11-14 03:03:41,842 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 31 treesize of output 13 [2024-11-14 03:03:41,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:03:41,849 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:03:41,885 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-14 03:03:41,886 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 03:03:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:03:42,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897122812] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:03:42,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [327257203] [2024-11-14 03:03:42,031 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-14 03:03:42,031 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:03:42,035 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:03:42,040 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:03:42,040 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:03:44,080 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:03:46,350 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2491#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (exists ((|v_ULTIMATE.start_create_data_#t~mem7#1.base_23| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_data_#t~mem7#1.base_23|) 1))) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (= |ULTIMATE.start_create_data_~data~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (<= 0 |ULTIMATE.start_create_data_~counter~0#1|) (= |ULTIMATE.start_append_~node~0#1.offset| 0) (<= |ULTIMATE.start_create_data_#t~nondet8#1| 2147483647) (<= 0 (+ |ULTIMATE.start_create_data_#t~nondet8#1| 2147483648)))' at error location [2024-11-14 03:03:46,351 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:03:46,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:03:46,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-14 03:03:46,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851868339] [2024-11-14 03:03:46,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:03:46,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:03:46,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:03:46,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:03:46,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=440, Unknown=2, NotChecked=0, Total=506 [2024-11-14 03:03:46,354 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 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 03:03:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:03:46,689 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2024-11-14 03:03:46,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:03:46,690 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 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 13 [2024-11-14 03:03:46,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:03:46,690 INFO L225 Difference]: With dead ends: 91 [2024-11-14 03:03:46,690 INFO L226 Difference]: Without dead ends: 91 [2024-11-14 03:03:46,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=90, Invalid=558, Unknown=2, NotChecked=0, Total=650 [2024-11-14 03:03:46,692 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:03:46,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 385 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:03:46,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-14 03:03:46,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-14 03:03:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.5846153846153845) internal successors, (103), 90 states have internal predecessors, (103), 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 03:03:46,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2024-11-14 03:03:46,697 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 13 [2024-11-14 03:03:46,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:03:46,698 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2024-11-14 03:03:46,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 13 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 03:03:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-11-14 03:03:46,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-14 03:03:46,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:03:46,699 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:03:46,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-14 03:03:46,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 03:03:46,900 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:03:46,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:03:46,900 INFO L85 PathProgramCache]: Analyzing trace with hash -619645142, now seen corresponding path program 1 times [2024-11-14 03:03:46,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:03:46,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812138357] [2024-11-14 03:03:46,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:46,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:03:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:03:47,294 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:03:47,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812138357] [2024-11-14 03:03:47,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812138357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:03:47,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307116798] [2024-11-14 03:03:47,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:03:47,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:03:47,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:03:47,297 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:03:47,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:03:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:03:47,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-14 03:03:47,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:03:47,406 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 03:03:47,425 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:03:47,425 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 03:03:47,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-14 03:03:47,463 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 19 treesize of output 1 [2024-11-14 03:03:47,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:03:47,599 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:03:47,599 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 62 treesize of output 57 [2024-11-14 03:03:47,609 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 03:03:47,664 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 31 treesize of output 13 [2024-11-14 03:03:47,672 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 03:03:47,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:03:47,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:03:47,780 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_295) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_295) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_296) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))))) is different from false [2024-11-14 03:03:47,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_295 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_295) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_295) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_296) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2024-11-14 03:03:47,820 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:03:47,820 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 1 case distinctions, treesize of input 24 treesize of output 25 [2024-11-14 03:03:47,825 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 40 treesize of output 28 [2024-11-14 03:03:47,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:03:47,842 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 1 case distinctions, treesize of input 45 treesize of output 46 [2024-11-14 03:03:47,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:03:47,850 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 1 case distinctions, treesize of input 35 treesize of output 36 [2024-11-14 03:03:47,854 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:03:47,857 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 33 treesize of output 21 [2024-11-14 03:03:47,861 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:03:47,863 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 24 treesize of output 12 [2024-11-14 03:03:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-14 03:03:47,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307116798] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:03:47,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1055960323] [2024-11-14 03:03:47,922 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-14 03:03:47,922 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:03:47,922 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:03:47,923 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:03:47,923 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:03:49,140 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:04:03,733 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2780#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (exists ((|v_ULTIMATE.start_create_data_#t~mem7#1.offset_27| Int) (|v_ULTIMATE.start_create_data_#t~mem7#1.base_31| Int) (|v_ULTIMATE.start_create_data_~counter~0#1_37| Int)) (and (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |v_ULTIMATE.start_create_data_~counter~0#1_37|) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (or (< (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_37| 4) |v_ULTIMATE.start_create_data_#t~mem7#1.offset_27|) 0) (< (select |#length| |v_ULTIMATE.start_create_data_#t~mem7#1.base_31|) (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_37| 4) |v_ULTIMATE.start_create_data_#t~mem7#1.offset_27| 4))) (<= |ULTIMATE.start_create_data_#t~nondet8#1| 2147483647) (<= 0 (+ |ULTIMATE.start_create_data_#t~nondet8#1| 2147483648)))) (= |ULTIMATE.start_create_data_~data~0#1.offset| 0) (= |ULTIMATE.start_append_~node~0#1.offset| 0))' at error location [2024-11-14 03:04:03,733 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:04:03,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:04:03,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2024-11-14 03:04:03,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760275474] [2024-11-14 03:04:03,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:04:03,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-14 03:04:03,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:03,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-14 03:04:03,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=622, Unknown=7, NotChecked=102, Total=812 [2024-11-14 03:04:03,735 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:04,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:04,304 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2024-11-14 03:04:04,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:04:04,305 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-14 03:04:04,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:04,306 INFO L225 Difference]: With dead ends: 94 [2024-11-14 03:04:04,306 INFO L226 Difference]: Without dead ends: 94 [2024-11-14 03:04:04,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=125, Invalid=868, Unknown=7, NotChecked=122, Total=1122 [2024-11-14 03:04:04,307 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 33 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:04,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 503 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 378 Invalid, 0 Unknown, 83 Unchecked, 0.3s Time] [2024-11-14 03:04:04,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-14 03:04:04,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-14 03:04:04,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.5588235294117647) internal successors, (106), 93 states have internal predecessors, (106), 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 03:04:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2024-11-14 03:04:04,312 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 13 [2024-11-14 03:04:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:04,313 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2024-11-14 03:04:04,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2024-11-14 03:04:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:04:04,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:04,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:04,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-14 03:04:04,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-14 03:04:04,519 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:04:04,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash 949965618, now seen corresponding path program 1 times [2024-11-14 03:04:04,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:04,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167294520] [2024-11-14 03:04:04,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:04,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:04,597 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 03:04:04,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:04,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167294520] [2024-11-14 03:04:04,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167294520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:04:04,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:04:04,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:04:04,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140070015] [2024-11-14 03:04:04,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:04:04,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:04:04,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:04,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:04:04,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:04:04,598 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:04,746 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2024-11-14 03:04:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:04:04,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:04:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:04,747 INFO L225 Difference]: With dead ends: 105 [2024-11-14 03:04:04,747 INFO L226 Difference]: Without dead ends: 105 [2024-11-14 03:04:04,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:04:04,748 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 30 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:04,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 127 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:04:04,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-14 03:04:04,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 93. [2024-11-14 03:04:04,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 92 states have internal predecessors, (104), 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 03:04:04,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2024-11-14 03:04:04,751 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 15 [2024-11-14 03:04:04,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:04,752 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2024-11-14 03:04:04,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2024-11-14 03:04:04,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:04:04,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:04,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:04,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 03:04:04,756 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:04:04,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:04,756 INFO L85 PathProgramCache]: Analyzing trace with hash 949965619, now seen corresponding path program 1 times [2024-11-14 03:04:04,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:04,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705846039] [2024-11-14 03:04:04,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:04,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:04,962 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 03:04:04,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:04,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705846039] [2024-11-14 03:04:04,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705846039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:04:04,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:04:04,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:04:04,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834351820] [2024-11-14 03:04:04,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:04:04,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:04:04,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:04,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:04:04,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:04:04,964 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:05,183 INFO L93 Difference]: Finished difference Result 122 states and 136 transitions. [2024-11-14 03:04:05,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:04:05,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:04:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:05,184 INFO L225 Difference]: With dead ends: 122 [2024-11-14 03:04:05,184 INFO L226 Difference]: Without dead ends: 122 [2024-11-14 03:04:05,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:04:05,185 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 81 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:05,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 229 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:04:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-14 03:04:05,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 93. [2024-11-14 03:04:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 92 states have internal predecessors, (103), 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 03:04:05,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2024-11-14 03:04:05,191 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 15 [2024-11-14 03:04:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:05,191 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2024-11-14 03:04:05,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:05,192 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2024-11-14 03:04:05,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:04:05,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:05,192 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:05,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 03:04:05,193 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:04:05,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:05,193 INFO L85 PathProgramCache]: Analyzing trace with hash -75494800, now seen corresponding path program 2 times [2024-11-14 03:04:05,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:05,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153961345] [2024-11-14 03:04:05,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:05,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:05,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:04:05,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153961345] [2024-11-14 03:04:05,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153961345] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:04:05,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206700357] [2024-11-14 03:04:05,686 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:04:05,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:04:05,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:04:05,689 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:04:05,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:04:05,808 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:04:05,808 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:04:05,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-14 03:04:05,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:04:05,816 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 03:04:05,824 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 03:04:05,834 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:04:05,835 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 03:04:05,868 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 19 treesize of output 1 [2024-11-14 03:04:05,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:04:05,983 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:04:05,983 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 62 treesize of output 57 [2024-11-14 03:04:05,989 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 03:04:06,093 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:04:06,094 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 62 treesize of output 57 [2024-11-14 03:04:06,099 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 03:04:06,152 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 31 treesize of output 13 [2024-11-14 03:04:06,167 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 03:04:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:04:06,196 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:04:06,286 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_412 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_412 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_413) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2024-11-14 03:04:06,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_411))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_410) .cse1 v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_413) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_410) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_411) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) is different from false [2024-11-14 03:04:06,408 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_413 (Array Int Int)) (v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_411))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_410) .cse1 v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_413) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_410 (Array Int Int)) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_411 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_410) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_411) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_412) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8)))))) is different from false [2024-11-14 03:04:06,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:06,431 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 1 case distinctions, treesize of input 89 treesize of output 90 [2024-11-14 03:04:06,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:06,440 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 1 case distinctions, treesize of input 79 treesize of output 60 [2024-11-14 03:04:06,446 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 754 treesize of output 640 [2024-11-14 03:04:06,465 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 415 treesize of output 385 [2024-11-14 03:04:06,477 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 132 treesize of output 100 [2024-11-14 03:04:06,483 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 77 treesize of output 73 [2024-11-14 03:04:06,487 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 96 treesize of output 84 [2024-11-14 03:04:06,494 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 18 treesize of output 14 [2024-11-14 03:04:06,527 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:06,527 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 1 case distinctions, treesize of input 46 treesize of output 47 [2024-11-14 03:04:06,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:06,535 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 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-14 03:04:06,539 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:04:06,541 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 34 treesize of output 22 [2024-11-14 03:04:06,545 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:04:06,548 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 03:04:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2024-11-14 03:04:06,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206700357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:04:06,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1939182755] [2024-11-14 03:04:06,607 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-14 03:04:06,607 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:04:06,607 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:04:06,608 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:04:06,608 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:04:07,631 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:04:09,447 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3536#(exists ((|v_ULTIMATE.start_create_data_#t~mem7#1.offset_35| Int) (|v_ULTIMATE.start_create_data_#t~mem7#1.base_41| Int) (|v_ULTIMATE.start_create_data_~counter~0#1_47| Int)) (and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (= |ULTIMATE.start_create_data_~data~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (or (< (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_47| 4) |v_ULTIMATE.start_create_data_#t~mem7#1.offset_35|) 0) (< (select |#length| |v_ULTIMATE.start_create_data_#t~mem7#1.base_41|) (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_47| 4) |v_ULTIMATE.start_create_data_#t~mem7#1.offset_35| 4))) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (<= 0 |v_ULTIMATE.start_create_data_~counter~0#1_47|) (= |ULTIMATE.start_append_~node~0#1.offset| 0) (<= |ULTIMATE.start_create_data_#t~nondet8#1| 2147483647) (<= 0 (+ |ULTIMATE.start_create_data_#t~nondet8#1| 2147483648))))' at error location [2024-11-14 03:04:09,447 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:04:09,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:04:09,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2024-11-14 03:04:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684516918] [2024-11-14 03:04:09,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:04:09,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-14 03:04:09,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:09,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-14 03:04:09,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=887, Unknown=4, NotChecked=186, Total=1190 [2024-11-14 03:04:09,450 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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 03:04:10,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:10,396 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2024-11-14 03:04:10,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:04:10,397 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-14 03:04:10,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:10,398 INFO L225 Difference]: With dead ends: 99 [2024-11-14 03:04:10,398 INFO L226 Difference]: Without dead ends: 99 [2024-11-14 03:04:10,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=202, Invalid=1446, Unknown=4, NotChecked=240, Total=1892 [2024-11-14 03:04:10,399 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 48 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 3 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:10,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 637 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 513 Invalid, 18 Unknown, 144 Unchecked, 0.5s Time] [2024-11-14 03:04:10,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-14 03:04:10,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-14 03:04:10,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 98 states have internal predecessors, (110), 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 03:04:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2024-11-14 03:04:10,403 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 16 [2024-11-14 03:04:10,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:10,403 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2024-11-14 03:04:10,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 25 states have internal predecessors, (39), 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 03:04:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2024-11-14 03:04:10,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 03:04:10,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:10,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:10,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 03:04:10,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:04:10,608 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:04:10,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:10,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1911018965, now seen corresponding path program 1 times [2024-11-14 03:04:10,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:10,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278656047] [2024-11-14 03:04:10,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:10,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:11,012 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 03:04:11,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:11,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278656047] [2024-11-14 03:04:11,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278656047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:04:11,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:04:11,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:04:11,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699888699] [2024-11-14 03:04:11,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:04:11,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:04:11,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:11,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:04:11,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:04:11,013 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 03:04:11,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:11,520 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2024-11-14 03:04:11,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:04:11,520 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 17 [2024-11-14 03:04:11,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:11,521 INFO L225 Difference]: With dead ends: 128 [2024-11-14 03:04:11,521 INFO L226 Difference]: Without dead ends: 128 [2024-11-14 03:04:11,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-14 03:04:11,522 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 102 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:11,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 240 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:04:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-14 03:04:11,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 110. [2024-11-14 03:04:11,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 109 states have internal predecessors, (122), 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 03:04:11,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2024-11-14 03:04:11,526 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 17 [2024-11-14 03:04:11,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:11,526 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2024-11-14 03:04:11,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 03:04:11,526 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2024-11-14 03:04:11,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 03:04:11,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:11,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:11,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 03:04:11,527 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:04:11,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:11,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1756745000, now seen corresponding path program 1 times [2024-11-14 03:04:11,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:11,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319481302] [2024-11-14 03:04:11,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:11,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:11,637 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 03:04:11,638 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:11,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319481302] [2024-11-14 03:04:11,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319481302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:04:11,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:04:11,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:04:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846948991] [2024-11-14 03:04:11,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:04:11,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:04:11,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:04:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:04:11,639 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:11,752 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2024-11-14 03:04:11,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:04:11,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-14 03:04:11,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:11,754 INFO L225 Difference]: With dead ends: 138 [2024-11-14 03:04:11,754 INFO L226 Difference]: Without dead ends: 138 [2024-11-14 03:04:11,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:04:11,754 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 43 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:11,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 170 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:04:11,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-14 03:04:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2024-11-14 03:04:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 97 states have (on average 1.5154639175257731) internal successors, (147), 121 states have internal predecessors, (147), 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 03:04:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 147 transitions. [2024-11-14 03:04:11,763 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 147 transitions. Word has length 19 [2024-11-14 03:04:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:11,763 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 147 transitions. [2024-11-14 03:04:11,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:04:11,763 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 147 transitions. [2024-11-14 03:04:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:04:11,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:11,764 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:11,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 03:04:11,765 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:04:11,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:11,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1375479681, now seen corresponding path program 1 times [2024-11-14 03:04:11,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:11,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609128033] [2024-11-14 03:04:11,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:11,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:11,896 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 03:04:11,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:11,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609128033] [2024-11-14 03:04:11,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609128033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:04:11,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:04:11,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:04:11,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466562144] [2024-11-14 03:04:11,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:04:11,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:04:11,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:11,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:04:11,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:04:11,897 INFO L87 Difference]: Start difference. First operand 122 states and 147 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 03:04:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:12,069 INFO L93 Difference]: Finished difference Result 137 states and 153 transitions. [2024-11-14 03:04:12,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:04:12,070 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 20 [2024-11-14 03:04:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:12,071 INFO L225 Difference]: With dead ends: 137 [2024-11-14 03:04:12,071 INFO L226 Difference]: Without dead ends: 137 [2024-11-14 03:04:12,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:04:12,072 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 43 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:12,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 138 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:04:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-14 03:04:12,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 123. [2024-11-14 03:04:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.510204081632653) internal successors, (148), 122 states have internal predecessors, (148), 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 03:04:12,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 148 transitions. [2024-11-14 03:04:12,077 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 148 transitions. Word has length 20 [2024-11-14 03:04:12,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:12,078 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 148 transitions. [2024-11-14 03:04:12,078 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 03:04:12,078 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 148 transitions. [2024-11-14 03:04:12,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:04:12,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:12,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:12,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-14 03:04:12,081 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:04:12,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash 309803018, now seen corresponding path program 1 times [2024-11-14 03:04:12,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:12,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825169953] [2024-11-14 03:04:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:12,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:12,149 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 03:04:12,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:12,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825169953] [2024-11-14 03:04:12,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825169953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:04:12,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:04:12,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:04:12,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579087386] [2024-11-14 03:04:12,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:04:12,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:04:12,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:12,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:04:12,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:04:12,151 INFO L87 Difference]: Start difference. First operand 123 states and 148 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 03:04:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:12,305 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2024-11-14 03:04:12,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:04:12,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 21 [2024-11-14 03:04:12,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:12,306 INFO L225 Difference]: With dead ends: 139 [2024-11-14 03:04:12,306 INFO L226 Difference]: Without dead ends: 139 [2024-11-14 03:04:12,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:04:12,307 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:12,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 127 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:04:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-14 03:04:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 128. [2024-11-14 03:04:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 127 states have internal predecessors, (155), 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 03:04:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 155 transitions. [2024-11-14 03:04:12,312 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 155 transitions. Word has length 21 [2024-11-14 03:04:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:12,312 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 155 transitions. [2024-11-14 03:04:12,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 03:04:12,312 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 155 transitions. [2024-11-14 03:04:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:04:12,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:12,313 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:12,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-14 03:04:12,313 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:04:12,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1275196869, now seen corresponding path program 1 times [2024-11-14 03:04:12,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:12,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018479230] [2024-11-14 03:04:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:12,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:12,722 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 03:04:12,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:12,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018479230] [2024-11-14 03:04:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018479230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:04:12,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:04:12,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:04:12,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428018813] [2024-11-14 03:04:12,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:04:12,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:04:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:12,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:04:12,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:04:12,725 INFO L87 Difference]: Start difference. First operand 128 states and 155 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 03:04:13,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:13,292 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2024-11-14 03:04:13,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:04:13,293 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 21 [2024-11-14 03:04:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:13,294 INFO L225 Difference]: With dead ends: 151 [2024-11-14 03:04:13,294 INFO L226 Difference]: Without dead ends: 151 [2024-11-14 03:04:13,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-14 03:04:13,295 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 135 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:13,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 258 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:04:13,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-14 03:04:13,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2024-11-14 03:04:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 132 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 03:04:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 162 transitions. [2024-11-14 03:04:13,300 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 162 transitions. Word has length 21 [2024-11-14 03:04:13,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:13,300 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 162 transitions. [2024-11-14 03:04:13,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 03:04:13,300 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 162 transitions. [2024-11-14 03:04:13,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:04:13,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:13,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:13,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-14 03:04:13,301 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:04:13,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:13,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1275196868, now seen corresponding path program 1 times [2024-11-14 03:04:13,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:13,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468688319] [2024-11-14 03:04:13,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:13,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:13,818 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 03:04:13,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:13,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468688319] [2024-11-14 03:04:13,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468688319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:04:13,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:04:13,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:04:13,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844052886] [2024-11-14 03:04:13,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:04:13,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:04:13,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:13,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:04:13,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:04:13,820 INFO L87 Difference]: Start difference. First operand 133 states and 162 transitions. Second operand has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 03:04:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:14,417 INFO L93 Difference]: Finished difference Result 171 states and 204 transitions. [2024-11-14 03:04:14,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 03:04:14,417 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 21 [2024-11-14 03:04:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:14,418 INFO L225 Difference]: With dead ends: 171 [2024-11-14 03:04:14,418 INFO L226 Difference]: Without dead ends: 171 [2024-11-14 03:04:14,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2024-11-14 03:04:14,419 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 124 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:14,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 206 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:04:14,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-14 03:04:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 144. [2024-11-14 03:04:14,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 120 states have (on average 1.4833333333333334) internal successors, (178), 143 states have internal predecessors, (178), 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 03:04:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 178 transitions. [2024-11-14 03:04:14,427 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 178 transitions. Word has length 21 [2024-11-14 03:04:14,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:14,427 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 178 transitions. [2024-11-14 03:04:14,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 03:04:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 178 transitions. [2024-11-14 03:04:14,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 03:04:14,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:14,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:14,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-14 03:04:14,429 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:04:14,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:14,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1013959138, now seen corresponding path program 1 times [2024-11-14 03:04:14,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:14,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096287487] [2024-11-14 03:04:14,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:14,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:14,675 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 03:04:14,675 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:14,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096287487] [2024-11-14 03:04:14,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096287487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:04:14,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:04:14,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:04:14,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716119927] [2024-11-14 03:04:14,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:04:14,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:04:14,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:14,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:04:14,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:04:14,677 INFO L87 Difference]: Start difference. First operand 144 states and 178 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 03:04:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:14,876 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2024-11-14 03:04:14,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:04:14,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 22 [2024-11-14 03:04:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:14,878 INFO L225 Difference]: With dead ends: 156 [2024-11-14 03:04:14,878 INFO L226 Difference]: Without dead ends: 156 [2024-11-14 03:04:14,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:04:14,879 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 106 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:14,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 134 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:04:14,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-14 03:04:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2024-11-14 03:04:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 122 states have (on average 1.4836065573770492) internal successors, (181), 145 states have internal predecessors, (181), 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 03:04:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 181 transitions. [2024-11-14 03:04:14,883 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 181 transitions. Word has length 22 [2024-11-14 03:04:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:14,887 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 181 transitions. [2024-11-14 03:04:14,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 03:04:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 181 transitions. [2024-11-14 03:04:14,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 03:04:14,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:14,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:14,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-14 03:04:14,888 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:04:14,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:14,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1013959139, now seen corresponding path program 1 times [2024-11-14 03:04:14,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:14,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947279548] [2024-11-14 03:04:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:14,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:14,948 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 03:04:14,948 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:14,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947279548] [2024-11-14 03:04:14,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947279548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:04:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:04:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:04:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630702551] [2024-11-14 03:04:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:04:14,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:04:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:04:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:04:14,951 INFO L87 Difference]: Start difference. First operand 146 states and 181 transitions. Second operand has 4 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 03:04:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:04:15,018 INFO L93 Difference]: Finished difference Result 141 states and 173 transitions. [2024-11-14 03:04:15,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:04:15,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 22 [2024-11-14 03:04:15,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:04:15,019 INFO L225 Difference]: With dead ends: 141 [2024-11-14 03:04:15,019 INFO L226 Difference]: Without dead ends: 141 [2024-11-14 03:04:15,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:04:15,020 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 48 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:04:15,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 37 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:04:15,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-14 03:04:15,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-14 03:04:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 122 states have (on average 1.4180327868852458) internal successors, (173), 140 states have internal predecessors, (173), 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 03:04:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 173 transitions. [2024-11-14 03:04:15,030 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 173 transitions. Word has length 22 [2024-11-14 03:04:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:04:15,030 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 173 transitions. [2024-11-14 03:04:15,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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 03:04:15,031 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 173 transitions. [2024-11-14 03:04:15,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 03:04:15,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:04:15,031 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:04:15,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-14 03:04:15,031 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:04:15,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:04:15,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1208160208, now seen corresponding path program 3 times [2024-11-14 03:04:15,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:04:15,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915043079] [2024-11-14 03:04:15,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:04:15,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:04:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:04:15,783 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:04:15,784 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:04:15,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915043079] [2024-11-14 03:04:15,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915043079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:04:15,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070985646] [2024-11-14 03:04:15,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 03:04:15,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:04:15,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:04:15,786 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:04:15,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:04:15,938 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 03:04:15,938 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:04:15,942 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-14 03:04:15,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:04:15,953 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 03:04:15,968 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:04:15,968 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 03:04:15,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-14 03:04:16,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:04:16,032 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 19 treesize of output 1 [2024-11-14 03:04:16,153 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:04:16,154 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 62 treesize of output 57 [2024-11-14 03:04:16,164 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 03:04:16,293 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:04:16,294 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 62 treesize of output 57 [2024-11-14 03:04:16,299 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 03:04:16,416 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:04:16,417 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 62 treesize of output 57 [2024-11-14 03:04:16,421 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 03:04:16,548 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 03:04:16,549 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 62 treesize of output 57 [2024-11-14 03:04:16,556 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 03:04:16,626 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 31 treesize of output 13 [2024-11-14 03:04:16,632 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 03:04:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:04:16,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:04:16,880 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_719 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2024-11-14 03:04:16,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_717 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_717) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_718) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_717 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_718))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_717) .cse2 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))))) is different from false [2024-11-14 03:04:17,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_716))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_715) .cse1 v_ArrVal_717) (select (select (store .cse2 .cse1 v_ArrVal_718) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_719))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12))) (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_716))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_718))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 16 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_715) .cse4 v_ArrVal_717) .cse5 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))))) is different from false [2024-11-14 03:04:17,131 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse4 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_716))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_718))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_715) .cse1 v_ArrVal_717) .cse2 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse4 16) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_716))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_715) .cse7 v_ArrVal_717) (select (select (store .cse8 .cse7 v_ArrVal_718) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_719))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse4 12)))))) is different from false [2024-11-14 03:04:17,213 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (<= 0 (+ .cse0 16 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_713))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_716))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_714) .cse1 v_ArrVal_715) .cse2 v_ArrVal_717) (select (select (store .cse3 .cse2 v_ArrVal_718) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_719))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_713))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_716))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_718))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (<= (+ .cse0 20 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_714) .cse6 v_ArrVal_715) .cse7 v_ArrVal_717) .cse8 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))))))))) is different from false [2024-11-14 03:04:20,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:20,868 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 1 case distinctions, treesize of input 178 treesize of output 179 [2024-11-14 03:04:20,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:20,894 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 1 case distinctions, treesize of input 168 treesize of output 109 [2024-11-14 03:04:20,916 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 62598 treesize of output 53412 [2024-11-14 03:04:21,374 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 37395 treesize of output 36807 [2024-11-14 03:04:21,447 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 435 treesize of output 399 [2024-11-14 03:04:21,464 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 399 treesize of output 363 [2024-11-14 03:04:21,478 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 363 treesize of output 343 [2024-11-14 03:04:21,498 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 343 treesize of output 299 [2024-11-14 03:04:21,513 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 299 treesize of output 263 [2024-11-14 03:04:21,529 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 216 treesize of output 212 [2024-11-14 03:04:21,549 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 46 treesize of output 42 [2024-11-14 03:04:21,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:21,726 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 1 case distinctions, treesize of input 353 treesize of output 354 [2024-11-14 03:04:21,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:04:21,748 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 1 case distinctions, treesize of input 343 treesize of output 204 [2024-11-14 03:04:21,754 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:04:21,765 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 9636 treesize of output 6810 [2024-11-14 03:04:21,799 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:04:21,804 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 24 treesize of output 12 [2024-11-14 03:04:22,178 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 5 refuted. 2 times theorem prover too weak. 0 trivial. 23 not checked. [2024-11-14 03:04:22,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070985646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:04:22,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1650000943] [2024-11-14 03:04:22,180 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-14 03:04:22,180 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:04:22,180 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:04:22,180 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:04:22,180 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:04:23,127 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:04:35,739 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6270#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~pointerToList#1.offset| 0) (= |ULTIMATE.start_create_data_~data~0#1.offset| 0) (= |ULTIMATE.start_append_~node~0#1.offset| 0) (exists ((|v_ULTIMATE.start_create_data_#t~mem7#1.offset_45| Int) (|v_ULTIMATE.start_create_data_~counter~0#1_61| Int) (|v_ULTIMATE.start_create_data_#t~mem7#1.base_55| Int)) (and (<= 1 |#StackHeapBarrier|) (or (< (select |#length| |v_ULTIMATE.start_create_data_#t~mem7#1.base_55|) (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_61| 4) |v_ULTIMATE.start_create_data_#t~mem7#1.offset_45| 4)) (< (+ (* |v_ULTIMATE.start_create_data_~counter~0#1_61| 4) |v_ULTIMATE.start_create_data_#t~mem7#1.offset_45|) 0)) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= 0 |v_ULTIMATE.start_create_data_~counter~0#1_61|) (<= 2 |ULTIMATE.start_append_~pointerToList#1.base|) (<= |ULTIMATE.start_create_data_#t~nondet8#1| 2147483647) (<= 0 (+ |ULTIMATE.start_create_data_#t~nondet8#1| 2147483648)))))' at error location [2024-11-14 03:04:35,739 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:04:35,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:04:35,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 36 [2024-11-14 03:04:35,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135945857] [2024-11-14 03:04:35,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:04:35,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-14 03:04:35,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:04:35,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-14 03:04:35,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1535, Unknown=26, NotChecked=420, Total=2162 [2024-11-14 03:04:35,742 INFO L87 Difference]: Start difference. First operand 141 states and 173 transitions. Second operand has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 37 states have internal predecessors, (57), 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 03:04:41,607 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 [1] [2024-11-14 03:04:43,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:04:46,165 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 [1] [2024-11-14 03:04:50,190 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 [1] [2024-11-14 03:04:53,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:04:56,958 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (<= 0 (+ .cse0 .cse1)) (forall ((v_ArrVal_717 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_717) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_718) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_717 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_718))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_717) .cse4 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (<= (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (<= 0 (+ .cse0 16 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_713))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_716))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_714) .cse6 v_ArrVal_715) .cse7 v_ArrVal_717) (select (select (store .cse8 .cse7 v_ArrVal_718) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_719))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_717 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_718))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_717) .cse10 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_713))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_716))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_714) .cse12 v_ArrVal_715) .cse13 v_ArrVal_717) (select (select (store .cse14 .cse13 v_ArrVal_718) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_719))))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 16))) (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_713))) (let ((.cse16 (select (select .cse21 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse20 (store .cse21 .cse16 v_ArrVal_716))) (let ((.cse17 (select (select .cse20 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse19 (store .cse20 .cse17 v_ArrVal_718))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 20 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_714) .cse16 v_ArrVal_715) .cse17 v_ArrVal_717) .cse18 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse19 .cse18 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))))) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (forall ((v_ArrVal_713 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse27 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_713))) (let ((.cse22 (select (select .cse27 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse26 (store .cse27 .cse22 v_ArrVal_716))) (let ((.cse23 (select (select .cse26 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse25 (store .cse26 .cse23 v_ArrVal_718))) (let ((.cse24 (select (select .cse25 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_714) .cse22 v_ArrVal_715) .cse23 v_ArrVal_717) .cse24 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 20) (select |c_#length| (select (select (store .cse25 .cse24 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))))) (forall ((v_ArrVal_719 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse0 4))) (forall ((v_ArrVal_717 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_717) (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_718) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (<= 0 (+ .cse0 (select (select (let ((.cse29 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_716))) (let ((.cse28 (select (select .cse29 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_715) .cse28 v_ArrVal_717) (select (select (store .cse29 .cse28 v_ArrVal_718) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_719))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12))) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse0 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_717 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_716))) (let ((.cse30 (select (select .cse33 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse32 (store .cse33 .cse30 v_ArrVal_718))) (let ((.cse31 (select (select .cse32 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ .cse0 16 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_715) .cse30 v_ArrVal_717) .cse31 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse32 .cse31 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse3))))) is different from false [2024-11-14 03:05:04,548 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 [1] [2024-11-14 03:05:06,820 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 [1] [2024-11-14 03:05:09,120 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 [1] [2024-11-14 03:05:16,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:05:16,148 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (and (<= 0 (+ .cse0 .cse1)) (forall ((v_ArrVal_717 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_718))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_717) .cse3 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))))) (forall ((v_ArrVal_719 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse0 4))) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) .cse0 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (forall ((v_ArrVal_717 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_718 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_717) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_718) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4) v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse4)))) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse2))))) is different from false [2024-11-14 03:05:26,984 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 [1] [2024-11-14 03:05:27,079 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (<= 0 (+ .cse0 .cse1)) (forall ((v_ArrVal_719 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse0 4))) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_719) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) .cse0 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_720) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (<= (+ .cse0 .cse1 4) (select |c_#length| .cse2))))) is different from false [2024-11-14 03:05:29,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:05:29,441 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2024-11-14 03:05:29,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-14 03:05:29,442 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 37 states have internal predecessors, (57), 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 03:05:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:05:29,443 INFO L225 Difference]: With dead ends: 161 [2024-11-14 03:05:29,443 INFO L226 Difference]: Without dead ends: 161 [2024-11-14 03:05:29,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=494, Invalid=3204, Unknown=116, NotChecked=1016, Total=4830 [2024-11-14 03:05:29,445 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 82 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 11 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 442 IncrementalHoareTripleChecker+Unchecked, 28.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:05:29,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 757 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 649 Invalid, 24 Unknown, 442 Unchecked, 28.4s Time] [2024-11-14 03:05:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-14 03:05:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-11-14 03:05:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 140 states have (on average 1.3928571428571428) internal successors, (195), 158 states have internal predecessors, (195), 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 03:05:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 195 transitions. [2024-11-14 03:05:29,459 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 195 transitions. Word has length 22 [2024-11-14 03:05:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:05:29,459 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 195 transitions. [2024-11-14 03:05:29,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 37 states have internal predecessors, (57), 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 03:05:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 195 transitions. [2024-11-14 03:05:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:05:29,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:05:29,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:05:29,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 03:05:29,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-14 03:05:29,661 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:05:29,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:05:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash -404100800, now seen corresponding path program 1 times [2024-11-14 03:05:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:05:29,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738495044] [2024-11-14 03:05:29,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:05:29,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:05:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:05:31,202 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 03:05:31,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:05:31,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738495044] [2024-11-14 03:05:31,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738495044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:05:31,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:05:31,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:05:31,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289355149] [2024-11-14 03:05:31,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:05:31,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:05:31,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:05:31,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:05:31,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:05:31,204 INFO L87 Difference]: Start difference. First operand 159 states and 195 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:05:34,885 INFO L93 Difference]: Finished difference Result 182 states and 206 transitions. [2024-11-14 03:05:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 03:05:34,886 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-14 03:05:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:05:34,887 INFO L225 Difference]: With dead ends: 182 [2024-11-14 03:05:34,887 INFO L226 Difference]: Without dead ends: 182 [2024-11-14 03:05:34,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2024-11-14 03:05:34,888 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 125 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:05:34,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 273 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-14 03:05:34,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-14 03:05:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 159. [2024-11-14 03:05:34,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 140 states have (on average 1.3785714285714286) internal successors, (193), 158 states have internal predecessors, (193), 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 03:05:34,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 193 transitions. [2024-11-14 03:05:34,894 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 193 transitions. Word has length 24 [2024-11-14 03:05:34,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:05:34,894 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 193 transitions. [2024-11-14 03:05:34,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:34,895 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 193 transitions. [2024-11-14 03:05:34,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:05:34,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:05:34,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:05:34,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-14 03:05:34,897 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:05:34,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:05:34,898 INFO L85 PathProgramCache]: Analyzing trace with hash -404111785, now seen corresponding path program 1 times [2024-11-14 03:05:34,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:05:34,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581898294] [2024-11-14 03:05:34,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:05:34,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:05:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:05:35,125 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 03:05:35,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:05:35,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581898294] [2024-11-14 03:05:35,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581898294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:05:35,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:05:35,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:05:35,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752647303] [2024-11-14 03:05:35,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:05:35,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:05:35,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:05:35,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:05:35,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:05:35,127 INFO L87 Difference]: Start difference. First operand 159 states and 193 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:05:35,920 INFO L93 Difference]: Finished difference Result 158 states and 190 transitions. [2024-11-14 03:05:35,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:05:35,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-14 03:05:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:05:35,922 INFO L225 Difference]: With dead ends: 158 [2024-11-14 03:05:35,922 INFO L226 Difference]: Without dead ends: 158 [2024-11-14 03:05:35,922 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 03:05:35,923 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:05:35,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 150 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:05:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-14 03:05:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2024-11-14 03:05:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 140 states have (on average 1.3571428571428572) internal successors, (190), 157 states have internal predecessors, (190), 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 03:05:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 190 transitions. [2024-11-14 03:05:35,928 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 190 transitions. Word has length 24 [2024-11-14 03:05:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:05:35,928 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 190 transitions. [2024-11-14 03:05:35,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 190 transitions. [2024-11-14 03:05:35,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:05:35,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:05:35,929 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:05:35,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-14 03:05:35,929 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:05:35,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:05:35,930 INFO L85 PathProgramCache]: Analyzing trace with hash 357436700, now seen corresponding path program 1 times [2024-11-14 03:05:35,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:05:35,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807475750] [2024-11-14 03:05:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:05:35,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:05:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:05:36,298 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 03:05:36,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:05:36,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807475750] [2024-11-14 03:05:36,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807475750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:05:36,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:05:36,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:05:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509743005] [2024-11-14 03:05:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:05:36,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:05:36,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:05:36,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:05:36,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:05:36,300 INFO L87 Difference]: Start difference. First operand 158 states and 190 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:05:37,209 INFO L93 Difference]: Finished difference Result 156 states and 184 transitions. [2024-11-14 03:05:37,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:05:37,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-14 03:05:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:05:37,211 INFO L225 Difference]: With dead ends: 156 [2024-11-14 03:05:37,211 INFO L226 Difference]: Without dead ends: 156 [2024-11-14 03:05:37,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:05:37,212 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 43 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:05:37,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 117 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 03:05:37,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-14 03:05:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-14 03:05:37,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 140 states have (on average 1.3142857142857143) internal successors, (184), 155 states have internal predecessors, (184), 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 03:05:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 184 transitions. [2024-11-14 03:05:37,217 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 184 transitions. Word has length 25 [2024-11-14 03:05:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:05:37,217 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 184 transitions. [2024-11-14 03:05:37,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:05:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 184 transitions. [2024-11-14 03:05:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:05:37,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:05:37,218 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:05:37,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-14 03:05:37,219 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:05:37,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:05:37,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1968178858, now seen corresponding path program 1 times [2024-11-14 03:05:37,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:05:37,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609440227] [2024-11-14 03:05:37,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:05:37,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:05:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:05:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:05:38,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:05:38,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609440227] [2024-11-14 03:05:38,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609440227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:05:38,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805124561] [2024-11-14 03:05:38,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:05:38,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:05:38,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:05:38,073 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:05:38,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:05:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:05:38,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-14 03:05:38,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:05:38,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:38,614 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 16 treesize of output 11 [2024-11-14 03:05:38,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:05:38,801 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 16 treesize of output 11 [2024-11-14 03:05:39,006 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-14 03:05:39,006 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2024-11-14 03:05:40,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:05:40,854 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 97 treesize of output 69 [2024-11-14 03:05:40,868 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 21 treesize of output 13 [2024-11-14 03:05:42,013 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~mem22#1.base_13| Int) (|v_ULTIMATE.start_main_~#list~0#1.base_28| Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem22#1.base_13| 0) |v_ULTIMATE.start_main_~#list~0#1.base_28| 0)) (not (= |v_ULTIMATE.start_main_#t~mem22#1.base_13| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_28| 1) |v_ULTIMATE.start_main_#t~mem22#1.base_13|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#list~0#1.base_28|) 0))) is different from true [2024-11-14 03:05:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:05:42,015 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:05:43,052 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 8 treesize of output 4 [2024-11-14 03:05:43,564 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_append_~pointerToList#1.offset| Int) (v_ArrVal_892 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| v_ArrVal_892))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= .cse0 0)))) is different from false [2024-11-14 03:05:43,809 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_append_~node~0#1.base_20| Int) (v_ArrVal_890 Int) (|ULTIMATE.start_append_~pointerToList#1.offset| Int) (v_ArrVal_892 (Array Int Int))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_append_~node~0#1.base_20| v_ArrVal_892) |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_20|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_20|) 0)) (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_20| v_ArrVal_890) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (= .cse0 0)))) is different from false [2024-11-14 03:05:43,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:05:43,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805124561] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:05:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1485697252] [2024-11-14 03:05:43,817 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 03:05:43,818 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:05:43,818 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:05:43,818 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:05:43,818 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:05:44,996 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:06:49,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1485697252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:06:49,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:06:49,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [6, 9, 10] total 43 [2024-11-14 03:06:49,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492994797] [2024-11-14 03:06:49,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:06:49,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-14 03:06:49,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:06:49,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-14 03:06:49,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=1467, Unknown=11, NotChecked=246, Total=1980 [2024-11-14 03:06:49,748 INFO L87 Difference]: Start difference. First operand 156 states and 184 transitions. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:06:55,788 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 03:07:02,353 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 03:07:04,633 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 03:07:06,836 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 03:07:10,622 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 03:07:13,060 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 03:07:18,801 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 03:07:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:07:28,854 INFO L93 Difference]: Finished difference Result 182 states and 211 transitions. [2024-11-14 03:07:28,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-14 03:07:28,854 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-14 03:07:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:07:28,855 INFO L225 Difference]: With dead ends: 182 [2024-11-14 03:07:28,855 INFO L226 Difference]: Without dead ends: 165 [2024-11-14 03:07:28,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 84.3s TimeCoverageRelationStatistics Valid=296, Invalid=1681, Unknown=15, NotChecked=264, Total=2256 [2024-11-14 03:07:28,857 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 7 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:07:28,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 158 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 612 Invalid, 7 Unknown, 0 Unchecked, 22.5s Time] [2024-11-14 03:07:28,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-14 03:07:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2024-11-14 03:07:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 148 states have (on average 1.304054054054054) internal successors, (193), 163 states have internal predecessors, (193), 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 03:07:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 193 transitions. [2024-11-14 03:07:28,862 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 193 transitions. Word has length 26 [2024-11-14 03:07:28,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:07:28,862 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 193 transitions. [2024-11-14 03:07:28,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:28,862 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 193 transitions. [2024-11-14 03:07:28,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:07:28,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:07:28,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:07:28,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:07:29,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:07:29,064 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:07:29,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:07:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash 226554849, now seen corresponding path program 1 times [2024-11-14 03:07:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:07:29,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063940247] [2024-11-14 03:07:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:07:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:07:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:07:29,656 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 03:07:29,656 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:07:29,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063940247] [2024-11-14 03:07:29,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063940247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:07:29,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:07:29,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:07:29,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791930985] [2024-11-14 03:07:29,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:07:29,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:07:29,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:07:29,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:07:29,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:07:29,658 INFO L87 Difference]: Start difference. First operand 164 states and 193 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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 03:07:30,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:07:30,450 INFO L93 Difference]: Finished difference Result 170 states and 197 transitions. [2024-11-14 03:07:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:07:30,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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 27 [2024-11-14 03:07:30,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:07:30,452 INFO L225 Difference]: With dead ends: 170 [2024-11-14 03:07:30,452 INFO L226 Difference]: Without dead ends: 170 [2024-11-14 03:07:30,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:07:30,452 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 177 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:07:30,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 70 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:07:30,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-14 03:07:30,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2024-11-14 03:07:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 152 states have (on average 1.2960526315789473) internal successors, (197), 167 states have internal predecessors, (197), 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 03:07:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 197 transitions. [2024-11-14 03:07:30,457 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 197 transitions. Word has length 27 [2024-11-14 03:07:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:07:30,458 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 197 transitions. [2024-11-14 03:07:30,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 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 03:07:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 197 transitions. [2024-11-14 03:07:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:07:30,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:07:30,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:07:30,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-14 03:07:30,459 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:07:30,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:07:30,460 INFO L85 PathProgramCache]: Analyzing trace with hash 2001743875, now seen corresponding path program 1 times [2024-11-14 03:07:30,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:07:30,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326395690] [2024-11-14 03:07:30,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:07:30,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:07:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:07:30,875 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 03:07:30,875 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:07:30,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326395690] [2024-11-14 03:07:30,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326395690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:07:30,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:07:30,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:07:30,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392289014] [2024-11-14 03:07:30,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:07:30,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:07:30,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:07:30,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:07:30,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:07:30,876 INFO L87 Difference]: Start difference. First operand 168 states and 197 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:32,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:07:32,125 INFO L93 Difference]: Finished difference Result 167 states and 195 transitions. [2024-11-14 03:07:32,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:07:32,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-14 03:07:32,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:07:32,127 INFO L225 Difference]: With dead ends: 167 [2024-11-14 03:07:32,127 INFO L226 Difference]: Without dead ends: 167 [2024-11-14 03:07:32,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:07:32,128 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:07:32,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 108 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 03:07:32,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-14 03:07:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2024-11-14 03:07:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 152 states have (on average 1.2828947368421053) internal successors, (195), 166 states have internal predecessors, (195), 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 03:07:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2024-11-14 03:07:32,139 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 29 [2024-11-14 03:07:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:07:32,139 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2024-11-14 03:07:32,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2024-11-14 03:07:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:07:32,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:07:32,141 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:07:32,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-14 03:07:32,141 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:07:32,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:07:32,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1107481786, now seen corresponding path program 1 times [2024-11-14 03:07:32,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:07:32,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503124413] [2024-11-14 03:07:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:07:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:07:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:07:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:07:33,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:07:33,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503124413] [2024-11-14 03:07:33,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503124413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:07:33,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:07:33,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-14 03:07:33,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331388630] [2024-11-14 03:07:33,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:07:33,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 03:07:33,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:07:33,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 03:07:33,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:07:33,621 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:07:35,748 INFO L93 Difference]: Finished difference Result 183 states and 207 transitions. [2024-11-14 03:07:35,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 03:07:35,749 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-14 03:07:35,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:07:35,750 INFO L225 Difference]: With dead ends: 183 [2024-11-14 03:07:35,750 INFO L226 Difference]: Without dead ends: 177 [2024-11-14 03:07:35,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-14 03:07:35,751 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 74 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:07:35,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 269 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-14 03:07:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-14 03:07:35,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 167. [2024-11-14 03:07:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 152 states have (on average 1.269736842105263) internal successors, (193), 166 states have internal predecessors, (193), 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 03:07:35,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2024-11-14 03:07:35,756 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 30 [2024-11-14 03:07:35,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:07:35,756 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2024-11-14 03:07:35,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:35,757 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2024-11-14 03:07:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 03:07:35,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:07:35,757 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:07:35,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-14 03:07:35,758 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:07:35,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:07:35,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1901988872, now seen corresponding path program 1 times [2024-11-14 03:07:35,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:07:35,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776675910] [2024-11-14 03:07:35,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:07:35,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:07:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:07:37,532 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 03:07:37,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:07:37,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776675910] [2024-11-14 03:07:37,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776675910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:07:37,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:07:37,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-14 03:07:37,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51203106] [2024-11-14 03:07:37,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:07:37,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-14 03:07:37,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:07:37,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-14 03:07:37,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-14 03:07:37,534 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:07:40,378 INFO L93 Difference]: Finished difference Result 177 states and 199 transitions. [2024-11-14 03:07:40,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 03:07:40,379 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-14 03:07:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:07:40,380 INFO L225 Difference]: With dead ends: 177 [2024-11-14 03:07:40,380 INFO L226 Difference]: Without dead ends: 177 [2024-11-14 03:07:40,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-11-14 03:07:40,380 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 66 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:07:40,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 235 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-14 03:07:40,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-14 03:07:40,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 169. [2024-11-14 03:07:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 154 states have (on average 1.2662337662337662) internal successors, (195), 168 states have internal predecessors, (195), 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 03:07:40,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2024-11-14 03:07:40,385 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 30 [2024-11-14 03:07:40,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:07:40,385 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2024-11-14 03:07:40,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:40,385 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2024-11-14 03:07:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:07:40,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:07:40,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:07:40,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-14 03:07:40,386 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:07:40,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:07:40,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1167886940, now seen corresponding path program 1 times [2024-11-14 03:07:40,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:07:40,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357541691] [2024-11-14 03:07:40,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:07:40,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:07:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:07:40,823 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 03:07:40,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:07:40,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357541691] [2024-11-14 03:07:40,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357541691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:07:40,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:07:40,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:07:40,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143245745] [2024-11-14 03:07:40,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:07:40,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:07:40,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:07:40,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:07:40,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:07:40,824 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:07:41,747 INFO L93 Difference]: Finished difference Result 180 states and 199 transitions. [2024-11-14 03:07:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:07:41,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-14 03:07:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:07:41,748 INFO L225 Difference]: With dead ends: 180 [2024-11-14 03:07:41,748 INFO L226 Difference]: Without dead ends: 180 [2024-11-14 03:07:41,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:07:41,749 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 109 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:07:41,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 111 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:07:41,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-14 03:07:41,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 166. [2024-11-14 03:07:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 151 states have (on average 1.2781456953642385) internal successors, (193), 165 states have internal predecessors, (193), 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 03:07:41,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 193 transitions. [2024-11-14 03:07:41,754 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 193 transitions. Word has length 31 [2024-11-14 03:07:41,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:07:41,754 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 193 transitions. [2024-11-14 03:07:41,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2024-11-14 03:07:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:07:41,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:07:41,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:07:41,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-14 03:07:41,755 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:07:41,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:07:41,756 INFO L85 PathProgramCache]: Analyzing trace with hash -469479610, now seen corresponding path program 1 times [2024-11-14 03:07:41,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:07:41,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119262044] [2024-11-14 03:07:41,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:07:41,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:07:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:07:43,041 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 03:07:43,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:07:43,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119262044] [2024-11-14 03:07:43,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119262044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:07:43,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:07:43,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:07:43,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926695520] [2024-11-14 03:07:43,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:07:43,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 03:07:43,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:07:43,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 03:07:43,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-14 03:07:43,042 INFO L87 Difference]: Start difference. First operand 166 states and 193 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:45,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:07:45,045 INFO L93 Difference]: Finished difference Result 167 states and 191 transitions. [2024-11-14 03:07:45,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 03:07:45,045 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-14 03:07:45,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:07:45,046 INFO L225 Difference]: With dead ends: 167 [2024-11-14 03:07:45,047 INFO L226 Difference]: Without dead ends: 167 [2024-11-14 03:07:45,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2024-11-14 03:07:45,047 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 172 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:07:45,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 101 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 03:07:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-14 03:07:45,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 160. [2024-11-14 03:07:45,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 146 states have (on average 1.2602739726027397) internal successors, (184), 159 states have internal predecessors, (184), 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 03:07:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2024-11-14 03:07:45,052 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 31 [2024-11-14 03:07:45,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:07:45,052 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2024-11-14 03:07:45,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:07:45,053 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2024-11-14 03:07:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:07:45,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:07:45,053 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:07:45,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-14 03:07:45,054 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:07:45,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:07:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash 2042660997, now seen corresponding path program 1 times [2024-11-14 03:07:45,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:07:45,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596692554] [2024-11-14 03:07:45,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:07:45,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:07:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:07:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:07:45,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:07:45,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596692554] [2024-11-14 03:07:45,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596692554] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:07:45,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368435132] [2024-11-14 03:07:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:07:45,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:07:45,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:07:45,443 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:07:45,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:07:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:07:45,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-14 03:07:45,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:07:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:07:45,790 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:07:46,438 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:07:46,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368435132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:07:46,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1114266120] [2024-11-14 03:07:46,440 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 03:07:46,440 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:07:46,440 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:07:46,440 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:07:46,440 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:07:47,339 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:08:02,885 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10579#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)) (exists ((|v_#memory_$Pointer$.base_141| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_140| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_139| (Array Int (Array Int Int))) (|v_#memory_int_110| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_134| (Array Int (Array Int Int))) (|v_ULTIMATE.start_append_~pointerToList#1.base_17| Int) (|v_#memory_$Pointer$.offset_135| (Array Int (Array Int Int)))) (and (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0))) (<= (select (select |v_#memory_int_109| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0) 2147483647) (= |v_#memory_$Pointer$.base_140| (store |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0) (store (select |v_#memory_$Pointer$.base_139| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0 (select (select |v_#memory_$Pointer$.base_140| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0)))) (= (store |v_#memory_int_109| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0) (store (select |v_#memory_int_109| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0 (select (select |v_#memory_int_110| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0))) |v_#memory_int_110|) (= (store |v_#memory_$Pointer$.offset_134| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0) (store (select |v_#memory_$Pointer$.offset_134| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0 (select (select |v_#memory_$Pointer$.offset_135| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0))) |v_#memory_$Pointer$.offset_135|) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_135| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0) (store (select |v_#memory_$Pointer$.offset_135| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_17| (store (select (store |v_#memory_$Pointer$.offset_135| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0) (store (select |v_#memory_$Pointer$.offset_135| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0 0))) (= |#memory_int| (store |v_#memory_int_110| |v_ULTIMATE.start_append_~pointerToList#1.base_17| (store (select |v_#memory_int_110| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0 (select (select |#memory_int| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 1) (<= 0 (+ (select (select |v_#memory_int_109| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0) 2147483648)) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 1) (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0))) (<= 2 |v_ULTIMATE.start_append_~pointerToList#1.base_17|) (= (store |v_#memory_int_108| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0) (store (select |v_#memory_int_108| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0 (select (select |v_#memory_int_109| (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0)) 0))) |v_#memory_int_109|) (<= 4 (select |#length| |v_ULTIMATE.start_append_~pointerToList#1.base_17|)) (= (store |v_#memory_$Pointer$.base_140| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0) (store (select |v_#memory_$Pointer$.base_140| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0 (select (select |v_#memory_$Pointer$.base_141| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0)) 0))) |v_#memory_$Pointer$.base_141|) (= (select |#valid| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 1) (= (store |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_append_~pointerToList#1.base_17| (store (select |v_#memory_$Pointer$.base_141| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_17|) 0))) |#memory_$Pointer$.base|))) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (or (< (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) 0) 4) 0) (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) 0)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) 0) 8))) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) 0) 0))))' at error location [2024-11-14 03:08:02,885 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:08:02,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:08:02,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-14 03:08:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687770358] [2024-11-14 03:08:02,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:08:02,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 03:08:02,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:08:02,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 03:08:02,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=963, Unknown=1, NotChecked=0, Total=1122 [2024-11-14 03:08:02,887 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 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 03:08:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:08:03,380 INFO L93 Difference]: Finished difference Result 164 states and 184 transitions. [2024-11-14 03:08:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:08:03,380 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 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 33 [2024-11-14 03:08:03,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:08:03,382 INFO L225 Difference]: With dead ends: 164 [2024-11-14 03:08:03,382 INFO L226 Difference]: Without dead ends: 164 [2024-11-14 03:08:03,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=158, Invalid=963, Unknown=1, NotChecked=0, Total=1122 [2024-11-14 03:08:03,383 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:08:03,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:08:03,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-14 03:08:03,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2024-11-14 03:08:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 150 states have (on average 1.2266666666666666) internal successors, (184), 163 states have internal predecessors, (184), 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 03:08:03,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 184 transitions. [2024-11-14 03:08:03,387 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 184 transitions. Word has length 33 [2024-11-14 03:08:03,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:08:03,387 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 184 transitions. [2024-11-14 03:08:03,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 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 03:08:03,387 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 184 transitions. [2024-11-14 03:08:03,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:08:03,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:08:03,388 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:08:03,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 03:08:03,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-14 03:08:03,589 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:08:03,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:08:03,589 INFO L85 PathProgramCache]: Analyzing trace with hash -151477994, now seen corresponding path program 1 times [2024-11-14 03:08:03,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:08:03,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153119243] [2024-11-14 03:08:03,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:03,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:08:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:06,965 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:08:06,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153119243] [2024-11-14 03:08:06,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153119243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:08:06,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851970761] [2024-11-14 03:08:06,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:08:06,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:08:06,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:08:06,968 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:08:06,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:08:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:08:07,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 03:08:07,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:08:07,964 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 15 treesize of output 1 [2024-11-14 03:08:08,233 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:08:08,233 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 03:08:08,863 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:08:08,864 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2024-11-14 03:08:09,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 22 [2024-11-14 03:08:09,706 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 0 case distinctions, treesize of input 39 treesize of output 19 [2024-11-14 03:08:11,074 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 25 treesize of output 17 [2024-11-14 03:08:11,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:08:11,920 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:08:11,950 INFO L349 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2024-11-14 03:08:11,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 46 [2024-11-14 03:08:12,381 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:08:12,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-14 03:08:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:08:12,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:08:13,195 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 8 treesize of output 4 [2024-11-14 03:08:17,143 INFO L349 Elim1Store]: treesize reduction 364, result has 41.6 percent of original size [2024-11-14 03:08:17,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 6955 treesize of output 3302 [2024-11-14 03:08:18,603 INFO L349 Elim1Store]: treesize reduction 169, result has 44.8 percent of original size [2024-11-14 03:08:18,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2057 treesize of output 2054 [2024-11-14 03:08:19,432 INFO L349 Elim1Store]: treesize reduction 8, result has 92.1 percent of original size [2024-11-14 03:08:19,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1989 treesize of output 1948 [2024-11-14 03:08:25,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 11 [2024-11-14 03:08:26,027 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 6 treesize of output 4 [2024-11-14 03:08:26,673 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 6 treesize of output 4 [2024-11-14 03:08:27,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:08:27,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 46 [2024-11-14 03:08:27,725 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 6 treesize of output 4 [2024-11-14 03:08:30,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:08:30,430 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 258 treesize of output 254 [2024-11-14 03:08:34,287 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:08:34,288 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 13 treesize of output 9 [2024-11-14 03:08:39,181 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:08:39,181 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 158 treesize of output 1 [2024-11-14 03:08:40,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:08:40,764 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 77 treesize of output 79 [2024-11-14 03:08:44,396 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:08:44,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1177 treesize of output 1157 [2024-11-14 03:08:55,735 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:08:55,736 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 971 treesize of output 957 [2024-11-14 03:08:58,846 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:08:59,300 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:08:59,443 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:09:09,050 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-11-14 03:09:09,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 372 treesize of output 368 [2024-11-14 03:09:09,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 357 treesize of output 347 [2024-11-14 03:09:10,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:09:10,888 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 250 treesize of output 248 [2024-11-14 03:09:11,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 197 treesize of output 185 [2024-11-14 03:09:12,795 INFO L349 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2024-11-14 03:09:12,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 407 treesize of output 399 [2024-11-14 03:09:14,010 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 03:09:14,011 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 181 treesize of output 174 [2024-11-14 03:09:15,028 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:09:15,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 289 treesize of output 281 [2024-11-14 03:09:16,402 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:09:16,719 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:09:16,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 11 [2024-11-14 03:09:17,989 INFO L349 Elim1Store]: treesize reduction 10, result has 79.6 percent of original size [2024-11-14 03:09:17,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 377 [2024-11-14 03:09:19,513 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:19,516 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:09:19,761 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-14 03:09:19,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 94 [2024-11-14 03:09:21,109 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-11-14 03:09:21,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 375 treesize of output 381 [2024-11-14 03:09:25,230 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-14 03:09:25,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 83 [2024-11-14 03:09:25,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:25,727 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:25,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:09:25,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 38 [2024-11-14 03:09:25,909 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:25,920 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:26,200 INFO L349 Elim1Store]: treesize reduction 18, result has 56.1 percent of original size [2024-11-14 03:09:26,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 294 treesize of output 286 [2024-11-14 03:09:28,122 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:28,209 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-14 03:09:28,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 354 treesize of output 1 [2024-11-14 03:09:28,270 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:09:28,516 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2024-11-14 03:09:28,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 64 [2024-11-14 03:09:32,866 INFO L349 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2024-11-14 03:09:32,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 1685 treesize of output 1623 [2024-11-14 03:09:33,585 INFO L349 Elim1Store]: treesize reduction 8, result has 89.0 percent of original size [2024-11-14 03:09:33,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 1676 treesize of output 1558 [2024-11-14 03:11:03,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:11:03,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 180 treesize of output 594 [2024-11-14 03:11:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:11:11,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851970761] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:11:11,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2000052017] [2024-11-14 03:11:11,511 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 03:11:11,511 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:11:11,512 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:11:11,512 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:11:11,512 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:11:20,796 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:12:21,240 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11166#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#valid_140| (Array Int Int)) (|v_ULTIMATE.start_main_~#list~0#1.base_30| Int)) (and (<= 2 |v_ULTIMATE.start_main_~#list~0#1.base_30|) (or (and (exists ((|v_#memory_int_128| (Array Int (Array Int Int)))) (= |#memory_int| (store |v_#memory_int_128| |v_ULTIMATE.start_main_~#list~0#1.base_30| (store (select |v_#memory_int_128| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0 (select (select |#memory_int| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0))))) (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_24| Int) (|v_ULTIMATE.start_main_#t~mem18#1.offset_23| Int) (|v_#valid_139| (Array Int Int)) (|v_#memory_$Pointer$.offset_154| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_164| (Array Int (Array Int Int)))) (and (<= 0 (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_23| 4)) (= (select |v_#valid_139| (select (select |v_#memory_$Pointer$.base_164| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0)) 1) (= (select (select |v_#memory_$Pointer$.base_164| (select (select |v_#memory_$Pointer$.base_164| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0)) 0) 0) (= (select (select |v_#memory_$Pointer$.offset_154| (select (select |v_#memory_$Pointer$.base_164| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0)) 0) 0) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_154| |v_ULTIMATE.start_main_~#list~0#1.base_30| (store (select |v_#memory_$Pointer$.offset_154| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0 (select (select |v_#memory_$Pointer$.offset_154| |v_ULTIMATE.start_main_#t~mem18#1.base_24|) (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_23| 4))))) (= (store |v_#memory_$Pointer$.base_164| |v_ULTIMATE.start_main_~#list~0#1.base_30| (store (select |v_#memory_$Pointer$.base_164| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0 (select (select |v_#memory_$Pointer$.base_164| |v_ULTIMATE.start_main_#t~mem18#1.base_24|) (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_23| 4)))) |#memory_$Pointer$.base|) (= (select |v_#valid_139| |v_ULTIMATE.start_main_#t~mem18#1.base_24|) 1) (<= (+ |v_ULTIMATE.start_main_#t~mem18#1.offset_23| 8) (select |#length| |v_ULTIMATE.start_main_#t~mem18#1.base_24|)) (= (store |v_#valid_139| (select (select |v_#memory_$Pointer$.base_164| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0) |v_#valid_140|) (= (select (select |v_#memory_$Pointer$.offset_154| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0) (<= 4 (select |#length| (select (select |v_#memory_$Pointer$.base_164| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0))) (<= (+ (select (select |v_#memory_$Pointer$.base_164| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 1) |#StackHeapBarrier|)))) (and (exists ((|v_ULTIMATE.start_create_data_#t~nondet3#1_25| Int)) (and (<= |v_ULTIMATE.start_create_data_#t~nondet3#1_25| 2147483647) (not (= |v_ULTIMATE.start_create_data_#t~nondet3#1_25| 0)) (<= 0 (+ |v_ULTIMATE.start_create_data_#t~nondet3#1_25| 2147483648)))) (exists ((|v_ULTIMATE.start_append_~pointerToList#1.base_24| Int) (|v_#memory_$Pointer$.base_161| (Array Int (Array Int Int))) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_151| (Array Int (Array Int Int)))) (and (<= 2 |v_ULTIMATE.start_append_~pointerToList#1.base_24|) (= (store |v_#memory_int_125| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0) (store (select |v_#memory_int_125| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 0 (select (select |v_#memory_int_126| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 0))) |v_#memory_int_126|) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_161| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0) (store (select |v_#memory_$Pointer$.base_161| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_24| (store (select (store |v_#memory_$Pointer$.base_161| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0) (store (select |v_#memory_$Pointer$.base_161| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_151| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0) (store (select |v_#memory_$Pointer$.offset_151| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_24| (store (select (store |v_#memory_$Pointer$.offset_151| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0) (store (select |v_#memory_$Pointer$.offset_151| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 0 0)) |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0 0))) (= |#memory_int| (store |v_#memory_int_126| |v_ULTIMATE.start_append_~pointerToList#1.base_24| (store (select |v_#memory_int_126| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0 (select (select |#memory_int| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)))) (= (select |v_#valid_140| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0)) 1) (<= 4 (select |#length| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 0))) (= (select |v_#valid_140| |v_ULTIMATE.start_append_~pointerToList#1.base_24|) 1) (<= 4 (select |#length| |v_ULTIMATE.start_append_~pointerToList#1.base_24|)))))) (= (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0) (= (store |v_#valid_140| |v_ULTIMATE.start_main_~#list~0#1.base_30| 0) |#valid|) (<= 4 (select |#length| |v_ULTIMATE.start_main_~#list~0#1.base_30|)) (= (select |v_#valid_140| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 1) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~#list~0#1.base_30|) 0) 0))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_11| (Array Int Int))) (not (= |v_ULTIMATE.start_main_old_#valid#1_11| |#valid|))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-14 03:12:21,240 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:12:21,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:12:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 41 [2024-11-14 03:12:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151703431] [2024-11-14 03:12:21,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:12:21,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-14 03:12:21,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:12:21,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-14 03:12:21,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=3859, Unknown=26, NotChecked=0, Total=4160 [2024-11-14 03:12:21,243 INFO L87 Difference]: Start difference. First operand 164 states and 184 transitions. Second operand has 42 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 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 03:12:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:12:39,077 INFO L93 Difference]: Finished difference Result 232 states and 254 transitions. [2024-11-14 03:12:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 03:12:39,078 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 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 34 [2024-11-14 03:12:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:12:39,079 INFO L225 Difference]: With dead ends: 232 [2024-11-14 03:12:39,079 INFO L226 Difference]: Without dead ends: 232 [2024-11-14 03:12:39,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2127 ImplicationChecksByTransitivity, 76.9s TimeCoverageRelationStatistics Valid=673, Invalid=6783, Unknown=26, NotChecked=0, Total=7482 [2024-11-14 03:12:39,082 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 379 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:12:39,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 895 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2024-11-14 03:12:39,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-14 03:12:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 172. [2024-11-14 03:12:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 158 states have (on average 1.2151898734177216) internal successors, (192), 171 states have internal predecessors, (192), 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 03:12:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 192 transitions. [2024-11-14 03:12:39,087 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 192 transitions. Word has length 34 [2024-11-14 03:12:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:12:39,088 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 192 transitions. [2024-11-14 03:12:39,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.1904761904761907) internal successors, (92), 41 states have internal predecessors, (92), 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 03:12:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 192 transitions. [2024-11-14 03:12:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:12:39,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:12:39,089 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:12:39,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 03:12:39,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-14 03:12:39,290 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:12:39,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:12:39,290 INFO L85 PathProgramCache]: Analyzing trace with hash -151478022, now seen corresponding path program 1 times [2024-11-14 03:12:39,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:12:39,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984446565] [2024-11-14 03:12:39,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:12:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:42,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:12:42,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:12:42,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984446565] [2024-11-14 03:12:42,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984446565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:12:42,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622065778] [2024-11-14 03:12:42,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:12:42,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:12:42,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:12:42,908 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:12:42,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:12:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:12:43,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-14 03:12:43,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:12:43,300 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 03:12:44,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:12:44,448 INFO L349 Elim1Store]: treesize reduction 64, result has 29.7 percent of original size [2024-11-14 03:12:44,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 36 [2024-11-14 03:12:45,236 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 03:12:45,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-11-14 03:12:46,352 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 0 case distinctions, treesize of input 60 treesize of output 28 [2024-11-14 03:12:47,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-14 03:12:48,580 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-14 03:12:48,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2024-11-14 03:12:48,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:12:48,938 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 31 [2024-11-14 03:12:49,434 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 36 treesize of output 16 [2024-11-14 03:12:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:12:49,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:12:50,785 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 8 treesize of output 4 [2024-11-14 03:12:57,104 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 48 treesize of output 44 [2024-11-14 03:12:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:12:59,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622065778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:12:59,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [543118273] [2024-11-14 03:12:59,692 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 03:12:59,693 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:12:59,693 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:12:59,694 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:12:59,694 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:13:05,179 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:13:54,518 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '11880#(and (exists ((|v_ULTIMATE.start_main_#t~mem18#1.base_31| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~mem18#1.base_31|) 1))) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|))' at error location [2024-11-14 03:13:54,518 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:13:54,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:13:54,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2024-11-14 03:13:54,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835837437] [2024-11-14 03:13:54,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:13:54,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-14 03:13:54,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:13:54,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-14 03:13:54,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=3950, Unknown=26, NotChecked=0, Total=4290 [2024-11-14 03:13:54,521 INFO L87 Difference]: Start difference. First operand 172 states and 192 transitions. Second operand has 45 states, 44 states have (on average 2.159090909090909) internal successors, (95), 45 states have internal predecessors, (95), 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 03:14:08,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:14:08,776 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2024-11-14 03:14:08,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-14 03:14:08,776 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.159090909090909) internal successors, (95), 45 states have internal predecessors, (95), 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 34 [2024-11-14 03:14:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:14:08,778 INFO L225 Difference]: With dead ends: 217 [2024-11-14 03:14:08,778 INFO L226 Difference]: Without dead ends: 217 [2024-11-14 03:14:08,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 68.6s TimeCoverageRelationStatistics Valid=663, Invalid=6451, Unknown=26, NotChecked=0, Total=7140 [2024-11-14 03:14:08,780 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 322 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-14 03:14:08,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 845 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2024-11-14 03:14:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-14 03:14:08,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 174. [2024-11-14 03:14:08,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 160 states have (on average 1.21875) internal successors, (195), 173 states have internal predecessors, (195), 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 03:14:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 195 transitions. [2024-11-14 03:14:08,786 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 195 transitions. Word has length 34 [2024-11-14 03:14:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:14:08,786 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 195 transitions. [2024-11-14 03:14:08,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.159090909090909) internal successors, (95), 45 states have internal predecessors, (95), 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 03:14:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 195 transitions. [2024-11-14 03:14:08,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:14:08,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:14:08,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:14:08,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 03:14:08,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-14 03:14:08,988 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:14:08,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:14:08,988 INFO L85 PathProgramCache]: Analyzing trace with hash -151478021, now seen corresponding path program 1 times [2024-11-14 03:14:08,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:14:08,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166486547] [2024-11-14 03:14:08,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:14:08,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:14:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:14:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:14:13,498 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:14:13,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166486547] [2024-11-14 03:14:13,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166486547] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:14:13,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329243505] [2024-11-14 03:14:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:14:13,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:14:13,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:14:13,501 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:14:13,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:14:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:14:13,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-14 03:14:13,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:14:13,923 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 03:14:13,982 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 03:14:14,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-14 03:14:14,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:14:15,182 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-14 03:14:15,182 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 18 treesize of output 21 [2024-11-14 03:14:15,269 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-14 03:14:15,269 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 15 treesize of output 15 [2024-11-14 03:14:16,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:14:16,126 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-14 03:14:16,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:14:16,201 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2024-11-14 03:14:16,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:14:16,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2024-11-14 03:14:16,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:14:16,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-14 03:14:17,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:14:17,375 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 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 03:14:17,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:14:17,444 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 0 case distinctions, treesize of input 60 treesize of output 28 [2024-11-14 03:14:19,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:14:19,992 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 39 [2024-11-14 03:14:20,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:14:20,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 03:14:20,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:14:20,584 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 36 treesize of output 16 [2024-11-14 03:14:20,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:14:20,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-14 03:14:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:14:20,841 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:14:23,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (and (forall ((v_ArrVal_1590 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1590))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (< 0 (+ (select (select .cse0 .cse1) 4) 5))))) (forall ((v_ArrVal_1590 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1590))) (or (not (= (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (< (+ 7 (select (select .cse2 .cse1) 4)) (select |c_#length| (select (select .cse3 .cse1) 4))))))))) is different from false [2024-11-14 03:14:23,490 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) (and (forall ((|ULTIMATE.start_append_#t~ret15#1.base| Int) (|ULTIMATE.start_append_#t~ret15#1.offset| Int) (v_ArrVal_1590 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1590))) (or (< 0 (+ 5 (select (select .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.base|)))) (store .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse1 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 4))) (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))))) (forall ((|ULTIMATE.start_append_#t~ret15#1.base| Int) (|ULTIMATE.start_append_#t~ret15#1.offset| Int) (v_ArrVal_1590 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse3 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1590))) (or (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse2 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.base|)))) (store .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (< (+ 7 (select (select .cse4 .cse5) 4)) (select |c_#length| (select (select .cse6 .cse5) 4))))) (not (= (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))))))) is different from false [2024-11-14 03:14:23,725 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_append_~node~0#1.offset| 4))) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 |c_ULTIMATE.start_append_#t~mem14#1.base|)) (.cse5 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|) .cse8 |c_ULTIMATE.start_append_#t~mem14#1.offset|))) (and (forall ((|ULTIMATE.start_append_#t~ret15#1.base| Int) (|ULTIMATE.start_append_#t~ret15#1.offset| Int) (v_ArrVal_1590 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse5 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1590))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.base|)))) (store .cse3 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse3 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (< (+ 7 (select (select .cse0 .cse1) 4)) (select |c_#length| (select (select .cse2 .cse1) 4)))))))) (forall ((|ULTIMATE.start_append_#t~ret15#1.base| Int) (|ULTIMATE.start_append_#t~ret15#1.offset| Int) (v_ArrVal_1590 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse5 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1590))) (or (< 0 (+ 5 (select (select .cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.base|)))) (store .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base| (store (select .cse7 |c_ULTIMATE.start_append_~pointerToList#1.base|) |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|)) 4))) (not (= (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)))))))) is different from false [2024-11-14 03:14:25,255 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 203 treesize of output 199 [2024-11-14 03:14:28,372 INFO L349 Elim1Store]: treesize reduction 462, result has 37.4 percent of original size [2024-11-14 03:14:28,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 16 case distinctions, treesize of input 356 treesize of output 499 [2024-11-14 03:14:28,920 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2024-11-14 03:14:28,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 579 treesize of output 576 [2024-11-14 03:14:29,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:14:29,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 245 [2024-11-14 03:14:29,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:14:29,240 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 183 treesize of output 179 [2024-11-14 03:14:29,524 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 6 treesize of output 4 [2024-11-14 03:14:29,646 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 6 treesize of output 4 [2024-11-14 03:14:30,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:14:30,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 148 [2024-11-14 03:14:31,165 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-14 03:14:31,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 43 [2024-11-14 03:14:31,976 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-14 03:14:31,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53 [2024-11-14 03:14:32,295 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:14:32,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 13 [2024-11-14 03:14:55,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:14:55,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 249 treesize of output 273 [2024-11-14 03:14:57,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:14:57,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3533 treesize of output 3377 [2024-11-14 03:15:05,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:15:05,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2656 treesize of output 2514 [2024-11-14 03:15:12,445 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:15:13,211 INFO L349 Elim1Store]: treesize reduction 117, result has 49.4 percent of original size [2024-11-14 03:15:13,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 169 [2024-11-14 03:15:13,242 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:15:13,253 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:15:13,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:15:13,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 179 [2024-11-14 03:15:13,428 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 6 treesize of output 4 [2024-11-14 03:15:13,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:15:13,765 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 18 treesize of output 22 [2024-11-14 03:15:13,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:15:13,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 64 [2024-11-14 03:15:40,718 WARN L286 SmtUtils]: Spent 8.90s on a formula simplification that was a NOOP. DAG size: 579 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-14 03:15:40,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:15:40,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 17 select indices, 17 select index equivalence classes, 0 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 1963 treesize of output 3004 [2024-11-14 03:15:41,560 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 13 [2024-11-14 03:15:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-14 03:15:42,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329243505] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:15:42,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [468313274] [2024-11-14 03:15:42,171 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 03:15:42,171 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:15:42,171 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:15:42,171 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:15:42,171 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:15:47,631 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:16:40,090 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '12576#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|))' at error location [2024-11-14 03:16:40,090 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:16:40,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:16:40,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 45 [2024-11-14 03:16:40,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210896414] [2024-11-14 03:16:40,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:16:40,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-14 03:16:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:16:40,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-14 03:16:40,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=244, Invalid=3778, Unknown=22, NotChecked=378, Total=4422 [2024-11-14 03:16:40,093 INFO L87 Difference]: Start difference. First operand 174 states and 195 transitions. Second operand has 47 states, 46 states have (on average 2.217391304347826) internal successors, (102), 46 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 03:17:03,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:17:03,977 INFO L93 Difference]: Finished difference Result 224 states and 246 transitions. [2024-11-14 03:17:03,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 03:17:03,977 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.217391304347826) internal successors, (102), 46 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 34 [2024-11-14 03:17:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:17:03,979 INFO L225 Difference]: With dead ends: 224 [2024-11-14 03:17:03,979 INFO L226 Difference]: Without dead ends: 224 [2024-11-14 03:17:03,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 87 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2236 ImplicationChecksByTransitivity, 74.0s TimeCoverageRelationStatistics Valid=677, Invalid=6623, Unknown=22, NotChecked=510, Total=7832 [2024-11-14 03:17:03,981 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 357 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 2147 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 482 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:17:03,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 1112 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2147 Invalid, 0 Unknown, 482 Unchecked, 14.9s Time] [2024-11-14 03:17:03,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-14 03:17:03,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 174. [2024-11-14 03:17:03,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 160 states have (on average 1.20625) internal successors, (193), 173 states have internal predecessors, (193), 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 03:17:03,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2024-11-14 03:17:03,986 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 34 [2024-11-14 03:17:03,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:17:03,986 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2024-11-14 03:17:03,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.217391304347826) internal successors, (102), 46 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 03:17:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2024-11-14 03:17:03,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-14 03:17:03,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:17:03,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:17:04,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-14 03:17:04,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-14 03:17:04,187 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:17:04,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:17:04,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1853441405, now seen corresponding path program 1 times [2024-11-14 03:17:04,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:17:04,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74024771] [2024-11-14 03:17:04,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:04,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:17:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:07,793 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 03:17:07,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:17:07,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74024771] [2024-11-14 03:17:07,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74024771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:17:07,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:17:07,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-14 03:17:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193249770] [2024-11-14 03:17:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:17:07,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 03:17:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:17:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 03:17:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-14 03:17:07,795 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 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 03:17:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:17:12,909 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2024-11-14 03:17:12,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 03:17:12,909 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 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 34 [2024-11-14 03:17:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:17:12,910 INFO L225 Difference]: With dead ends: 180 [2024-11-14 03:17:12,910 INFO L226 Difference]: Without dead ends: 180 [2024-11-14 03:17:12,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2024-11-14 03:17:12,911 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 99 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:17:12,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 206 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 03:17:12,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-14 03:17:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 165. [2024-11-14 03:17:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 151 states have (on average 1.205298013245033) internal successors, (182), 164 states have internal predecessors, (182), 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 03:17:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 182 transitions. [2024-11-14 03:17:12,916 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 182 transitions. Word has length 34 [2024-11-14 03:17:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:17:12,916 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 182 transitions. [2024-11-14 03:17:12,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 20 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 03:17:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2024-11-14 03:17:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 03:17:12,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:17:12,917 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:17:12,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-14 03:17:12,918 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:17:12,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:17:12,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1266938904, now seen corresponding path program 1 times [2024-11-14 03:17:12,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:17:12,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543664839] [2024-11-14 03:17:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:12,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:17:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:17:16,613 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:17:16,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543664839] [2024-11-14 03:17:16,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543664839] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:17:16,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441052644] [2024-11-14 03:17:16,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:16,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:17:16,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:17:16,615 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:17:16,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 03:17:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:16,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-14 03:17:16,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:17:16,848 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 03:17:17,178 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-14 03:17:17,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-14 03:17:18,062 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-14 03:17:18,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-14 03:17:18,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 03:17:18,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 03:17:19,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:17:19,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:17:20,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 03:17:20,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-14 03:17:20,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:17:20,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:20,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 44 [2024-11-14 03:17:20,857 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 24 treesize of output 19 [2024-11-14 03:17:24,680 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 18 treesize of output 17 [2024-11-14 03:17:25,411 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:17:25,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:17:25,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:17:25,680 INFO L349 Elim1Store]: treesize reduction 48, result has 40.7 percent of original size [2024-11-14 03:17:25,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 117 treesize of output 81 [2024-11-14 03:17:25,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:17:25,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 32 [2024-11-14 03:17:25,776 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:17:25,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:17:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:17:26,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:17:26,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441052644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:17:26,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:17:26,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [16] total 33 [2024-11-14 03:17:26,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062560873] [2024-11-14 03:17:26,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:17:26,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-14 03:17:26,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:17:26,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-14 03:17:26,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1039, Unknown=0, NotChecked=0, Total=1122 [2024-11-14 03:17:26,071 INFO L87 Difference]: Start difference. First operand 165 states and 182 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:17:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:17:33,079 INFO L93 Difference]: Finished difference Result 217 states and 237 transitions. [2024-11-14 03:17:33,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-14 03:17:33,080 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-14 03:17:33,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:17:33,081 INFO L225 Difference]: With dead ends: 217 [2024-11-14 03:17:33,081 INFO L226 Difference]: Without dead ends: 211 [2024-11-14 03:17:33,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=169, Invalid=1993, Unknown=0, NotChecked=0, Total=2162 [2024-11-14 03:17:33,082 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 105 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:17:33,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 438 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-14 03:17:33,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-14 03:17:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 165. [2024-11-14 03:17:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 151 states have (on average 1.1986754966887416) internal successors, (181), 164 states have internal predecessors, (181), 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 03:17:33,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 181 transitions. [2024-11-14 03:17:33,087 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 181 transitions. Word has length 35 [2024-11-14 03:17:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:17:33,087 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 181 transitions. [2024-11-14 03:17:33,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:17:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 181 transitions. [2024-11-14 03:17:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:17:33,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:17:33,088 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:17:33,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-14 03:17:33,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2024-11-14 03:17:33,289 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-14 03:17:33,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:17:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash 458582056, now seen corresponding path program 1 times [2024-11-14 03:17:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:17:33,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621547324] [2024-11-14 03:17:33,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:33,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:17:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:17:36,311 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:17:36,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621547324] [2024-11-14 03:17:36,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621547324] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:17:36,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824555784] [2024-11-14 03:17:36,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:17:36,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:17:36,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:17:36,314 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:17:36,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3733a994-87b3-40be-85eb-31843cbeed40/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 03:17:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:17:36,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-14 03:17:36,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:17:37,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:17:37,821 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:17:37,822 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 03:17:38,587 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:17:38,587 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2024-11-14 03:17:39,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-14 03:17:39,669 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 0 case distinctions, treesize of input 27 treesize of output 20 [2024-11-14 03:17:39,688 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 15 treesize of output 1 [2024-11-14 03:17:39,708 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 5 treesize of output 3 [2024-11-14 03:17:40,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:17:40,292 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 03:17:41,801 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 0 case distinctions, treesize of input 26 treesize of output 21 [2024-11-14 03:17:42,945 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 17 treesize of output 9 [2024-11-14 03:17:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:17:43,205 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:17:43,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:43,794 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 31 treesize of output 35 [2024-11-14 03:17:46,043 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 46 treesize of output 42 [2024-11-14 03:17:46,913 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base|))) (let ((.cse1 (forall ((v_ArrVal_1840 (Array Int Int)) (|ULTIMATE.start_append_#t~ret15#1.offset| Int) (v_arrayElimCell_316 Int)) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1840))) (or (< 0 (+ (select (select .cse6 v_arrayElimCell_316) 4) 1)) (not (= (select (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)))))) (.cse2 (= |c_ULTIMATE.start_append_~pointerToList#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_append_~pointerToList#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (or .cse0 .cse1) (or .cse2 .cse1) (forall ((v_ArrVal_1840 (Array Int Int)) (|ULTIMATE.start_append_#t~ret15#1.offset| Int)) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1840))) (or (< 0 (+ (select (select .cse3 |c_ULTIMATE.start_append_~node~0#1.base|) 4) 1)) (not (= (select (select .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)) (forall ((v_arrayElimCell_316 Int)) (<= 0 (select (select .cse3 v_arrayElimCell_316) 4)))))) (or (not .cse2) (forall ((v_ArrVal_1840 (Array Int Int)) (|ULTIMATE.start_append_#t~ret15#1.offset| Int)) (let ((.cse5 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_~node~0#1.base| (store .cse4 |c_ULTIMATE.start_append_~node~0#1.offset| |ULTIMATE.start_append_#t~ret15#1.offset|)) |c_ULTIMATE.start_append_~pointerToList#1.base| v_ArrVal_1840))) (or (< 0 (+ (select (select .cse5 |c_ULTIMATE.start_append_~node~0#1.base|) 4) 1)) (not (= (select (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))))) (not .cse0))))) is different from false [2024-11-14 03:17:51,368 INFO L349 Elim1Store]: treesize reduction 249, result has 34.6 percent of original size [2024-11-14 03:17:51,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 100 treesize of output 187 [2024-11-14 03:17:51,824 INFO L349 Elim1Store]: treesize reduction 11, result has 80.4 percent of original size [2024-11-14 03:17:51,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 344 treesize of output 328 [2024-11-14 03:17:51,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:51,903 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 62 treesize of output 64 [2024-11-14 03:17:54,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:54,472 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 131 treesize of output 135 [2024-11-14 03:17:55,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:55,103 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 110 treesize of output 104 [2024-11-14 03:17:56,553 INFO L349 Elim1Store]: treesize reduction 267, result has 29.9 percent of original size [2024-11-14 03:17:56,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 195 treesize of output 206 [2024-11-14 03:17:57,323 INFO L349 Elim1Store]: treesize reduction 88, result has 40.1 percent of original size [2024-11-14 03:17:57,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 165 [2024-11-14 03:17:57,794 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-11-14 03:17:57,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 170 treesize of output 192 [2024-11-14 03:17:57,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:57,877 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 121 treesize of output 119 [2024-11-14 03:17:58,105 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 8 treesize of output 6 [2024-11-14 03:17:58,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 34 [2024-11-14 03:17:58,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:58,846 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 23 treesize of output 27 [2024-11-14 03:17:59,315 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 6 treesize of output 4 [2024-11-14 03:17:59,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:17:59,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 111 [2024-11-14 03:18:02,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:18:02,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 111 [2024-11-14 03:18:03,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:18:03,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 111 [2024-11-14 03:18:06,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:18:06,000 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 65 treesize of output 67 [2024-11-14 03:18:06,443 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 40 treesize of output 36