./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-broom/dll-middle-data.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/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_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-broom/dll-middle-data.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/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 64bit --witnessprinter.graph.data.programhash 55fed19fd46c3c3877aeb4601619875fca08ed123cdc32456163a7ce3c0dda73 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 05:42:24,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:42:24,959 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2024-11-14 05:42:24,967 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:42:24,967 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:42:25,008 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:42:25,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:42:25,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:42:25,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:42:25,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:42:25,012 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:42:25,013 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:42:25,013 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:42:25,013 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:42:25,013 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:42:25,013 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:42:25,014 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:42:25,014 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:42:25,014 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:42:25,014 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:42:25,014 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:42:25,015 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:42:25,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 05:42:25,016 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 05:42:25,016 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:42:25,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:42:25,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:42:25,016 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 05:42:25,017 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 05:42:25,017 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 05:42:25,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:42:25,017 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 05:42:25,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:42:25,018 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:42:25,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:42:25,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:42:25,018 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:42:25,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:42:25,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:42:25,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:42:25,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:42:25,020 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:42:25,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:42:25,020 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:42:25,020 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:42:25,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:42:25,020 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_77876890-2624-49e0-ba4d-212a93858d58/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 55fed19fd46c3c3877aeb4601619875fca08ed123cdc32456163a7ce3c0dda73 [2024-11-14 05:42:25,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:42:25,371 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:42:25,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:42:25,376 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:42:25,377 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:42:25,379 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/memsafety-broom/dll-middle-data.i Unable to find full path for "g++" [2024-11-14 05:42:27,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:42:27,731 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:42:27,731 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/sv-benchmarks/c/memsafety-broom/dll-middle-data.i [2024-11-14 05:42:27,753 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/data/c81b78c23/2c7b0737a8104858b7b472417c794a73/FLAG7fe1c0614 [2024-11-14 05:42:27,769 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/data/c81b78c23/2c7b0737a8104858b7b472417c794a73 [2024-11-14 05:42:27,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:42:27,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:42:27,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:42:27,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:42:27,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:42:27,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:42:27" (1/1) ... [2024-11-14 05:42:27,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f07448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:27, skipping insertion in model container [2024-11-14 05:42:27,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:42:27" (1/1) ... [2024-11-14 05:42:27,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:42:28,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:42:28,158 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:42:28,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:42:28,240 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:42:28,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28 WrapperNode [2024-11-14 05:42:28,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:42:28,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:42:28,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:42:28,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:42:28,254 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28" (1/1) ... [2024-11-14 05:42:28,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28" (1/1) ... [2024-11-14 05:42:28,296 INFO L138 Inliner]: procedures = 121, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 77 [2024-11-14 05:42:28,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:42:28,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:42:28,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:42:28,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:42:28,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28" (1/1) ... [2024-11-14 05:42:28,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28" (1/1) ... [2024-11-14 05:42:28,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28" (1/1) ... [2024-11-14 05:42:28,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28" (1/1) ... [2024-11-14 05:42:28,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28" (1/1) ... [2024-11-14 05:42:28,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28" (1/1) ... [2024-11-14 05:42:28,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28" (1/1) ... [2024-11-14 05:42:28,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28" (1/1) ... [2024-11-14 05:42:28,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:42:28,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:42:28,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:42:28,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:42:28,340 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28" (1/1) ... [2024-11-14 05:42:28,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:42:28,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:28,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:42:28,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:42:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:42:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-14 05:42:28,397 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-14 05:42:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 05:42:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 05:42:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 05:42:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:42:28,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:42:28,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:42:28,549 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:42:28,552 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:42:28,957 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-14 05:42:28,957 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:42:29,038 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:42:29,038 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-14 05:42:29,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:42:29 BoogieIcfgContainer [2024-11-14 05:42:29,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:42:29,041 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:42:29,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:42:29,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:42:29,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:42:27" (1/3) ... [2024-11-14 05:42:29,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f788f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:42:29, skipping insertion in model container [2024-11-14 05:42:29,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:42:28" (2/3) ... [2024-11-14 05:42:29,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f788f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:42:29, skipping insertion in model container [2024-11-14 05:42:29,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:42:29" (3/3) ... [2024-11-14 05:42:29,049 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-middle-data.i [2024-11-14 05:42:29,065 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:42:29,067 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-middle-data.i that has 2 procedures, 68 locations, 1 initial locations, 3 loop locations, and 36 error locations. [2024-11-14 05:42:29,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:42:29,136 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;@465a64be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:42:29,137 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2024-11-14 05:42:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 05:42:29,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:29,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 05:42:29,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:29,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:29,157 INFO L85 PathProgramCache]: Analyzing trace with hash 5000085, now seen corresponding path program 1 times [2024-11-14 05:42:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:29,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471515443] [2024-11-14 05:42:29,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:29,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:29,382 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 05:42:29,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471515443] [2024-11-14 05:42:29,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471515443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:29,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:29,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:42:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67152655] [2024-11-14 05:42:29,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:29,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:42:29,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:29,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:42:29,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:42:29,414 INFO L87 Difference]: Start difference. First operand has 68 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:42:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:29,563 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2024-11-14 05:42:29,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:42:29,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 05:42:29,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:29,572 INFO L225 Difference]: With dead ends: 64 [2024-11-14 05:42:29,573 INFO L226 Difference]: Without dead ends: 63 [2024-11-14 05:42:29,576 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 05:42:29,581 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:29,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 67 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:42:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-14 05:42:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-14 05:42:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2024-11-14 05:42:29,640 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 4 [2024-11-14 05:42:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:29,642 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2024-11-14 05:42:29,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:42:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2024-11-14 05:42:29,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-14 05:42:29,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:29,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-14 05:42:29,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 05:42:29,644 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:29,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:29,645 INFO L85 PathProgramCache]: Analyzing trace with hash 5000086, now seen corresponding path program 1 times [2024-11-14 05:42:29,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:29,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332110112] [2024-11-14 05:42:29,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:29,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:29,787 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 05:42:29,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:29,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332110112] [2024-11-14 05:42:29,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332110112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:29,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:29,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 05:42:29,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558654743] [2024-11-14 05:42:29,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:29,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 05:42:29,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:29,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 05:42:29,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 05:42:29,791 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:42:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:29,902 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2024-11-14 05:42:29,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 05:42:29,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-14 05:42:29,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:29,903 INFO L225 Difference]: With dead ends: 59 [2024-11-14 05:42:29,903 INFO L226 Difference]: Without dead ends: 59 [2024-11-14 05:42:29,904 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 05:42:29,905 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 3 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 70 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 05:42:29,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 70 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:42:29,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-14 05:42:29,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-14 05:42:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 55 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2024-11-14 05:42:29,915 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 4 [2024-11-14 05:42:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:29,916 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2024-11-14 05:42:29,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 05:42:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2024-11-14 05:42:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:42:29,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:29,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:29,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:42:29,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:29,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:29,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1489865099, now seen corresponding path program 1 times [2024-11-14 05:42:29,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:29,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758784516] [2024-11-14 05:42:29,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:29,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:30,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 05:42:30,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:30,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758784516] [2024-11-14 05:42:30,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758784516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:30,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:30,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:42:30,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332203791] [2024-11-14 05:42:30,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:30,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:42:30,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:30,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:42:30,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:42:30,150 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:30,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:30,368 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2024-11-14 05:42:30,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:42:30,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-14 05:42:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:30,370 INFO L225 Difference]: With dead ends: 57 [2024-11-14 05:42:30,370 INFO L226 Difference]: Without dead ends: 57 [2024-11-14 05:42:30,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:42:30,371 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:30,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 81 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:42:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-14 05:42:30,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-11-14 05:42:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 49 states have internal predecessors, (52), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2024-11-14 05:42:30,385 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 10 [2024-11-14 05:42:30,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:30,385 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-11-14 05:42:30,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2024-11-14 05:42:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:42:30,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:30,386 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:30,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:42:30,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:30,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:30,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1489865098, now seen corresponding path program 1 times [2024-11-14 05:42:30,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:30,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035518548] [2024-11-14 05:42:30,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:30,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:30,746 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 05:42:30,747 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035518548] [2024-11-14 05:42:30,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035518548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:30,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:30,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:42:30,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077130208] [2024-11-14 05:42:30,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:30,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:42:30,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:30,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:42:30,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:42:30,750 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:30,934 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2024-11-14 05:42:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:42:30,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-14 05:42:30,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:30,935 INFO L225 Difference]: With dead ends: 55 [2024-11-14 05:42:30,936 INFO L226 Difference]: Without dead ends: 55 [2024-11-14 05:42:30,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:42:30,938 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 5 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:30,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 104 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:42:30,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-14 05:42:30,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2024-11-14 05:42:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 47 states have internal predecessors, (50), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-11-14 05:42:30,948 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 10 [2024-11-14 05:42:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:30,949 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-11-14 05:42:30,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:30,949 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-11-14 05:42:30,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 05:42:30,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:30,950 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:30,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:42:30,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:30,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:30,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1995985783, now seen corresponding path program 1 times [2024-11-14 05:42:30,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:30,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212116226] [2024-11-14 05:42:30,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:30,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:30,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:31,168 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 05:42:31,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:31,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212116226] [2024-11-14 05:42:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212116226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:31,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:31,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:42:31,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85180098] [2024-11-14 05:42:31,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:31,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:42:31,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:31,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:42:31,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:42:31,172 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:31,353 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2024-11-14 05:42:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:42:31,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-14 05:42:31,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:31,355 INFO L225 Difference]: With dead ends: 57 [2024-11-14 05:42:31,355 INFO L226 Difference]: Without dead ends: 57 [2024-11-14 05:42:31,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:42:31,357 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:31,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:42:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-14 05:42:31,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2024-11-14 05:42:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2024-11-14 05:42:31,370 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 16 [2024-11-14 05:42:31,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:31,370 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2024-11-14 05:42:31,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2024-11-14 05:42:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 05:42:31,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:31,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:31,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:42:31,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:31,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:31,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1995985784, now seen corresponding path program 1 times [2024-11-14 05:42:31,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:31,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427504859] [2024-11-14 05:42:31,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:31,779 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 05:42:31,780 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:31,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427504859] [2024-11-14 05:42:31,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427504859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:31,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:31,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:42:31,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953433529] [2024-11-14 05:42:31,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:31,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:42:31,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:31,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:42:31,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:42:31,783 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:31,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:31,985 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2024-11-14 05:42:31,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:42:31,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-14 05:42:31,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:31,987 INFO L225 Difference]: With dead ends: 57 [2024-11-14 05:42:31,987 INFO L226 Difference]: Without dead ends: 57 [2024-11-14 05:42:31,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:42:31,990 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:31,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 122 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:42:31,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-14 05:42:31,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2024-11-14 05:42:31,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 52 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2024-11-14 05:42:31,999 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 16 [2024-11-14 05:42:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:32,000 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2024-11-14 05:42:32,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:32,000 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2024-11-14 05:42:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-14 05:42:32,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:32,003 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 05:42:32,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:42:32,003 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:32,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:32,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1746032080, now seen corresponding path program 1 times [2024-11-14 05:42:32,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:32,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135355580] [2024-11-14 05:42:32,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:32,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:32,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 05:42:32,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:32,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135355580] [2024-11-14 05:42:32,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135355580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:32,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:32,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:42:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464868956] [2024-11-14 05:42:32,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:32,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:42:32,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:32,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:42:32,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:42:32,151 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:32,289 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2024-11-14 05:42:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:42:32,291 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-14 05:42:32,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:32,291 INFO L225 Difference]: With dead ends: 58 [2024-11-14 05:42:32,292 INFO L226 Difference]: Without dead ends: 58 [2024-11-14 05:42:32,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:42:32,292 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:32,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 177 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 05:42:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-14 05:42:32,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2024-11-14 05:42:32,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2024-11-14 05:42:32,300 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 17 [2024-11-14 05:42:32,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:32,300 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2024-11-14 05:42:32,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2024-11-14 05:42:32,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:42:32,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:32,302 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:32,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 05:42:32,302 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:32,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1708000456, now seen corresponding path program 1 times [2024-11-14 05:42:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:32,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582231276] [2024-11-14 05:42:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:33,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:33,478 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:33,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582231276] [2024-11-14 05:42:33,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582231276] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:33,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434577060] [2024-11-14 05:42:33,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:33,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:33,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:33,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:33,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:42:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:33,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 05:42:33,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:33,691 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 05:42:33,697 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 05:42:33,741 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 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 05:42:33,753 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 29 treesize of output 13 [2024-11-14 05:42:33,771 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 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-14 05:42:33,781 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 25 treesize of output 13 [2024-11-14 05:42:33,805 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 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 05:42:33,815 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 29 treesize of output 13 [2024-11-14 05:42:33,963 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 25 treesize of output 13 [2024-11-14 05:42:33,975 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 25 treesize of output 13 [2024-11-14 05:42:34,001 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 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-14 05:42:34,009 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 29 treesize of output 13 [2024-11-14 05:42:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:34,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:34,260 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_261 (Array Int Int))) (or (not (= v_ArrVal_261 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select v_ArrVal_261 .cse0)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_260 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 0) (not (= v_ArrVal_260 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select v_ArrVal_260 .cse0)))))))) is different from false [2024-11-14 05:42:34,408 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_260 (Array Int Int))) (or (not (= (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| (select v_ArrVal_260 |c_ULTIMATE.start_create_~now~0#1.offset|)) .cse0 (select v_ArrVal_260 .cse0)) v_ArrVal_260)) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_260) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_261 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 0) (not (= v_ArrVal_261 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| (select v_ArrVal_261 |c_ULTIMATE.start_create_~now~0#1.offset|)) .cse0 (select v_ArrVal_261 .cse0)))))))) is different from false [2024-11-14 05:42:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:34,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434577060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:42:34,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [399949676] [2024-11-14 05:42:35,000 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 05:42:35,001 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:42:35,004 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:42:35,009 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:42:35,009 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:42:35,978 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-14 05:42:36,024 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:42:45,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [399949676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:45,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:42:45,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [10, 9, 10] total 32 [2024-11-14 05:42:45,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37638530] [2024-11-14 05:42:45,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:45,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:42:45,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:45,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:42:45,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=768, Unknown=4, NotChecked=114, Total=992 [2024-11-14 05:42:45,884 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:48,078 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 05:42:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:51,866 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2024-11-14 05:42:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:42:51,867 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-14 05:42:51,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:51,867 INFO L225 Difference]: With dead ends: 66 [2024-11-14 05:42:51,867 INFO L226 Difference]: Without dead ends: 66 [2024-11-14 05:42:51,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=106, Invalid=768, Unknown=4, NotChecked=114, Total=992 [2024-11-14 05:42:51,869 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:51,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 611 Invalid, 2 Unknown, 0 Unchecked, 6.0s Time] [2024-11-14 05:42:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-14 05:42:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-11-14 05:42:51,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.6) internal successors, (64), 59 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2024-11-14 05:42:51,874 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 18 [2024-11-14 05:42:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:51,874 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2024-11-14 05:42:51,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2024-11-14 05:42:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:42:51,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:51,875 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 05:42:51,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:42:52,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-14 05:42:52,076 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:52,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:52,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1408391633, now seen corresponding path program 1 times [2024-11-14 05:42:52,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:52,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453107392] [2024-11-14 05:42:52,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:52,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:42:52,330 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:52,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453107392] [2024-11-14 05:42:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453107392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:52,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:52,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:42:52,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676928070] [2024-11-14 05:42:52,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:52,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:42:52,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:52,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:42:52,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:42:52,332 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:52,672 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2024-11-14 05:42:52,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:42:52,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-14 05:42:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:52,674 INFO L225 Difference]: With dead ends: 66 [2024-11-14 05:42:52,674 INFO L226 Difference]: Without dead ends: 66 [2024-11-14 05:42:52,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:42:52,675 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:52,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:42:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-14 05:42:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2024-11-14 05:42:52,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 42 states have (on average 1.5952380952380953) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2024-11-14 05:42:52,680 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 19 [2024-11-14 05:42:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:52,681 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2024-11-14 05:42:52,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:52,681 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2024-11-14 05:42:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:42:52,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:52,682 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 05:42:52,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 05:42:52,682 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:52,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:52,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1408391632, now seen corresponding path program 1 times [2024-11-14 05:42:52,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:52,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47951592] [2024-11-14 05:42:52,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:52,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:52,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:42:52,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:52,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47951592] [2024-11-14 05:42:52,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47951592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:52,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:52,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:42:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759450135] [2024-11-14 05:42:52,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:52,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:42:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:52,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:42:52,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:42:52,966 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:53,413 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2024-11-14 05:42:53,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:42:53,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-14 05:42:53,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:53,414 INFO L225 Difference]: With dead ends: 67 [2024-11-14 05:42:53,415 INFO L226 Difference]: Without dead ends: 67 [2024-11-14 05:42:53,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:42:53,415 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:53,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 115 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:42:53,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-14 05:42:53,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-11-14 05:42:53,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.558139534883721) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:53,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-11-14 05:42:53,422 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 19 [2024-11-14 05:42:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:53,422 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-11-14 05:42:53,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-11-14 05:42:53,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:42:53,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:53,423 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 05:42:53,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-14 05:42:53,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:53,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:53,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1408390286, now seen corresponding path program 1 times [2024-11-14 05:42:53,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:53,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157452903] [2024-11-14 05:42:53,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:53,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:53,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:42:53,579 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:53,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157452903] [2024-11-14 05:42:53,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157452903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:53,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:53,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:42:53,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324228940] [2024-11-14 05:42:53,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:53,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:42:53,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:53,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:42:53,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:42:53,581 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:53,881 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-14 05:42:53,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:42:53,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-14 05:42:53,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:53,883 INFO L225 Difference]: With dead ends: 72 [2024-11-14 05:42:53,883 INFO L226 Difference]: Without dead ends: 72 [2024-11-14 05:42:53,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:42:53,883 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:53,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 179 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:42:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-14 05:42:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2024-11-14 05:42:53,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2024-11-14 05:42:53,895 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 19 [2024-11-14 05:42:53,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:53,895 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2024-11-14 05:42:53,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2024-11-14 05:42:53,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:42:53,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:53,896 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:53,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:42:53,896 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:53,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:53,896 INFO L85 PathProgramCache]: Analyzing trace with hash 284275314, now seen corresponding path program 1 times [2024-11-14 05:42:53,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:53,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228206143] [2024-11-14 05:42:53,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:53,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:54,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:54,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228206143] [2024-11-14 05:42:54,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228206143] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:54,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643727746] [2024-11-14 05:42:54,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:54,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:54,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:54,215 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:54,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:42:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:54,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-14 05:42:54,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:54,385 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-14 05:42:54,473 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-14 05:42:54,474 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 19 treesize of output 16 [2024-11-14 05:42:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:54,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:42:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643727746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:42:54,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 10 [2024-11-14 05:42:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900701566] [2024-11-14 05:42:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:54,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:42:54,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:54,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:42:54,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-11-14 05:42:54,482 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:54,636 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2024-11-14 05:42:54,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 05:42:54,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-11-14 05:42:54,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:54,637 INFO L225 Difference]: With dead ends: 69 [2024-11-14 05:42:54,637 INFO L226 Difference]: Without dead ends: 69 [2024-11-14 05:42:54,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=69, Unknown=1, NotChecked=16, Total=110 [2024-11-14 05:42:54,638 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:54,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 48 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 74 Unchecked, 0.1s Time] [2024-11-14 05:42:54,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-14 05:42:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-14 05:42:54,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 45 states have (on average 1.5333333333333334) internal successors, (69), 63 states have internal predecessors, (69), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:42:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-11-14 05:42:54,642 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 21 [2024-11-14 05:42:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:54,643 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-11-14 05:42:54,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-11-14 05:42:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:42:54,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:54,644 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:54,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:42:54,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-14 05:42:54,848 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:54,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:54,848 INFO L85 PathProgramCache]: Analyzing trace with hash 284275315, now seen corresponding path program 1 times [2024-11-14 05:42:54,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:54,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640748115] [2024-11-14 05:42:54,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:54,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:55,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:55,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640748115] [2024-11-14 05:42:55,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640748115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:55,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710671620] [2024-11-14 05:42:55,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:55,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:55,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:55,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:55,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:42:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:55,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-14 05:42:55,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:55,689 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-14 05:42:55,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:42:55,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 05:42:55,772 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:42:55,772 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 05:42:55,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:55,813 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:42:55,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [710671620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:55,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:42:55,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-14 05:42:55,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412643016] [2024-11-14 05:42:55,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:55,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:42:55,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:42:55,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2024-11-14 05:42:55,815 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:56,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:56,042 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-11-14 05:42:56,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:42:56,043 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-11-14 05:42:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:56,043 INFO L225 Difference]: With dead ends: 82 [2024-11-14 05:42:56,043 INFO L226 Difference]: Without dead ends: 82 [2024-11-14 05:42:56,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2024-11-14 05:42:56,044 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 40 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:56,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 121 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2024-11-14 05:42:56,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-14 05:42:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2024-11-14 05:42:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 70 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:42:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2024-11-14 05:42:56,049 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 21 [2024-11-14 05:42:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:56,049 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-11-14 05:42:56,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:42:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2024-11-14 05:42:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:42:56,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:56,054 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 05:42:56,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 05:42:56,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-14 05:42:56,255 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:56,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash -549624045, now seen corresponding path program 1 times [2024-11-14 05:42:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:56,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885625100] [2024-11-14 05:42:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:42:56,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:56,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885625100] [2024-11-14 05:42:56,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885625100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:56,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:56,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:42:56,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306575163] [2024-11-14 05:42:56,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:56,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:42:56,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:56,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:42:56,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:42:56,448 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:56,799 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2024-11-14 05:42:56,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:42:56,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2024-11-14 05:42:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:56,800 INFO L225 Difference]: With dead ends: 80 [2024-11-14 05:42:56,800 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 05:42:56,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:42:56,801 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:56,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 158 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:42:56,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 05:42:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-11-14 05:42:56,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 55 states have (on average 1.5818181818181818) internal successors, (87), 73 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:42:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2024-11-14 05:42:56,806 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 21 [2024-11-14 05:42:56,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:56,806 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2024-11-14 05:42:56,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:42:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2024-11-14 05:42:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:42:56,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:56,807 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:56,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:42:56,807 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:56,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1689239469, now seen corresponding path program 1 times [2024-11-14 05:42:56,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:56,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497721151] [2024-11-14 05:42:56,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:56,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:56,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 05:42:56,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:56,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497721151] [2024-11-14 05:42:56,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497721151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:56,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:56,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:42:56,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064038605] [2024-11-14 05:42:56,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:56,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:42:56,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:56,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:42:56,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:42:56,996 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:42:57,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:57,336 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2024-11-14 05:42:57,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:42:57,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-14 05:42:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:57,338 INFO L225 Difference]: With dead ends: 78 [2024-11-14 05:42:57,338 INFO L226 Difference]: Without dead ends: 78 [2024-11-14 05:42:57,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:42:57,339 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:57,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 110 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:42:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-14 05:42:57,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-14 05:42:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 72 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:42:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2024-11-14 05:42:57,349 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 23 [2024-11-14 05:42:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:57,349 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2024-11-14 05:42:57,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:42:57,350 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2024-11-14 05:42:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:42:57,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:57,351 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:42:57,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 05:42:57,351 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:57,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1689239468, now seen corresponding path program 1 times [2024-11-14 05:42:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:57,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798970078] [2024-11-14 05:42:57,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:42:57,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:57,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798970078] [2024-11-14 05:42:57,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798970078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:42:57,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:42:57,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:42:57,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256685668] [2024-11-14 05:42:57,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:42:57,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:42:57,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:42:57,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:42:57,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:42:57,714 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:42:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:42:58,038 INFO L93 Difference]: Finished difference Result 77 states and 89 transitions. [2024-11-14 05:42:58,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:42:58,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-14 05:42:58,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:42:58,039 INFO L225 Difference]: With dead ends: 77 [2024-11-14 05:42:58,039 INFO L226 Difference]: Without dead ends: 77 [2024-11-14 05:42:58,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:42:58,040 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:42:58,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 115 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 05:42:58,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-14 05:42:58,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-14 05:42:58,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 55 states have (on average 1.509090909090909) internal successors, (83), 71 states have internal predecessors, (83), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:42:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2024-11-14 05:42:58,044 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 23 [2024-11-14 05:42:58,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:42:58,045 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2024-11-14 05:42:58,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:42:58,045 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2024-11-14 05:42:58,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:42:58,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:42:58,046 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] [2024-11-14 05:42:58,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 05:42:58,046 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:42:58,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:42:58,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1434453540, now seen corresponding path program 1 times [2024-11-14 05:42:58,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:42:58,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491007840] [2024-11-14 05:42:58,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:58,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:42:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:42:58,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:42:58,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491007840] [2024-11-14 05:42:58,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491007840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:42:58,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164760030] [2024-11-14 05:42:58,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:42:58,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:42:58,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:42:58,601 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:42:58,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:42:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:42:58,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-14 05:42:58,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:42:58,757 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 05:42:58,769 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 05:42:58,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:42:58,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:42:58,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:42:58,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:42:58,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:42:58,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:42:59,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:42:59,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:42:59,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:42:59,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:42:59,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:59,366 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 17 treesize of output 15 [2024-11-14 05:42:59,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:42:59,380 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 17 treesize of output 15 [2024-11-14 05:42:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:42:59,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:42:59,648 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_919 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_919) |c_ULTIMATE.start_create_~dll~0#1.base|) 4) 0) (not (= v_ArrVal_919 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select v_ArrVal_919 .cse0)))))) (forall ((v_ArrVal_918 (Array Int Int))) (or (not (= v_ArrVal_918 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse0 (select v_ArrVal_918 .cse0)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_918) |c_ULTIMATE.start_create_~dll~0#1.base|) 4) 0))))) is different from false [2024-11-14 05:42:59,744 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 20 |c_ULTIMATE.start_create_~now~0#1.offset|))) (and (forall ((v_ArrVal_918 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_918) |c_ULTIMATE.start_create_~dll~0#1.base|) 4) 0) (not (= v_ArrVal_918 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| (select v_ArrVal_918 |c_ULTIMATE.start_create_~now~0#1.offset|)) .cse0 (select v_ArrVal_918 .cse0)))))) (forall ((v_ArrVal_919 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base| v_ArrVal_919) |c_ULTIMATE.start_create_~dll~0#1.base|) 4) 0) (not (= v_ArrVal_919 (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) |c_ULTIMATE.start_create_~now~0#1.offset| (select v_ArrVal_919 |c_ULTIMATE.start_create_~now~0#1.offset|)) .cse0 (select v_ArrVal_919 .cse0)))))))) is different from false [2024-11-14 05:43:00,583 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 23 [2024-11-14 05:43:00,594 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 3410 treesize of output 3378 [2024-11-14 05:43:00,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:43:00,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164760030] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:43:00,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [427973178] [2024-11-14 05:43:00,649 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 05:43:00,650 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:43:00,650 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:43:00,650 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:43:00,650 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:43:01,501 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-14 05:43:01,535 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:43:18,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [427973178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:43:18,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:43:18,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [12, 13, 15] total 44 [2024-11-14 05:43:18,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101224073] [2024-11-14 05:43:18,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:43:18,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:43:18,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:18,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:43:18,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1577, Unknown=4, NotChecked=162, Total=1892 [2024-11-14 05:43:18,483 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:43:20,711 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 05:43:26,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:26,694 INFO L93 Difference]: Finished difference Result 83 states and 96 transitions. [2024-11-14 05:43:26,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 05:43:26,695 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-14 05:43:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:26,696 INFO L225 Difference]: With dead ends: 83 [2024-11-14 05:43:26,696 INFO L226 Difference]: Without dead ends: 83 [2024-11-14 05:43:26,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=149, Invalid=1577, Unknown=4, NotChecked=162, Total=1892 [2024-11-14 05:43:26,697 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:26,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 703 Invalid, 2 Unknown, 0 Unchecked, 8.2s Time] [2024-11-14 05:43:26,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-14 05:43:26,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-11-14 05:43:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.5) internal successors, (87), 74 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:43:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2024-11-14 05:43:26,703 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 24 [2024-11-14 05:43:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:26,703 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2024-11-14 05:43:26,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:43:26,705 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2024-11-14 05:43:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:43:26,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:26,707 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 05:43:26,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 05:43:26,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 05:43:26,908 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:43:26,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1434452193, now seen corresponding path program 1 times [2024-11-14 05:43:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:26,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620716508] [2024-11-14 05:43:26,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:26,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:43:27,173 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:27,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620716508] [2024-11-14 05:43:27,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620716508] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:27,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727857540] [2024-11-14 05:43:27,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:27,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:27,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:43:27,175 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:43:27,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:43:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:27,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-14 05:43:27,320 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:27,419 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 13 treesize of output 9 [2024-11-14 05:43:27,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:43:27,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:27,607 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret4#1.base_24| Int)) (or (= (store |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_24| 0) |c_ULTIMATE.start_main_old_#valid#1|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret4#1.base_24|) 0)))) is different from false [2024-11-14 05:43:27,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727857540] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:27,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [995282255] [2024-11-14 05:43:27,612 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 05:43:27,612 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:43:27,614 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:43:27,614 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:43:27,614 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:43:28,397 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-14 05:43:28,425 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:43:47,646 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3017#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_old_#valid#1_10| (Array Int Int))) (and (= (select |v_ULTIMATE.start_main_old_#valid#1_10| 0) 0) (not (= |v_ULTIMATE.start_main_old_#valid#1_10| |#valid|)))) (exists ((|v_#memory_$Pointer$.offset_148| (Array Int (Array Int Int))) (|v_#memory_int_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_149| (Array Int (Array Int Int))) (|v_#memory_int_109| (Array Int (Array Int Int))) (|v_#valid_101| (Array Int Int)) (|v_#length_81| (Array Int Int)) (|v_ULTIMATE.start_destroy_~l#1.base_29| Int) (|v_#memory_int_110| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_149| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_148| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_147| (Array Int (Array Int Int))) (|v_#memory_int_113| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_144| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_144| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_147| (Array Int (Array Int Int)))) (and (<= (select (select |v_#memory_int_113| |v_ULTIMATE.start_destroy_~l#1.base_29|) 0) 2147483647) (= (select |v_#valid_101| |v_ULTIMATE.start_destroy_~l#1.base_29|) 0) (= (store |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_destroy_~l#1.base_29| (store (select |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20 (select (select |v_#memory_$Pointer$.base_148| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20))) |v_#memory_$Pointer$.base_148|) (<= (+ |v_ULTIMATE.start_destroy_~l#1.base_29| 1) |#StackHeapBarrier|) (<= 0 (+ 2147483648 (select (select |#memory_int| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20))) (<= (select (select |#memory_int| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20) 2147483647) (= (store |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_destroy_~l#1.base_29| (store (store (store (select |v_#memory_$Pointer$.offset_144| |v_ULTIMATE.start_destroy_~l#1.base_29|) 4 0) 12 0) 0 (select (select |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_destroy_~l#1.base_29|) 0))) |v_#memory_$Pointer$.offset_147|) (= |v_#memory_$Pointer$.base_149| (store |v_#memory_$Pointer$.base_148| |v_ULTIMATE.start_destroy_~l#1.base_29| (store (select |v_#memory_$Pointer$.base_148| |v_ULTIMATE.start_destroy_~l#1.base_29|) 0 (select (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_destroy_~l#1.base_29|) 0)))) (<= 0 (+ (select (select |v_#memory_int_113| |v_ULTIMATE.start_destroy_~l#1.base_29|) 0) 2147483648)) (= |#memory_int| (store |v_#memory_int_113| |v_ULTIMATE.start_destroy_~l#1.base_29| (store (select |v_#memory_int_113| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20 (select (select |#memory_int| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20)))) (= (store |v_#valid_101| |v_ULTIMATE.start_destroy_~l#1.base_29| 0) |#valid|) (= (store |v_#length_81| |v_ULTIMATE.start_destroy_~l#1.base_29| 24) |#length|) (= (store |v_#memory_int_109| |v_ULTIMATE.start_destroy_~l#1.base_29| (store (select |v_#memory_int_109| |v_ULTIMATE.start_destroy_~l#1.base_29|) 12 (select (select |v_#memory_int_110| |v_ULTIMATE.start_destroy_~l#1.base_29|) 12))) |v_#memory_int_110|) (= (store |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_destroy_~l#1.base_29| (store (select |v_#memory_$Pointer$.base_149| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20))) |#memory_$Pointer$.base|) (not (= |v_ULTIMATE.start_destroy_~l#1.base_29| 0)) (= (store |v_#memory_$Pointer$.base_144| |v_ULTIMATE.start_destroy_~l#1.base_29| (store (store (store (select |v_#memory_$Pointer$.base_144| |v_ULTIMATE.start_destroy_~l#1.base_29|) 4 0) 12 0) 0 (select (select |v_#memory_$Pointer$.base_147| |v_ULTIMATE.start_destroy_~l#1.base_29|) 0))) |v_#memory_$Pointer$.base_147|) (= |v_#memory_$Pointer$.offset_149| (store |v_#memory_$Pointer$.offset_148| |v_ULTIMATE.start_destroy_~l#1.base_29| (store (select |v_#memory_$Pointer$.offset_148| |v_ULTIMATE.start_destroy_~l#1.base_29|) 0 (select (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_destroy_~l#1.base_29|) 0)))) (= (store |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_destroy_~l#1.base_29| (store (select |v_#memory_$Pointer$.offset_147| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20 (select (select |v_#memory_$Pointer$.offset_148| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20))) |v_#memory_$Pointer$.offset_148|) (= (store |v_#memory_int_110| |v_ULTIMATE.start_destroy_~l#1.base_29| (store (store (select |v_#memory_int_110| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20 0) 0 (select (select |v_#memory_int_113| |v_ULTIMATE.start_destroy_~l#1.base_29|) 0))) |v_#memory_int_113|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_destroy_~l#1.base_29| (store (select |v_#memory_$Pointer$.offset_149| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_destroy_~l#1.base_29|) 20)))) (= |v_#memory_int_109| (store |v_#memory_int_108| |v_ULTIMATE.start_destroy_~l#1.base_29| (store (select |v_#memory_int_108| |v_ULTIMATE.start_destroy_~l#1.base_29|) 4 (select (select |v_#memory_int_109| |v_ULTIMATE.start_destroy_~l#1.base_29|) 4)))))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-14 05:43:47,646 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:43:47,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:43:47,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 9 [2024-11-14 05:43:47,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621163988] [2024-11-14 05:43:47,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:43:47,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:43:47,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:47,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:43:47,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=853, Unknown=4, NotChecked=58, Total=992 [2024-11-14 05:43:47,648 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:43:48,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:48,110 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2024-11-14 05:43:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:43:48,110 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-14 05:43:48,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:48,111 INFO L225 Difference]: With dead ends: 90 [2024-11-14 05:43:48,111 INFO L226 Difference]: Without dead ends: 89 [2024-11-14 05:43:48,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=77, Invalid=853, Unknown=4, NotChecked=58, Total=992 [2024-11-14 05:43:48,113 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 5 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:48,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 178 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 05:43:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-14 05:43:48,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-14 05:43:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 79 states have internal predecessors, (92), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:43:48,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2024-11-14 05:43:48,118 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 24 [2024-11-14 05:43:48,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:48,119 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2024-11-14 05:43:48,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 05:43:48,119 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2024-11-14 05:43:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:43:48,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:48,120 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:48,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-14 05:43:48,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 05:43:48,322 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:43:48,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash 138596986, now seen corresponding path program 1 times [2024-11-14 05:43:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711379736] [2024-11-14 05:43:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:48,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:48,959 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:48,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711379736] [2024-11-14 05:43:48,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711379736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:43:48,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:43:48,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-14 05:43:48,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654952115] [2024-11-14 05:43:48,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:43:48,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:43:48,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:48,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:43:48,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-14 05:43:48,962 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 15 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:43:49,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:49,732 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2024-11-14 05:43:49,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:43:49,732 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-14 05:43:49,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:49,733 INFO L225 Difference]: With dead ends: 86 [2024-11-14 05:43:49,733 INFO L226 Difference]: Without dead ends: 86 [2024-11-14 05:43:49,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-14 05:43:49,734 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:49,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 187 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 05:43:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-14 05:43:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-11-14 05:43:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.4444444444444444) internal successors, (91), 79 states have internal predecessors, (91), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:43:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2024-11-14 05:43:49,738 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 25 [2024-11-14 05:43:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:49,738 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2024-11-14 05:43:49,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:43:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2024-11-14 05:43:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:43:49,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:49,740 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:49,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 05:43:49,740 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:43:49,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:49,740 INFO L85 PathProgramCache]: Analyzing trace with hash 138596987, now seen corresponding path program 1 times [2024-11-14 05:43:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:49,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67888894] [2024-11-14 05:43:49,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:49,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:50,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:50,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:50,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67888894] [2024-11-14 05:43:50,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67888894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:50,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594489542] [2024-11-14 05:43:50,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:50,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:50,541 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:43:50,543 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:43:50,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:43:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:50,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 05:43:50,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:50,800 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 05:43:50,979 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:43:50,979 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 05:43:51,040 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 05:43:51,054 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 05:43:51,209 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:43:51,210 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 05:43:51,223 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 05:43:51,240 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 05:43:51,247 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 05:43:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:51,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:43:51,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594489542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:43:51,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:43:51,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2024-11-14 05:43:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721245504] [2024-11-14 05:43:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:43:51,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:43:51,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:51,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:43:51,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2024-11-14 05:43:51,299 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:43:51,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:51,997 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2024-11-14 05:43:51,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 05:43:51,998 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-14 05:43:51,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:51,999 INFO L225 Difference]: With dead ends: 85 [2024-11-14 05:43:51,999 INFO L226 Difference]: Without dead ends: 85 [2024-11-14 05:43:51,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2024-11-14 05:43:52,000 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 16 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:52,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 135 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:43:52,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-14 05:43:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-14 05:43:52,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 79 states have internal predecessors, (90), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:43:52,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2024-11-14 05:43:52,004 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 25 [2024-11-14 05:43:52,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:52,004 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2024-11-14 05:43:52,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:43:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2024-11-14 05:43:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:43:52,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:52,005 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:52,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 05:43:52,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:52,210 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:43:52,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:52,210 INFO L85 PathProgramCache]: Analyzing trace with hash 47800512, now seen corresponding path program 1 times [2024-11-14 05:43:52,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:52,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446915512] [2024-11-14 05:43:52,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:52,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:52,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:52,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446915512] [2024-11-14 05:43:52,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446915512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:43:52,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:43:52,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-14 05:43:52,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259709609] [2024-11-14 05:43:52,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:43:52,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-14 05:43:52,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:52,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-14 05:43:52,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-14 05:43:52,926 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:43:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:53,835 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-11-14 05:43:53,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:43:53,835 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-14 05:43:53,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:53,836 INFO L225 Difference]: With dead ends: 86 [2024-11-14 05:43:53,836 INFO L226 Difference]: Without dead ends: 86 [2024-11-14 05:43:53,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-14 05:43:53,837 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:53,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 162 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-14 05:43:53,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-14 05:43:53,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-11-14 05:43:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.4126984126984128) internal successors, (89), 79 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:43:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2024-11-14 05:43:53,845 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 27 [2024-11-14 05:43:53,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:53,845 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2024-11-14 05:43:53,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:43:53,846 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2024-11-14 05:43:53,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:43:53,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:53,846 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:53,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-14 05:43:53,847 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:43:53,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:53,847 INFO L85 PathProgramCache]: Analyzing trace with hash 47800513, now seen corresponding path program 1 times [2024-11-14 05:43:53,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:53,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530872330] [2024-11-14 05:43:53,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:53,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:54,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:54,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530872330] [2024-11-14 05:43:54,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530872330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:54,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38436981] [2024-11-14 05:43:54,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:54,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:54,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:43:54,688 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:43:54,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:43:54,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:54,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 05:43:54,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:54,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 8 treesize of output 1 [2024-11-14 05:43:55,016 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:43:55,016 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 05:43:55,038 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 05:43:55,048 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 05:43:55,134 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:43:55,134 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 05:43:55,149 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 05:43:55,251 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:43:55,251 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 05:43:55,263 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 05:43:55,276 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 05:43:55,281 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 05:43:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:55,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:43:55,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38436981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:43:55,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:43:55,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 17 [2024-11-14 05:43:55,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531628326] [2024-11-14 05:43:55,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:43:55,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:43:55,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:43:55,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:43:55,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-11-14 05:43:55,288 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:43:55,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:43:55,895 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2024-11-14 05:43:55,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:43:55,897 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-14 05:43:55,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:43:55,898 INFO L225 Difference]: With dead ends: 85 [2024-11-14 05:43:55,898 INFO L226 Difference]: Without dead ends: 85 [2024-11-14 05:43:55,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2024-11-14 05:43:55,899 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 18 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:43:55,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 135 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:43:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-14 05:43:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-14 05:43:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 79 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:43:55,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2024-11-14 05:43:55,903 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 27 [2024-11-14 05:43:55,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:43:55,903 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-11-14 05:43:55,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:43:55,904 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2024-11-14 05:43:55,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:43:55,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:43:55,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:43:55,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 05:43:56,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-14 05:43:56,109 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:43:56,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:43:56,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1396707438, now seen corresponding path program 2 times [2024-11-14 05:43:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:43:56,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451979700] [2024-11-14 05:43:56,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:43:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:43:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:43:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:56,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:43:56,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451979700] [2024-11-14 05:43:56,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451979700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:43:56,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843808192] [2024-11-14 05:43:56,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:43:56,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:43:56,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:43:56,607 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:43:56,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:43:56,842 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:43:56,842 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:43:56,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 05:43:56,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:43:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:56,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:43:57,035 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-14 05:43:57,035 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 20 treesize of output 15 [2024-11-14 05:43:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:43:57,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843808192] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:43:57,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [301949980] [2024-11-14 05:43:57,107 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 05:43:57,108 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:43:57,108 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:43:57,108 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:43:57,108 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:43:57,836 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-14 05:43:57,869 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:44:15,835 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4325#(and (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_ULTIMATE.start_destroy_~l#1.base_35| Int) (|v_#memory_int_125| (Array Int (Array Int Int))) (|v_#memory_int_126| (Array Int (Array Int Int))) (|v_#valid_112| (Array Int Int)) (|v_#length_88| (Array Int Int)) (|v_#memory_$Pointer$.base_170| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_170| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_169| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_165| (Array Int (Array Int Int))) (|v_#memory_int_124| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_168| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_168| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_165| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_169| (Array Int (Array Int Int)))) (and (<= (+ |v_ULTIMATE.start_destroy_~l#1.base_35| 1) |#StackHeapBarrier|) (= (store |v_#length_88| |v_ULTIMATE.start_destroy_~l#1.base_35| 24) |#length|) (= |v_#memory_$Pointer$.base_170| (store |v_#memory_$Pointer$.base_169| |v_ULTIMATE.start_destroy_~l#1.base_35| (store (select |v_#memory_$Pointer$.base_169| |v_ULTIMATE.start_destroy_~l#1.base_35|) 0 (select (select |v_#memory_$Pointer$.base_170| |v_ULTIMATE.start_destroy_~l#1.base_35|) 0)))) (= (store |v_#memory_int_124| |v_ULTIMATE.start_destroy_~l#1.base_35| (store (select |v_#memory_int_124| |v_ULTIMATE.start_destroy_~l#1.base_35|) 4 (select (select |v_#memory_int_125| |v_ULTIMATE.start_destroy_~l#1.base_35|) 4))) |v_#memory_int_125|) (= (store |v_#memory_int_125| |v_ULTIMATE.start_destroy_~l#1.base_35| (store (select |v_#memory_int_125| |v_ULTIMATE.start_destroy_~l#1.base_35|) 12 (select (select |v_#memory_int_126| |v_ULTIMATE.start_destroy_~l#1.base_35|) 12))) |v_#memory_int_126|) (<= 0 (+ (select (select |v_#memory_int_129| |v_ULTIMATE.start_destroy_~l#1.base_35|) 0) 2147483648)) (= |v_#memory_$Pointer$.offset_170| (store |v_#memory_$Pointer$.offset_169| |v_ULTIMATE.start_destroy_~l#1.base_35| (store (select |v_#memory_$Pointer$.offset_169| |v_ULTIMATE.start_destroy_~l#1.base_35|) 0 (select (select |v_#memory_$Pointer$.offset_170| |v_ULTIMATE.start_destroy_~l#1.base_35|) 0)))) (= |#memory_int| (store |v_#memory_int_129| |v_ULTIMATE.start_destroy_~l#1.base_35| (store (select |v_#memory_int_129| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20 (select (select |#memory_int| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20)))) (= (store |v_#memory_int_126| |v_ULTIMATE.start_destroy_~l#1.base_35| (store (store (select |v_#memory_int_126| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20 0) 0 (select (select |v_#memory_int_129| |v_ULTIMATE.start_destroy_~l#1.base_35|) 0))) |v_#memory_int_129|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_170| |v_ULTIMATE.start_destroy_~l#1.base_35| (store (select |v_#memory_$Pointer$.offset_170| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20)))) (= |v_#memory_$Pointer$.base_169| (store |v_#memory_$Pointer$.base_168| |v_ULTIMATE.start_destroy_~l#1.base_35| (store (select |v_#memory_$Pointer$.base_168| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20 (select (select |v_#memory_$Pointer$.base_169| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20)))) (<= (select (select |#memory_int| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20) 2147483647) (not (= |v_ULTIMATE.start_destroy_~l#1.base_35| 0)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_170| |v_ULTIMATE.start_destroy_~l#1.base_35| (store (select |v_#memory_$Pointer$.base_170| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20)))) (= (store |v_#memory_$Pointer$.base_165| |v_ULTIMATE.start_destroy_~l#1.base_35| (store (store (store (select |v_#memory_$Pointer$.base_165| |v_ULTIMATE.start_destroy_~l#1.base_35|) 4 0) 12 0) 0 (select (select |v_#memory_$Pointer$.base_168| |v_ULTIMATE.start_destroy_~l#1.base_35|) 0))) |v_#memory_$Pointer$.base_168|) (= (select |v_#valid_112| |v_ULTIMATE.start_destroy_~l#1.base_35|) 0) (<= 0 (+ (select (select |#memory_int| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20) 2147483648)) (= (store |v_#valid_112| |v_ULTIMATE.start_destroy_~l#1.base_35| 0) |#valid|) (= (store |v_#memory_$Pointer$.offset_168| |v_ULTIMATE.start_destroy_~l#1.base_35| (store (select |v_#memory_$Pointer$.offset_168| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20 (select (select |v_#memory_$Pointer$.offset_169| |v_ULTIMATE.start_destroy_~l#1.base_35|) 20))) |v_#memory_$Pointer$.offset_169|) (= (store |v_#memory_$Pointer$.offset_165| |v_ULTIMATE.start_destroy_~l#1.base_35| (store (store (store (select |v_#memory_$Pointer$.offset_165| |v_ULTIMATE.start_destroy_~l#1.base_35|) 4 0) 12 0) 0 (select (select |v_#memory_$Pointer$.offset_168| |v_ULTIMATE.start_destroy_~l#1.base_35|) 0))) |v_#memory_$Pointer$.offset_168|) (<= (select (select |v_#memory_int_129| |v_ULTIMATE.start_destroy_~l#1.base_35|) 0) 2147483647))) (<= 1 |#StackHeapBarrier|) (exists ((|v_ULTIMATE.start_main_old_#valid#1_11| (Array Int Int))) (and (= (select |v_ULTIMATE.start_main_old_#valid#1_11| 0) 0) (not (= |v_ULTIMATE.start_main_old_#valid#1_11| |#valid|)))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-14 05:44:15,835 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:44:15,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:44:15,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 8] total 15 [2024-11-14 05:44:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533767101] [2024-11-14 05:44:15,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:44:15,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-14 05:44:15,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:15,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-14 05:44:15,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1090, Unknown=2, NotChecked=0, Total=1190 [2024-11-14 05:44:15,839 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:44:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:16,408 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2024-11-14 05:44:16,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 05:44:16,408 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-14 05:44:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:16,410 INFO L225 Difference]: With dead ends: 109 [2024-11-14 05:44:16,410 INFO L226 Difference]: Without dead ends: 101 [2024-11-14 05:44:16,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=114, Invalid=1290, Unknown=2, NotChecked=0, Total=1406 [2024-11-14 05:44:16,411 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 26 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:16,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 248 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 05:44:16,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-14 05:44:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-14 05:44:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.44) internal successors, (108), 91 states have internal predecessors, (108), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:44:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2024-11-14 05:44:16,415 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 29 [2024-11-14 05:44:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:16,415 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2024-11-14 05:44:16,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.142857142857143) internal successors, (44), 14 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 05:44:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2024-11-14 05:44:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:44:16,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:16,416 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:16,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-14 05:44:16,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-14 05:44:16,616 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:44:16,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1155705201, now seen corresponding path program 3 times [2024-11-14 05:44:16,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:16,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857004215] [2024-11-14 05:44:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:16,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:44:17,515 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:17,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857004215] [2024-11-14 05:44:17,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857004215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:44:17,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [559017950] [2024-11-14 05:44:17,516 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-14 05:44:17,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:44:17,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:44:17,517 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:44:17,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 05:44:17,684 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-14 05:44:17,684 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:44:17,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-14 05:44:17,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:44:17,859 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 05:44:17,921 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 29 treesize of output 13 [2024-11-14 05:44:17,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:44:18,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:44:18,091 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:44:18,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-14 05:44:18,285 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-14 05:44:18,285 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 05:44:18,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:44:18,383 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 31 treesize of output 15 [2024-11-14 05:44:19,004 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:19,004 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 25 [2024-11-14 05:44:19,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:44:19,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:44:19,276 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 1 case distinctions, treesize of input 39 treesize of output 23 [2024-11-14 05:44:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 05:44:19,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:44:20,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [559017950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:44:20,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1078645094] [2024-11-14 05:44:20,566 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 05:44:20,566 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:44:20,566 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:44:20,566 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:44:20,567 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:44:21,372 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 22 for LOIs [2024-11-14 05:44:21,408 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:44:44,750 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4759#(and (<= 1 |#StackHeapBarrier|) (exists ((|v_#valid_125| (Array Int Int)) (|v_#memory_int_148| (Array Int (Array Int Int))) (|v_#length_94| (Array Int Int)) (|v_#memory_$Pointer$.base_194| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_184| (Array Int (Array Int Int))) (|v_#memory_int_143| (Array Int (Array Int Int))) (|v_ULTIMATE.start_destroy_~l#1.base_41| Int) (|v_#memory_int_144| (Array Int (Array Int Int))) (|v_#memory_int_145| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_187| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_188| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_199| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_189| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_198| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_197| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_148| |v_ULTIMATE.start_destroy_~l#1.base_41| (store (select |v_#memory_int_148| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20 (select (select |#memory_int| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20)))) (<= (select (select |#memory_int| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20) 2147483647) (= (store |v_#memory_int_143| |v_ULTIMATE.start_destroy_~l#1.base_41| (store (select |v_#memory_int_143| |v_ULTIMATE.start_destroy_~l#1.base_41|) 4 (select (select |v_#memory_int_144| |v_ULTIMATE.start_destroy_~l#1.base_41|) 4))) |v_#memory_int_144|) (= |#length| (store |v_#length_94| |v_ULTIMATE.start_destroy_~l#1.base_41| 24)) (= (store |v_#valid_125| |v_ULTIMATE.start_destroy_~l#1.base_41| 0) |#valid|) (= |v_#memory_$Pointer$.base_199| (store |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_destroy_~l#1.base_41| (store (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_destroy_~l#1.base_41|) 0 (select (select |v_#memory_$Pointer$.base_199| |v_ULTIMATE.start_destroy_~l#1.base_41|) 0)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_189| |v_ULTIMATE.start_destroy_~l#1.base_41| (store (select |v_#memory_$Pointer$.offset_189| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20 (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20)))) (<= (+ |v_ULTIMATE.start_destroy_~l#1.base_41| 1) |#StackHeapBarrier|) (not (= |v_ULTIMATE.start_destroy_~l#1.base_41| 0)) (= (store |v_#memory_$Pointer$.base_199| |v_ULTIMATE.start_destroy_~l#1.base_41| (store (select |v_#memory_$Pointer$.base_199| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20))) |#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_194| |v_ULTIMATE.start_destroy_~l#1.base_41| (store (store (store (select |v_#memory_$Pointer$.base_194| |v_ULTIMATE.start_destroy_~l#1.base_41|) 4 0) 12 0) 0 (select (select |v_#memory_$Pointer$.base_197| |v_ULTIMATE.start_destroy_~l#1.base_41|) 0))) |v_#memory_$Pointer$.base_197|) (= |v_#memory_$Pointer$.offset_188| (store |v_#memory_$Pointer$.offset_187| |v_ULTIMATE.start_destroy_~l#1.base_41| (store (select |v_#memory_$Pointer$.offset_187| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20 (select (select |v_#memory_$Pointer$.offset_188| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20)))) (<= 0 (+ (select (select |#memory_int| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20) 2147483648)) (= (store |v_#memory_int_144| |v_ULTIMATE.start_destroy_~l#1.base_41| (store (select |v_#memory_int_144| |v_ULTIMATE.start_destroy_~l#1.base_41|) 12 (select (select |v_#memory_int_145| |v_ULTIMATE.start_destroy_~l#1.base_41|) 12))) |v_#memory_int_145|) (= (store |v_#memory_int_145| |v_ULTIMATE.start_destroy_~l#1.base_41| (store (store (select |v_#memory_int_145| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20 0) 0 (select (select |v_#memory_int_148| |v_ULTIMATE.start_destroy_~l#1.base_41|) 0))) |v_#memory_int_148|) (= (store |v_#memory_$Pointer$.base_197| |v_ULTIMATE.start_destroy_~l#1.base_41| (store (select |v_#memory_$Pointer$.base_197| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20 (select (select |v_#memory_$Pointer$.base_198| |v_ULTIMATE.start_destroy_~l#1.base_41|) 20))) |v_#memory_$Pointer$.base_198|) (<= (select (select |v_#memory_int_148| |v_ULTIMATE.start_destroy_~l#1.base_41|) 0) 2147483647) (= (select |v_#valid_125| |v_ULTIMATE.start_destroy_~l#1.base_41|) 0) (= (store |v_#memory_$Pointer$.offset_188| |v_ULTIMATE.start_destroy_~l#1.base_41| (store (select |v_#memory_$Pointer$.offset_188| |v_ULTIMATE.start_destroy_~l#1.base_41|) 0 (select (select |v_#memory_$Pointer$.offset_189| |v_ULTIMATE.start_destroy_~l#1.base_41|) 0))) |v_#memory_$Pointer$.offset_189|) (<= 0 (+ (select (select |v_#memory_int_148| |v_ULTIMATE.start_destroy_~l#1.base_41|) 0) 2147483648)) (= (store |v_#memory_$Pointer$.offset_184| |v_ULTIMATE.start_destroy_~l#1.base_41| (store (store (store (select |v_#memory_$Pointer$.offset_184| |v_ULTIMATE.start_destroy_~l#1.base_41|) 4 0) 12 0) 0 (select (select |v_#memory_$Pointer$.offset_187| |v_ULTIMATE.start_destroy_~l#1.base_41|) 0))) |v_#memory_$Pointer$.offset_187|))) (exists ((|v_ULTIMATE.start_main_old_#valid#1_12| (Array Int Int))) (and (not (= |v_ULTIMATE.start_main_old_#valid#1_12| |#valid|)) (= (select |v_ULTIMATE.start_main_old_#valid#1_12| 0) 0))) (= |ULTIMATE.start_main_#res#1| 0))' at error location [2024-11-14 05:44:44,750 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:44:44,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:44:44,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 31 [2024-11-14 05:44:44,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247008508] [2024-11-14 05:44:44,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:44:44,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 05:44:44,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:44:44,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 05:44:44,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3335, Unknown=2, NotChecked=0, Total=3540 [2024-11-14 05:44:44,753 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 31 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:44:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:44:46,530 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2024-11-14 05:44:46,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 05:44:46,531 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-14 05:44:46,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:44:46,531 INFO L225 Difference]: With dead ends: 85 [2024-11-14 05:44:46,531 INFO L226 Difference]: Without dead ends: 80 [2024-11-14 05:44:46,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=292, Invalid=4536, Unknown=2, NotChecked=0, Total=4830 [2024-11-14 05:44:46,533 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 65 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:44:46,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 385 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:44:46,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-14 05:44:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-14 05:44:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 58 states have (on average 1.5172413793103448) internal successors, (88), 74 states have internal predecessors, (88), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:44:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 94 transitions. [2024-11-14 05:44:46,538 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 94 transitions. Word has length 31 [2024-11-14 05:44:46,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:44:46,538 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 94 transitions. [2024-11-14 05:44:46,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:44:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 94 transitions. [2024-11-14 05:44:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:44:46,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:44:46,541 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:44:46,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-14 05:44:46,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-14 05:44:46,741 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:44:46,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:44:46,741 INFO L85 PathProgramCache]: Analyzing trace with hash 2136060296, now seen corresponding path program 1 times [2024-11-14 05:44:46,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:44:46,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944891575] [2024-11-14 05:44:46,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:44:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:46,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:44:46,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:44:46,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944891575] [2024-11-14 05:44:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944891575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:44:46,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697862408] [2024-11-14 05:44:46,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:44:46,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:44:46,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:44:46,889 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:44:46,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 05:44:47,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:44:47,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 05:44:47,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:44:47,193 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:44:47,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:44:47,257 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:44:47,257 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 12 treesize of output 11 [2024-11-14 05:44:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:44:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697862408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:44:47,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [148140041] [2024-11-14 05:44:47,305 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-14 05:44:47,306 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:44:47,307 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:44:47,307 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:44:47,307 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:44:58,883 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2024-11-14 05:44:58,934 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:46:57,682 WARN L286 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 269 DAG size of output: 255 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:46:57,683 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5163#(and (not (= (select |#valid| |ULTIMATE.start_loop_~l#1.base|) 1)) (exists ((|v_#memory_int_190| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_240| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~0#1.offset_58| Int) (|v_#memory_int_191| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_227| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~0#1.base_65| Int) (|v_#memory_$Pointer$.offset_228| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_238| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_237| (Array Int (Array Int Int))) (|v_#memory_int_188| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_230| (Array Int (Array Int Int))) (|v_#memory_int_189| (Array Int (Array Int Int)))) (and (<= 0 (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_230| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.offset_230| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_230| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 20) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_230| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 20))))) (<= 0 (+ (select (select |v_#memory_$Pointer$.offset_230| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 20)) (= |v_#memory_$Pointer$.offset_228| (store |v_#memory_$Pointer$.offset_227| |v_ULTIMATE.start_create_~now~0#1.base_65| (store (select |v_#memory_$Pointer$.offset_227| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|) (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))))) (<= 0 (+ (select (select |v_#memory_int_191| (select (select (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (select (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_58|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) 2147483648)) (= (select |#valid| |v_ULTIMATE.start_create_~now~0#1.base_65|) 1) (<= (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 20) (select |#length| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) 1) (= (store |v_#memory_int_190| (select (select (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_int_190| (select (select (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (select (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_58|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (select (select |v_#memory_int_191| (select (select (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (select (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_58|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))))) |v_#memory_int_191|) (= (store (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (select (select (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (select (select (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (select (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_58|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (select (select |v_#memory_$Pointer$.offset_230| (select (select (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (select (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_58|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))))) |v_#memory_$Pointer$.offset_230|) (<= (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_230| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 20)) 2147483647) (<= (+ 12 |v_ULTIMATE.start_create_~now~0#1.offset_58|) (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_65|)) (<= 0 (select (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_58|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (= |#memory_int| (store |v_#memory_int_191| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_int_191| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_230| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 20) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_230| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 20))))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_240| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_240| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_230| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 20) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_230| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 20))))) (<= (select (select |v_#memory_int_191| (select (select (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (select (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_58|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) 2147483647) (= (store |v_#memory_int_188| |v_ULTIMATE.start_create_~now~0#1.base_65| (store (select |v_#memory_int_188| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|) (select (select |v_#memory_int_189| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)))) |v_#memory_int_189|) (<= (+ (select (select |v_#memory_$Pointer$.offset_230| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 24) (select |#length| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)))) (= (store |v_#memory_int_189| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_int_189| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) (select (select |v_#memory_int_190| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12)))) |v_#memory_int_190|) (= (store |v_#memory_$Pointer$.base_237| |v_ULTIMATE.start_create_~now~0#1.base_65| (store (select |v_#memory_$Pointer$.base_237| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|) (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)))) |v_#memory_$Pointer$.base_238|) (= |v_#memory_$Pointer$.base_240| (store (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) (select (select (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) (select (select (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (select (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_58|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (select (select |v_#memory_$Pointer$.base_240| (select (select (store |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.base_238| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_65|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (select (select (store |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) (store (select |v_#memory_$Pointer$.offset_228| (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_228| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_58|)) |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)))))) (<= 0 (+ (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_240| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|))) (+ (select (select |v_#memory_$Pointer$.offset_230| |v_ULTIMATE.start_create_~now~0#1.base_65|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_58|)) 20)) 2147483648)))) (= |ULTIMATE.start_main_~l~0#1.offset| |ULTIMATE.start_loop_~l#1.offset|) (= |ULTIMATE.start_loop_~l#1.base| |ULTIMATE.start_main_~l~0#1.base|) (or (not (= |ULTIMATE.start_loop_~l#1.base| 0)) (not (= |ULTIMATE.start_loop_~node~0#1.offset| 0))) (= |ULTIMATE.start_loop_~node~0#1.offset| |ULTIMATE.start_loop_~l#1.offset|))' at error location [2024-11-14 05:46:57,683 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:46:57,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:46:57,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2024-11-14 05:46:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118941033] [2024-11-14 05:46:57,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:46:57,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:46:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:46:57,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:46:57,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=710, Unknown=27, NotChecked=0, Total=812 [2024-11-14 05:46:57,685 INFO L87 Difference]: Start difference. First operand 80 states and 94 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:46:57,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:46:57,936 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2024-11-14 05:46:57,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:46:57,937 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-14 05:46:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:46:57,938 INFO L225 Difference]: With dead ends: 86 [2024-11-14 05:46:57,938 INFO L226 Difference]: Without dead ends: 86 [2024-11-14 05:46:57,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 118.8s TimeCoverageRelationStatistics Valid=75, Invalid=710, Unknown=27, NotChecked=0, Total=812 [2024-11-14 05:46:57,939 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:46:57,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 94 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 05:46:57,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-14 05:46:57,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-11-14 05:46:57,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.507936507936508) internal successors, (95), 79 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:46:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 101 transitions. [2024-11-14 05:46:57,943 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 101 transitions. Word has length 33 [2024-11-14 05:46:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:46:57,943 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 101 transitions. [2024-11-14 05:46:57,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 05:46:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 101 transitions. [2024-11-14 05:46:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:46:57,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:46:57,944 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:46:57,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-14 05:46:58,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:46:58,149 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:46:58,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:46:58,149 INFO L85 PathProgramCache]: Analyzing trace with hash 2136060297, now seen corresponding path program 1 times [2024-11-14 05:46:58,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:46:58,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909417892] [2024-11-14 05:46:58,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:46:58,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:46:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:46:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 05:46:58,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:46:58,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909417892] [2024-11-14 05:46:58,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909417892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:46:58,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101712971] [2024-11-14 05:46:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:46:58,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:46:58,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:46:58,589 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:46:58,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 05:46:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:46:58,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-14 05:46:58,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:46:59,170 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:46:59,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:46:59,394 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:46:59,394 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 25 [2024-11-14 05:46:59,630 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 05:46:59,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101712971] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 05:46:59,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [639271983] [2024-11-14 05:46:59,632 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-14 05:46:59,632 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:46:59,633 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:46:59,633 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:46:59,633 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:47:10,615 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2024-11-14 05:47:10,655 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:48:42,210 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 264 DAG size of output: 252 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:49:00,628 WARN L286 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 269 DAG size of output: 255 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 05:49:00,629 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5566#(and (exists ((|v_#memory_$Pointer$.offset_269| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_281| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_271| (Array Int (Array Int Int))) (|v_#memory_int_231| (Array Int (Array Int Int))) (|v_#memory_int_232| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_279| (Array Int (Array Int Int))) (|v_#memory_int_233| (Array Int (Array Int Int))) (|v_#memory_int_234| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_278| (Array Int (Array Int Int))) (|v_ULTIMATE.start_create_~now~0#1.offset_64| Int) (|v_ULTIMATE.start_create_~now~0#1.base_71| Int) (|v_#memory_$Pointer$.offset_268| (Array Int (Array Int Int)))) (and (= (store (store |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (select (select (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select (store |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (select (select (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (select (select (store |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_64|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (select (select |v_#memory_$Pointer$.offset_271| (select (select (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (select (select (store |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_64|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))))) |v_#memory_$Pointer$.offset_271|) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) 1) (= (store |v_#memory_int_231| |v_ULTIMATE.start_create_~now~0#1.base_71| (store (select |v_#memory_int_231| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|) (select (select |v_#memory_int_232| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)))) |v_#memory_int_232|) (= |v_#memory_$Pointer$.base_281| (store (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) (select (select (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) (select (select (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (select (select (store |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_64|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (select (select |v_#memory_$Pointer$.base_281| (select (select (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (select (select (store |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_64|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)))))) (= |#memory_int| (store |v_#memory_int_234| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_int_234| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_271| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 20) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_271| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 20))))) (<= 0 (+ (select (select |v_#memory_int_234| (select (select (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (select (select (store |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_64|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) 2147483648)) (= (store |v_#memory_int_233| (select (select (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_int_233| (select (select (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (select (select (store |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_64|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (select (select |v_#memory_int_234| (select (select (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (select (select (store |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_64|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))))) |v_#memory_int_234|) (<= (+ 12 |v_ULTIMATE.start_create_~now~0#1.offset_64|) (select |#length| |v_ULTIMATE.start_create_~now~0#1.base_71|)) (<= 0 (select (select (store |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_64|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (<= 0 (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (= (select |#valid| |v_ULTIMATE.start_create_~now~0#1.base_71|) 1) (<= (+ (select (select |v_#memory_$Pointer$.offset_271| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 24) (select |#length| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)))) (= (store |v_#memory_$Pointer$.base_281| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_281| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_271| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 20) (select (select |#memory_$Pointer$.base| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_271| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 20)))) |#memory_$Pointer$.base|) (= |v_#memory_$Pointer$.offset_269| (store |v_#memory_$Pointer$.offset_268| |v_ULTIMATE.start_create_~now~0#1.base_71| (store (select |v_#memory_$Pointer$.offset_268| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|) (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_271| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.offset_271| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_271| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 20) (select (select |#memory_$Pointer$.offset| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_271| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 20))))) (<= (select (select |v_#memory_int_234| (select (select (store |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.base_279| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.base_71|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (select (select (store |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_$Pointer$.offset_269| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) |v_ULTIMATE.start_create_~now~0#1.offset_64|)) |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) 2147483647) (<= 0 (+ (select (select |v_#memory_$Pointer$.offset_271| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 20)) (<= 0 (+ 2147483648 (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_271| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 20)))) (= (store |v_#memory_$Pointer$.base_278| |v_ULTIMATE.start_create_~now~0#1.base_71| (store (select |v_#memory_$Pointer$.base_278| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|) (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)))) |v_#memory_$Pointer$.base_279|) (<= (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 20) (select |#length| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)))) (= (store |v_#memory_int_232| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) (store (select |v_#memory_int_232| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12) (select (select |v_#memory_int_233| (select (select |v_#memory_$Pointer$.base_279| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_269| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 12)))) |v_#memory_int_233|) (<= (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_281| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|))) (+ (select (select |v_#memory_$Pointer$.offset_271| |v_ULTIMATE.start_create_~now~0#1.base_71|) (+ 4 |v_ULTIMATE.start_create_~now~0#1.offset_64|)) 20)) 2147483647))) (= |ULTIMATE.start_main_~l~0#1.offset| |ULTIMATE.start_loop_~l#1.offset|) (= |ULTIMATE.start_loop_~l#1.base| |ULTIMATE.start_main_~l~0#1.base|) (or (not (= |ULTIMATE.start_loop_~l#1.base| 0)) (not (= |ULTIMATE.start_loop_~l#1.offset| 0))) (or (< (+ |ULTIMATE.start_loop_~l#1.offset| 4) 0) (< (select |#length| |ULTIMATE.start_loop_~l#1.base|) (+ 12 |ULTIMATE.start_loop_~l#1.offset|))))' at error location [2024-11-14 05:49:00,629 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:49:00,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 05:49:00,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 16 [2024-11-14 05:49:00,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843684187] [2024-11-14 05:49:00,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 05:49:00,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 05:49:00,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:49:00,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 05:49:00,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1402, Unknown=23, NotChecked=0, Total=1560 [2024-11-14 05:49:00,633 INFO L87 Difference]: Start difference. First operand 85 states and 101 transitions. Second operand has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-14 05:49:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:49:01,512 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2024-11-14 05:49:01,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:49:01,513 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2024-11-14 05:49:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:49:01,514 INFO L225 Difference]: With dead ends: 86 [2024-11-14 05:49:01,514 INFO L226 Difference]: Without dead ends: 86 [2024-11-14 05:49:01,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 110.5s TimeCoverageRelationStatistics Valid=135, Invalid=1402, Unknown=23, NotChecked=0, Total=1560 [2024-11-14 05:49:01,515 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:49:01,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 287 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-14 05:49:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-14 05:49:01,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-11-14 05:49:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.492063492063492) internal successors, (94), 79 states have internal predecessors, (94), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:49:01,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2024-11-14 05:49:01,519 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 33 [2024-11-14 05:49:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:49:01,520 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2024-11-14 05:49:01,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.333333333333333) internal successors, (65), 16 states have internal predecessors, (65), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-14 05:49:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2024-11-14 05:49:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 05:49:01,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:49:01,521 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-14 05:49:01,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 05:49:01,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:49:01,721 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:49:01,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:49:01,722 INFO L85 PathProgramCache]: Analyzing trace with hash -240379639, now seen corresponding path program 1 times [2024-11-14 05:49:01,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:49:01,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309638656] [2024-11-14 05:49:01,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:01,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:49:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:49:03,491 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 05:49:03,491 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:49:03,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309638656] [2024-11-14 05:49:03,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309638656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:49:03,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322709955] [2024-11-14 05:49:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:49:03,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:49:03,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:49:03,494 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:49:03,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 05:49:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:49:03,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 05:49:03,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:49:04,002 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:49:04,002 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 05:49:04,117 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 05:49:04,367 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:49:04,367 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 31 treesize of output 32 [2024-11-14 05:49:04,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:49:04,611 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 31 treesize of output 32 [2024-11-14 05:49:04,770 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:49:04,770 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 05:49:05,021 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 05:49:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:49:05,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:49:05,273 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-14 05:49:05,273 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 05:49:05,396 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int))) (= |c_ULTIMATE.start_create_#t~mem12#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2216) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)))) is different from false [2024-11-14 05:49:05,409 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2216) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))))) is different from false [2024-11-14 05:49:05,423 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2215))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4)))) (= (select (select (store .cse0 .cse1 v_ArrVal_2216) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) .cse1)))) is different from false [2024-11-14 05:49:05,629 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2214 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2214))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2215)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2216) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) .cse1))))) is different from false [2024-11-14 05:49:05,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2216 (Array Int Int)) (v_ArrVal_2215 (Array Int Int)) (v_ArrVal_2214 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2214))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2215)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2216) |c_ULTIMATE.start_create_~dll~0#1.base|) (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))))))) is different from false [2024-11-14 05:49:05,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:49:05,659 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 129 treesize of output 80 [2024-11-14 05:49:05,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:49:05,696 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 10904 treesize of output 8941 [2024-11-14 05:49:05,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:49:05,862 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 1116 treesize of output 996 [2024-11-14 05:49:05,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:49:05,901 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 988 treesize of output 628 [2024-11-14 05:49:05,915 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 620 treesize of output 552 [2024-11-14 05:49:07,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322709955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:49:07,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [516127910] [2024-11-14 05:49:07,327 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-14 05:49:07,327 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:49:07,328 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:49:07,328 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:49:07,328 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:49:16,381 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2024-11-14 05:49:16,424 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:51:13,866 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5948#(exists ((|v_ULTIMATE.start_loop_~node~0#1.base_61| Int)) (and (or (not (= |ULTIMATE.start_loop_~node~0#1.offset| 0)) (not (= |v_ULTIMATE.start_loop_~node~0#1.base_61| 0))) (not (= (select |#valid| |v_ULTIMATE.start_loop_~node~0#1.base_61|) 1))))' at error location [2024-11-14 05:51:13,867 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:51:13,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:51:13,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14] total 28 [2024-11-14 05:51:13,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766649480] [2024-11-14 05:51:13,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:51:13,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-14 05:51:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:51:13,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-14 05:51:13,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2720, Unknown=63, NotChecked=550, Total=3540 [2024-11-14 05:51:13,870 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand has 29 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:51:16,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:51:16,977 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2024-11-14 05:51:16,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:51:16,977 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2024-11-14 05:51:16,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:51:16,978 INFO L225 Difference]: With dead ends: 88 [2024-11-14 05:51:16,978 INFO L226 Difference]: Without dead ends: 88 [2024-11-14 05:51:16,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 121.0s TimeCoverageRelationStatistics Valid=309, Invalid=3673, Unknown=70, NotChecked=640, Total=4692 [2024-11-14 05:51:16,980 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:51:16,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 458 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 05:51:16,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-14 05:51:16,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-14 05:51:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 81 states have internal predecessors, (98), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:51:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2024-11-14 05:51:16,985 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 35 [2024-11-14 05:51:16,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:51:16,985 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2024-11-14 05:51:16,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:51:16,986 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2024-11-14 05:51:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 05:51:16,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:51:16,986 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2024-11-14 05:51:17,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 05:51:17,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:51:17,187 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:51:17,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:51:17,187 INFO L85 PathProgramCache]: Analyzing trace with hash -240379638, now seen corresponding path program 1 times [2024-11-14 05:51:17,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:51:17,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741331979] [2024-11-14 05:51:17,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:17,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:51:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:20,040 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 05:51:20,040 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:51:20,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741331979] [2024-11-14 05:51:20,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741331979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:51:20,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155332477] [2024-11-14 05:51:20,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:51:20,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:51:20,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:51:20,043 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:51:20,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 05:51:20,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:51:20,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-14 05:51:20,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:51:20,914 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 05:51:21,192 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:51:21,193 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 05:51:21,342 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 05:51:21,360 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 05:51:21,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:51:21,718 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 39 [2024-11-14 05:51:21,734 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 05:51:22,266 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-14 05:51:22,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 64 [2024-11-14 05:51:22,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 05:51:22,288 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 05:51:22,520 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:51:22,521 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 05:51:22,533 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 05:51:22,931 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 05:51:22,938 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 05:51:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:51:22,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:51:23,451 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2401 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2401) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2402) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0)))) (forall ((v_ArrVal_2401 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2401) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse0) 4))))) is different from false [2024-11-14 05:51:23,801 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (and (forall ((v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2400) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2399) |c_ULTIMATE.start_create_~now~0#1.base|) .cse0) v_ArrVal_2401) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2399))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem10#1.base| v_ArrVal_2400) .cse2 v_ArrVal_2401) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2402) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse1)))))))) is different from false [2024-11-14 05:51:23,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse4)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2399))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2400) .cse1 v_ArrVal_2401) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2402) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)))))) (forall ((v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2400) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2399) |c_ULTIMATE.start_create_~now~0#1.base|) .cse4) v_ArrVal_2401) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2) 4)))))) is different from false [2024-11-14 05:51:23,916 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem9#1.base|) (+ |c_ULTIMATE.start_create_#t~mem9#1.offset| 12) |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse2 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (select (select .cse1 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (and (forall ((v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2397 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2397) .cse0 v_ArrVal_2400) (select (select (store .cse1 .cse0 v_ArrVal_2399) |c_ULTIMATE.start_create_~now~0#1.base|) .cse2) v_ArrVal_2401) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)))) (forall ((v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2397 (Array Int Int))) (let ((.cse5 (store .cse1 .cse0 v_ArrVal_2399))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| v_ArrVal_2397) .cse0 v_ArrVal_2400) .cse4 v_ArrVal_2401) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_2402) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3))))))))) is different from false [2024-11-14 05:51:24,007 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse5)) (.cse7 (select |c_#memory_$Pointer$.base| .cse0)) (.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (forall ((v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2397 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 (store .cse7 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|) |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse1 v_ArrVal_2399))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2397) .cse1 v_ArrVal_2400) .cse2 v_ArrVal_2401) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 12) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2402) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)))))))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| .cse8))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_34| Int)) (or (< |v_ULTIMATE.start_create_#t~mem9#1.offset_34| .cse8) (forall ((v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2400 (Array Int Int)) (v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2397 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse0 (store .cse7 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_34|) |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_~now~0#1.base|) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2397) .cse9 v_ArrVal_2400) (select (select (store .cse10 .cse9 v_ArrVal_2399) |c_ULTIMATE.start_create_~now~0#1.base|) .cse5) v_ArrVal_2401))) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4))))))))) is different from false [2024-11-14 05:51:24,034 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:24,034 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 296 treesize of output 297 [2024-11-14 05:51:24,151 INFO L349 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2024-11-14 05:51:24,152 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 2 case distinctions, treesize of input 1503 treesize of output 1439 [2024-11-14 05:51:24,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:24,235 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 14750 treesize of output 14359 [2024-11-14 05:51:24,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:24,378 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 1045 treesize of output 1019 [2024-11-14 05:51:24,415 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 204 treesize of output 200 [2024-11-14 05:51:24,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:24,497 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 503 treesize of output 463 [2024-11-14 05:51:24,550 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 455 treesize of output 439 [2024-11-14 05:51:24,579 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 439 treesize of output 407 [2024-11-14 05:51:24,608 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 407 treesize of output 375 [2024-11-14 05:51:25,199 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 4 [2024-11-14 05:51:25,280 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:25,280 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 35 treesize of output 35 [2024-11-14 05:51:25,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:25,348 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 141 treesize of output 142 [2024-11-14 05:51:25,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:51:25,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:51:25,364 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 05:51:25,369 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:51:25,373 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 05:51:25,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:51:25,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:51:25,385 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-14 05:51:25,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155332477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:51:25,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [295591987] [2024-11-14 05:51:25,863 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-14 05:51:25,863 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:51:25,863 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:51:25,863 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:51:25,863 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:51:37,066 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2024-11-14 05:51:37,116 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:53:00,688 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6163#true' at error location [2024-11-14 05:53:00,688 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:53:00,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:53:00,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2024-11-14 05:53:00,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13545430] [2024-11-14 05:53:00,689 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:53:00,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 05:53:00,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:53:00,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 05:53:00,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=3378, Unknown=53, NotChecked=610, Total=4290 [2024-11-14 05:53:00,692 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 34 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:53:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:53:10,766 INFO L93 Difference]: Finished difference Result 88 states and 105 transitions. [2024-11-14 05:53:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:53:10,767 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 35 [2024-11-14 05:53:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:53:10,768 INFO L225 Difference]: With dead ends: 88 [2024-11-14 05:53:10,768 INFO L226 Difference]: Without dead ends: 88 [2024-11-14 05:53:10,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 95.7s TimeCoverageRelationStatistics Valid=375, Invalid=4553, Unknown=62, NotChecked=710, Total=5700 [2024-11-14 05:53:10,770 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 10 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-14 05:53:10,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 363 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-14 05:53:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-14 05:53:10,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2024-11-14 05:53:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 81 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:53:10,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2024-11-14 05:53:10,774 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 35 [2024-11-14 05:53:10,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:53:10,775 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2024-11-14 05:53:10,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 05:53:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2024-11-14 05:53:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 05:53:10,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:53:10,775 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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 05:53:10,794 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 05:53:10,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-14 05:53:10,976 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:53:10,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:53:10,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1138180734, now seen corresponding path program 1 times [2024-11-14 05:53:10,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:53:10,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172131436] [2024-11-14 05:53:10,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:53:10,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:53:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:53:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-14 05:53:11,246 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:53:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172131436] [2024-11-14 05:53:11,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172131436] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:53:11,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799036239] [2024-11-14 05:53:11,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:53:11,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:53:11,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:53:11,250 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:53:11,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 05:53:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:53:11,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 05:53:11,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:53:11,870 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:53:11,870 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 05:53:11,996 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 19 treesize of output 1 [2024-11-14 05:53:12,234 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:53:12,234 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 41 treesize of output 40 [2024-11-14 05:53:12,446 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:53:12,446 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 41 treesize of output 40 [2024-11-14 05:53:12,619 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-14 05:53:12,619 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 41 treesize of output 40 [2024-11-14 05:53:12,877 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 30 treesize of output 12 [2024-11-14 05:53:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:53:12,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:53:14,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:53:14,158 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 60 [2024-11-14 05:53:14,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:53:14,193 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 8739 treesize of output 7244 [2024-11-14 05:53:14,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:53:14,299 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 626 treesize of output 587 [2024-11-14 05:53:14,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:53:14,341 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 578 treesize of output 467 [2024-11-14 05:53:14,354 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 458 treesize of output 430 [2024-11-14 05:53:15,103 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 05:53:15,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 12 treesize of output 11 [2024-11-14 05:53:15,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799036239] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:53:15,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1756071844] [2024-11-14 05:53:15,309 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-14 05:53:15,310 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:53:15,310 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 05:53:15,310 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 05:53:15,310 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 05:53:28,156 INFO L197 IcfgInterpreter]: Interpreting procedure alloc_and_zero with input of size 24 for LOIs [2024-11-14 05:53:28,234 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 05:55:22,482 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6760#(exists ((|v_ULTIMATE.start_destroy_~l#1.base_45| Int)) (and (or (not (= |ULTIMATE.start_destroy_~l#1.offset| 0)) (not (= |v_ULTIMATE.start_destroy_~l#1.base_45| 0))) (not (= (select |#valid| |v_ULTIMATE.start_destroy_~l#1.base_45|) 1))))' at error location [2024-11-14 05:55:22,482 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 05:55:22,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:55:22,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15] total 20 [2024-11-14 05:55:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573627661] [2024-11-14 05:55:22,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:55:22,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-14 05:55:22,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:55:22,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-14 05:55:22,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=2413, Unknown=91, NotChecked=0, Total=2756 [2024-11-14 05:55:22,485 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:55:23,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:55:23,797 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2024-11-14 05:55:23,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 05:55:23,797 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 36 [2024-11-14 05:55:23,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:55:23,798 INFO L225 Difference]: With dead ends: 94 [2024-11-14 05:55:23,798 INFO L226 Difference]: Without dead ends: 94 [2024-11-14 05:55:23,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 116.4s TimeCoverageRelationStatistics Valid=270, Invalid=2500, Unknown=92, NotChecked=0, Total=2862 [2024-11-14 05:55:23,800 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:55:23,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 208 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-14 05:55:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-14 05:55:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2024-11-14 05:55:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 85 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:55:23,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2024-11-14 05:55:23,808 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 36 [2024-11-14 05:55:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:55:23,809 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2024-11-14 05:55:23,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 18 states have internal predecessors, (53), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 05:55:23,809 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2024-11-14 05:55:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 05:55:23,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:55:23,809 INFO L215 NwaCegarLoop]: trace histogram [3, 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, 1, 1] [2024-11-14 05:55:23,827 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 05:55:24,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-14 05:55:24,010 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 33 more)] === [2024-11-14 05:55:24,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:55:24,010 INFO L85 PathProgramCache]: Analyzing trace with hash 923444298, now seen corresponding path program 2 times [2024-11-14 05:55:24,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:55:24,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459261503] [2024-11-14 05:55:24,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:55:24,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:55:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:55:28,795 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:55:28,796 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:55:28,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459261503] [2024-11-14 05:55:28,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459261503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:55:28,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603039989] [2024-11-14 05:55:28,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 05:55:28,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:55:28,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:55:28,798 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:55:28,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_77876890-2624-49e0-ba4d-212a93858d58/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-14 05:55:30,585 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 05:55:30,585 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 05:55:30,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 105 conjuncts are in the unsatisfiable core [2024-11-14 05:55:30,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:55:30,604 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 05:55:31,292 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 05:55:31,307 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 05:55:31,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:55:31,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:55:31,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:55:31,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:55:31,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:55:31,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 05:55:31,730 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 05:55:31,730 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 05:55:31,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2024-11-14 05:55:31,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 05:55:32,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:55:32,199 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:55:32,199 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 73 treesize of output 54 [2024-11-14 05:55:32,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:55:32,219 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 40 treesize of output 38 [2024-11-14 05:55:32,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:55:32,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:55:32,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:55:32,769 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:55:32,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 79 [2024-11-14 05:55:32,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:55:32,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:55:32,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:55:32,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 41 [2024-11-14 05:55:33,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:55:33,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:55:33,306 INFO L349 Elim1Store]: treesize reduction 31, result has 32.6 percent of original size [2024-11-14 05:55:33,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 93 [2024-11-14 05:55:33,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:55:33,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:55:33,413 INFO L349 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2024-11-14 05:55:33,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 47 [2024-11-14 05:55:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 05:55:34,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:55:34,798 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem12#1.base|)) (.cse3 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem12#1.base|)) (.cse2 (+ 20 |c_ULTIMATE.start_create_#t~mem12#1.offset|))) (and (forall ((v_ArrVal_2785 (Array Int Int))) (or (forall ((v_ArrVal_2787 Int)) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2785))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem12#1.base| (store .cse1 .cse2 v_ArrVal_2787)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3)) (+ (select (select .cse0 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4))) 0)) (not (= v_ArrVal_2785 (store .cse4 .cse2 (select v_ArrVal_2785 .cse2)))))) (forall ((v_ArrVal_2785 (Array Int Int))) (or (forall ((v_ArrVal_2787 Int)) (= (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem12#1.base| (store .cse1 .cse2 v_ArrVal_2787)))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2785) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse3) 4)) 0)) (not (= v_ArrVal_2785 (store .cse4 .cse2 (select v_ArrVal_2785 .cse2)))))))) is different from false [2024-11-14 05:55:34,869 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| .cse5)) (.cse6 (select |c_#memory_$Pointer$.base| .cse5)) (.cse4 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse9))) (and (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_44| Int)) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_44| .cse0) (forall ((v_ArrVal_2785 (Array Int Int))) (let ((.cse2 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_44| 20))) (or (not (= (store .cse1 .cse2 (select v_ArrVal_2785 .cse2)) v_ArrVal_2785)) (forall ((v_ArrVal_2787 Int)) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse2 v_ArrVal_2787)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2785) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4)) 0))))))) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_44| Int)) (or (forall ((v_ArrVal_2785 (Array Int Int))) (let ((.cse7 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_44| 20))) (or (not (= (store .cse1 .cse7 (select v_ArrVal_2785 .cse7)) v_ArrVal_2785)) (forall ((v_ArrVal_2787 Int)) (= (let ((.cse8 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2785))) (select (select .cse8 (select (select (store |c_#memory_$Pointer$.base| .cse5 (store .cse6 .cse7 v_ArrVal_2787)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4)) (+ (select (select .cse8 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4) 4))) 0))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_44| .cse0))))))) is different from false [2024-11-14 05:55:36,210 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (let ((.cse1 (select |c_#memory_$Pointer$.offset| .cse9)) (.cse5 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse10 (select |c_#memory_$Pointer$.base| .cse9)) (.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (and (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_44| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_44|) (forall ((v_ArrVal_2784 (Array Int Int))) (or (not (= (store .cse1 |v_ULTIMATE.start_create_#t~mem10#1.offset_44| (select v_ArrVal_2784 |v_ULTIMATE.start_create_#t~mem10#1.offset_44|)) v_ArrVal_2784)) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_44| Int) (v_ArrVal_2783 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_2784))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_44| (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3)) (forall ((v_ArrVal_2785 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_44| v_ArrVal_2783)))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3)) (.cse8 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_44| 20))) (or (forall ((v_ArrVal_2787 Int)) (= (select (let ((.cse4 (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_ArrVal_2787)))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5))) (+ (select (select (store .cse2 .cse7 v_ArrVal_2785) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4)) 0)) (not (= (store (select .cse2 .cse7) .cse8 (select v_ArrVal_2785 .cse8)) v_ArrVal_2785))))))))))))) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_44| Int)) (or (forall ((v_ArrVal_2784 (Array Int Int))) (or (not (= (store .cse1 |v_ULTIMATE.start_create_#t~mem10#1.offset_44| (select v_ArrVal_2784 |v_ULTIMATE.start_create_#t~mem10#1.offset_44|)) v_ArrVal_2784)) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_44| Int) (v_ArrVal_2783 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_2784))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_44| (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3)) (forall ((v_ArrVal_2785 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse9 (store .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_44| v_ArrVal_2783)))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3)) (.cse15 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_44| 20))) (or (forall ((v_ArrVal_2787 Int)) (= (let ((.cse12 (store .cse11 .cse14 v_ArrVal_2785))) (select (select .cse12 (select (select (store .cse13 .cse14 (store (select .cse13 .cse14) .cse15 v_ArrVal_2787)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5)) (+ (select (select .cse12 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse5) 4))) 0)) (not (= (store (select .cse11 .cse14) .cse15 (select v_ArrVal_2785 .cse15)) v_ArrVal_2785))))))))))) (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_44|))))))) is different from false [2024-11-14 05:55:36,484 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse18 (+ |c_ULTIMATE.start_create_#t~mem9#1.offset| 12))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_#t~mem9#1.base|) .cse18 |c_ULTIMATE.start_create_~now~0#1.base|))) (.cse7 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_#t~mem9#1.base|) .cse18 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (let ((.cse0 (select (select .cse11 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse12 (select .cse11 .cse9)) (.cse2 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse10 (select .cse8 .cse9))) (and (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_44| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_44|) (forall ((v_ArrVal_2784 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_44| Int) (v_ArrVal_2783 Int)) (let ((.cse6 (store .cse11 .cse9 v_ArrVal_2784))) (or (forall ((v_ArrVal_2785 (Array Int Int))) (let ((.cse3 (store .cse8 .cse9 (store .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_44| v_ArrVal_2783)))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse5 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_44| 20))) (or (forall ((v_ArrVal_2787 Int)) (= (select (let ((.cse1 (store .cse3 .cse4 (store (select .cse3 .cse4) .cse5 v_ArrVal_2787)))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) (+ 4 (select (select (store .cse6 .cse4 v_ArrVal_2785) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2))) 0)) (not (= v_ArrVal_2785 (store (select .cse6 .cse4) .cse5 (select v_ArrVal_2785 .cse5)))))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_44| (select (select .cse6 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7))))) (not (= (store .cse12 |v_ULTIMATE.start_create_#t~mem10#1.offset_44| (select v_ArrVal_2784 |v_ULTIMATE.start_create_#t~mem10#1.offset_44|)) v_ArrVal_2784)))))) (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_44| Int)) (or (< .cse0 |v_ULTIMATE.start_create_#t~mem10#1.offset_44|) (forall ((v_ArrVal_2784 (Array Int Int))) (or (not (= (store .cse12 |v_ULTIMATE.start_create_#t~mem10#1.offset_44| (select v_ArrVal_2784 |v_ULTIMATE.start_create_#t~mem10#1.offset_44|)) v_ArrVal_2784)) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_44| Int) (v_ArrVal_2783 Int)) (let ((.cse17 (store .cse11 .cse9 v_ArrVal_2784))) (or (forall ((v_ArrVal_2785 (Array Int Int))) (let ((.cse14 (store .cse8 .cse9 (store .cse10 |v_ULTIMATE.start_create_#t~mem10#1.offset_44| v_ArrVal_2783)))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)) (.cse16 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_44| 20))) (or (forall ((v_ArrVal_2787 Int)) (= 0 (let ((.cse13 (store .cse17 .cse15 v_ArrVal_2785))) (select (select .cse13 (select (select (store .cse14 .cse15 (store (select .cse14 .cse15) .cse16 v_ArrVal_2787)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)) (+ 4 (select (select .cse13 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse2)))))) (not (= v_ArrVal_2785 (store (select .cse17 .cse15) .cse16 (select v_ArrVal_2785 .cse16)))))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_44| (select (select .cse17 |c_ULTIMATE.start_create_~now~0#1.base|) .cse7)))))))))))))) is different from false [2024-11-14 05:55:38,796 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (let ((.cse7 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse11 (select |c_#memory_$Pointer$.base| .cse10)) (.cse13 (select |c_#memory_$Pointer$.offset| .cse10)) (.cse14 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_43| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_44| Int)) (let ((.cse12 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_43|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse13 .cse12 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (forall ((v_ArrVal_2784 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse10 (store .cse11 .cse12 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse1 (select (select .cse9 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (or (not (= v_ArrVal_2784 (store (select .cse0 .cse1) |v_ULTIMATE.start_create_#t~mem10#1.offset_44| (select v_ArrVal_2784 |v_ULTIMATE.start_create_#t~mem10#1.offset_44|)))) (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_44| Int) (v_ArrVal_2783 Int)) (let ((.cse2 (store .cse0 .cse1 v_ArrVal_2784))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_44| (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3)) (forall ((v_ArrVal_2785 (Array Int Int))) (let ((.cse8 (store .cse9 .cse1 (store (select .cse9 .cse1) |v_ULTIMATE.start_create_#t~mem10#1.offset_44| v_ArrVal_2783)))) (let ((.cse5 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_44| 20)) (.cse4 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (or (not (= (store (select .cse2 .cse4) .cse5 (select v_ArrVal_2785 .cse5)) v_ArrVal_2785)) (forall ((v_ArrVal_2787 Int)) (= (select (let ((.cse6 (store .cse8 .cse4 (store (select .cse8 .cse4) .cse5 v_ArrVal_2787)))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7))) (+ (select (select (store .cse2 .cse4 v_ArrVal_2785) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7) 4)) 0))))))))))))) (< (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) |v_ULTIMATE.start_create_#t~mem10#1.offset_44|))))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_43| .cse14))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_43| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_44| Int)) (let ((.cse23 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_43|))) (let ((.cse15 (store |c_#memory_$Pointer$.offset| .cse10 (store .cse13 .cse23 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (< (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3) |v_ULTIMATE.start_create_#t~mem10#1.offset_44|) (forall ((v_ArrVal_2784 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| .cse10 (store .cse11 .cse23 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_44| Int) (v_ArrVal_2783 Int)) (let ((.cse16 (store .cse15 .cse22 v_ArrVal_2784))) (or (forall ((v_ArrVal_2785 (Array Int Int))) (let ((.cse20 (store .cse21 .cse22 (store (select .cse21 .cse22) |v_ULTIMATE.start_create_#t~mem10#1.offset_44| v_ArrVal_2783)))) (let ((.cse18 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_44| 20)) (.cse17 (select (select .cse20 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))) (or (not (= (store (select .cse16 .cse17) .cse18 (select v_ArrVal_2785 .cse18)) v_ArrVal_2785)) (forall ((v_ArrVal_2787 Int)) (= (let ((.cse19 (store .cse16 .cse17 v_ArrVal_2785))) (select (select .cse19 (select (select (store .cse20 .cse17 (store (select .cse20 .cse17) .cse18 v_ArrVal_2787)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7)) (+ (select (select .cse19 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse7) 4))) 0)))))) (< |v_ULTIMATE.start_create_#t~mem12#1.offset_44| (select (select .cse16 |c_ULTIMATE.start_create_~now~0#1.base|) .cse3))))) (not (= v_ArrVal_2784 (store (select .cse15 .cse22) |v_ULTIMATE.start_create_#t~mem10#1.offset_44| (select v_ArrVal_2784 |v_ULTIMATE.start_create_#t~mem10#1.offset_44|)))))))))))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_43| .cse14))))))) is different from false [2024-11-14 05:55:41,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_~now~0#1.offset| 4))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_#t~ret8#1.offset|))) (.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_~now~0#1.base|) .cse1 |c_ULTIMATE.start_create_#t~ret8#1.base|)))) (let ((.cse4 (+ |c_ULTIMATE.start_create_~dll~0#1.offset| 4)) (.cse11 (select .cse10 |c_ULTIMATE.start_create_#t~ret8#1.base|)) (.cse14 (select .cse13 |c_ULTIMATE.start_create_#t~ret8#1.base|))) (and (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_43| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_44| Int)) (let ((.cse12 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_43|))) (let ((.cse0 (store .cse13 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse14 .cse12 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (< (select (select .cse0 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) |v_ULTIMATE.start_create_#t~mem10#1.offset_44|) (forall ((v_ArrVal_2784 (Array Int Int))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse11 .cse12 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_44| Int) (v_ArrVal_2783 Int)) (let ((.cse2 (store .cse0 .cse9 v_ArrVal_2784))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_44| (select (select .cse2 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_2785 (Array Int Int))) (let ((.cse5 (store .cse8 .cse9 (store (select .cse8 .cse9) |v_ULTIMATE.start_create_#t~mem10#1.offset_44| v_ArrVal_2783)))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse7 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_44| 20))) (or (forall ((v_ArrVal_2787 Int)) (= (select (let ((.cse3 (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_2787)))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) (+ 4 (select (select (store .cse2 .cse6 v_ArrVal_2785) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4))) 0)) (not (= v_ArrVal_2785 (store (select .cse2 .cse6) .cse7 (select v_ArrVal_2785 .cse7))))))))))) (not (= (store (select .cse0 .cse9) |v_ULTIMATE.start_create_#t~mem10#1.offset_44| (select v_ArrVal_2784 |v_ULTIMATE.start_create_#t~mem10#1.offset_44|)) v_ArrVal_2784)))))))))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_43| |c_ULTIMATE.start_create_#t~ret8#1.offset|))) (forall ((|v_ULTIMATE.start_create_#t~mem9#1.offset_43| Int)) (or (forall ((|v_ULTIMATE.start_create_#t~mem10#1.offset_44| Int)) (let ((.cse23 (+ 12 |v_ULTIMATE.start_create_#t~mem9#1.offset_43|))) (let ((.cse15 (store .cse13 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse14 .cse23 |c_ULTIMATE.start_create_~now~0#1.offset|)))) (or (< (select (select .cse15 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1) |v_ULTIMATE.start_create_#t~mem10#1.offset_44|) (forall ((v_ArrVal_2784 (Array Int Int))) (let ((.cse21 (store .cse10 |c_ULTIMATE.start_create_#t~ret8#1.base| (store .cse11 .cse23 |c_ULTIMATE.start_create_~now~0#1.base|)))) (let ((.cse22 (select (select .cse21 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1))) (or (forall ((|v_ULTIMATE.start_create_#t~mem12#1.offset_44| Int) (v_ArrVal_2783 Int)) (let ((.cse16 (store .cse15 .cse22 v_ArrVal_2784))) (or (< |v_ULTIMATE.start_create_#t~mem12#1.offset_44| (select (select .cse16 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (forall ((v_ArrVal_2785 (Array Int Int))) (let ((.cse18 (store .cse21 .cse22 (store (select .cse21 .cse22) |v_ULTIMATE.start_create_#t~mem10#1.offset_44| v_ArrVal_2783)))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_create_~now~0#1.base|) .cse1)) (.cse20 (+ |v_ULTIMATE.start_create_#t~mem12#1.offset_44| 20))) (or (forall ((v_ArrVal_2787 Int)) (= (let ((.cse17 (store .cse16 .cse19 v_ArrVal_2785))) (select (select .cse17 (select (select (store .cse18 .cse19 (store (select .cse18 .cse19) .cse20 v_ArrVal_2787)) |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4)) (+ 4 (select (select .cse17 |c_ULTIMATE.start_create_~dll~0#1.base|) .cse4)))) 0)) (not (= v_ArrVal_2785 (store (select .cse16 .cse19) .cse20 (select v_ArrVal_2785 .cse20))))))))))) (not (= (store (select .cse15 .cse22) |v_ULTIMATE.start_create_#t~mem10#1.offset_44| (select v_ArrVal_2784 |v_ULTIMATE.start_create_#t~mem10#1.offset_44|)) v_ArrVal_2784)))))))))) (< |v_ULTIMATE.start_create_#t~mem9#1.offset_43| |c_ULTIMATE.start_create_#t~ret8#1.offset|))))))) is different from false