./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/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_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/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-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 04:42:25,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 04:42:25,701 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2024-11-14 04:42:25,709 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 04:42:25,710 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 04:42:25,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 04:42:25,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 04:42:25,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 04:42:25,746 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 04:42:25,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 04:42:25,747 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 04:42:25,747 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 04:42:25,747 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 04:42:25,747 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 04:42:25,747 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 04:42:25,747 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 04:42:25,747 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 04:42:25,747 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 04:42:25,749 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 04:42:25,749 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 04:42:25,749 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 04:42:25,749 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 04:42:25,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 04:42:25,750 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 04:42:25,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 04:42:25,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 04:42:25,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 04:42:25,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 04:42:25,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 04:42:25,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 04:42:25,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 04:42:25,750 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 04:42:25,750 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 04:42:25,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 04:42:25,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 04:42:25,751 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 04:42:25,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 04:42:25,751 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 04:42:25,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 04:42:25,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 04:42:25,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 04:42:25,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 04:42:25,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 04:42:25,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 04:42:25,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:42:25,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 04:42:25,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 04:42:25,751 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 04:42:25,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 04:42:25,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 04:42:25,752 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 04:42:25,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 04:42:25,752 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_6d9d9675-ea11-4a1f-bc46-942784b85ab1/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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ccd4b93de7420a1f7847638daedeeee3b82eb082e434a23182d7e5e0aee2085 [2024-11-14 04:42:26,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 04:42:26,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 04:42:26,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 04:42:26,054 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 04:42:26,054 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 04:42:26,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i Unable to find full path for "g++" [2024-11-14 04:42:27,914 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 04:42:28,299 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 04:42:28,303 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test2-1.i [2024-11-14 04:42:28,322 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/data/3d1d3bb34/ddc056640dd34c8db1935c04ef24d258/FLAG4558da2d5 [2024-11-14 04:42:28,336 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/data/3d1d3bb34/ddc056640dd34c8db1935c04ef24d258 [2024-11-14 04:42:28,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 04:42:28,342 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 04:42:28,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 04:42:28,345 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 04:42:28,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 04:42:28,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:42:28" (1/1) ... [2024-11-14 04:42:28,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3764315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:28, skipping insertion in model container [2024-11-14 04:42:28,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:42:28" (1/1) ... [2024-11-14 04:42:28,418 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 04:42:28,857 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:42:28,893 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:42:28,897 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:42:28,901 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:42:28,908 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:42:28,947 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:42:28,947 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:42:28,950 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:42:28,950 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-14 04:42:28,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:42:28,966 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 04:42:29,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 04:42:29,161 INFO L204 MainTranslator]: Completed translation [2024-11-14 04:42:29,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29 WrapperNode [2024-11-14 04:42:29,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 04:42:29,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 04:42:29,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 04:42:29,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 04:42:29,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29" (1/1) ... [2024-11-14 04:42:29,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29" (1/1) ... [2024-11-14 04:42:29,264 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1272 [2024-11-14 04:42:29,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 04:42:29,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 04:42:29,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 04:42:29,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 04:42:29,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29" (1/1) ... [2024-11-14 04:42:29,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29" (1/1) ... [2024-11-14 04:42:29,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29" (1/1) ... [2024-11-14 04:42:29,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29" (1/1) ... [2024-11-14 04:42:29,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29" (1/1) ... [2024-11-14 04:42:29,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29" (1/1) ... [2024-11-14 04:42:29,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29" (1/1) ... [2024-11-14 04:42:29,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29" (1/1) ... [2024-11-14 04:42:29,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 04:42:29,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 04:42:29,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 04:42:29,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 04:42:29,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29" (1/1) ... [2024-11-14 04:42:29,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 04:42:29,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:42:29,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 04:42:29,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 04:42:29,444 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-14 04:42:29,445 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-14 04:42:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-14 04:42:29,445 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-14 04:42:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 04:42:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 04:42:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 04:42:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 04:42:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 04:42:29,445 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 04:42:29,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 04:42:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 04:42:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 04:42:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 04:42:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 04:42:29,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 04:42:29,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 04:42:29,702 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 04:42:29,704 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 04:42:31,485 INFO L? ?]: Removed 298 outVars from TransFormulas that were not future-live. [2024-11-14 04:42:31,486 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 04:42:33,164 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 04:42:33,164 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-14 04:42:33,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:42:33 BoogieIcfgContainer [2024-11-14 04:42:33,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 04:42:33,167 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 04:42:33,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 04:42:33,176 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 04:42:33,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:42:28" (1/3) ... [2024-11-14 04:42:33,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e960558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:42:33, skipping insertion in model container [2024-11-14 04:42:33,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:42:29" (2/3) ... [2024-11-14 04:42:33,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e960558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:42:33, skipping insertion in model container [2024-11-14 04:42:33,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:42:33" (3/3) ... [2024-11-14 04:42:33,178 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test2-1.i [2024-11-14 04:42:33,198 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 04:42:33,200 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_test2-1.i that has 4 procedures, 121 locations, 1 initial locations, 31 loop locations, and 2 error locations. [2024-11-14 04:42:33,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 04:42:33,266 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;@383781b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 04:42:33,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-14 04:42:33,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 105 states have (on average 1.7428571428571429) internal successors, (183), 114 states have internal predecessors, (183), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-14 04:42:33,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 04:42:33,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:42:33,279 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 04:42:33,279 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:42:33,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:42:33,285 INFO L85 PathProgramCache]: Analyzing trace with hash 22427501, now seen corresponding path program 1 times [2024-11-14 04:42:33,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:42:33,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945488274] [2024-11-14 04:42:33,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:42:33,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:42:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:42:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:42:33,473 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:42:33,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945488274] [2024-11-14 04:42:33,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945488274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:42:33,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:42:33,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:42:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553907266] [2024-11-14 04:42:33,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:42:33,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-14 04:42:33,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:42:33,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-14 04:42:33,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:42:33,516 INFO L87 Difference]: Start difference. First operand has 121 states, 105 states have (on average 1.7428571428571429) internal successors, (183), 114 states have internal predecessors, (183), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:42:37,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:42:39,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:42:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:42:39,333 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2024-11-14 04:42:39,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-14 04:42:39,338 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 04:42:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:42:39,345 INFO L225 Difference]: With dead ends: 119 [2024-11-14 04:42:39,345 INFO L226 Difference]: Without dead ends: 118 [2024-11-14 04:42:39,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-14 04:42:39,349 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-14 04:42:39,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 2 Unknown, 0 Unchecked, 5.8s Time] [2024-11-14 04:42:39,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-14 04:42:39,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-14 04:42:39,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.2115384615384615) internal successors, (126), 111 states have internal predecessors, (126), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-14 04:42:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 144 transitions. [2024-11-14 04:42:39,394 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 144 transitions. Word has length 6 [2024-11-14 04:42:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:42:39,395 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 144 transitions. [2024-11-14 04:42:39,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:42:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 144 transitions. [2024-11-14 04:42:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-14 04:42:39,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:42:39,396 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:42:39,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 04:42:39,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:42:39,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:42:39,397 INFO L85 PathProgramCache]: Analyzing trace with hash 101579821, now seen corresponding path program 1 times [2024-11-14 04:42:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:42:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219424187] [2024-11-14 04:42:39,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:42:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:42:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:42:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:42:39,636 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:42:39,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219424187] [2024-11-14 04:42:39,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219424187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:42:39,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:42:39,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 04:42:39,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501639756] [2024-11-14 04:42:39,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:42:39,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:42:39,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:42:39,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:42:39,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:42:39,639 INFO L87 Difference]: Start difference. First operand 118 states and 144 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:42:41,690 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 [] [2024-11-14 04:42:43,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:42:45,217 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 [] [2024-11-14 04:42:47,223 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 [] [2024-11-14 04:42:49,467 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 [] [2024-11-14 04:42:51,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:42:53,487 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 [] [2024-11-14 04:42:55,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:42:57,544 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 [] [2024-11-14 04:42:59,555 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 [] [2024-11-14 04:43:01,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:03,577 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 [] [2024-11-14 04:43:05,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:07,667 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 [] [2024-11-14 04:43:09,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:11,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:13,684 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 [] [2024-11-14 04:43:14,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:43:14,769 INFO L93 Difference]: Finished difference Result 183 states and 229 transitions. [2024-11-14 04:43:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:43:14,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-14 04:43:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:43:14,774 INFO L225 Difference]: With dead ends: 183 [2024-11-14 04:43:14,774 INFO L226 Difference]: Without dead ends: 183 [2024-11-14 04:43:14,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:43:14,775 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 70 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.1s IncrementalHoareTripleChecker+Time [2024-11-14 04:43:14,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 320 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 16 Unknown, 0 Unchecked, 35.1s Time] [2024-11-14 04:43:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-14 04:43:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 120. [2024-11-14 04:43:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 113 states have internal predecessors, (128), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-14 04:43:14,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2024-11-14 04:43:14,788 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 8 [2024-11-14 04:43:14,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:43:14,788 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2024-11-14 04:43:14,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:43:14,789 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2024-11-14 04:43:14,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 04:43:14,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:43:14,790 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:43:14,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 04:43:14,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:43:14,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:43:14,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1490700911, now seen corresponding path program 1 times [2024-11-14 04:43:14,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:43:14,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667551116] [2024-11-14 04:43:14,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:43:14,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:43:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:43:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:43:15,314 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:43:15,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667551116] [2024-11-14 04:43:15,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667551116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:43:15,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:43:15,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 04:43:15,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175142405] [2024-11-14 04:43:15,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:43:15,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 04:43:15,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:43:15,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 04:43:15,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:43:15,319 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:43:17,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:19,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:21,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:22,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:25,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:28,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:30,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:32,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:33,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:43:33,854 INFO L93 Difference]: Finished difference Result 170 states and 209 transitions. [2024-11-14 04:43:33,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 04:43:33,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-14 04:43:33,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:43:33,860 INFO L225 Difference]: With dead ends: 170 [2024-11-14 04:43:33,860 INFO L226 Difference]: Without dead ends: 170 [2024-11-14 04:43:33,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 04:43:33,861 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 40 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:43:33,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 256 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 18.5s Time] [2024-11-14 04:43:33,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-14 04:43:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2024-11-14 04:43:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 147 states have (on average 1.2108843537414966) internal successors, (178), 159 states have internal predecessors, (178), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-14 04:43:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 206 transitions. [2024-11-14 04:43:33,874 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 206 transitions. Word has length 36 [2024-11-14 04:43:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:43:33,874 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 206 transitions. [2024-11-14 04:43:33,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 04:43:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 206 transitions. [2024-11-14 04:43:33,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-14 04:43:33,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:43:33,876 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:43:33,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 04:43:33,877 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:43:33,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:43:33,877 INFO L85 PathProgramCache]: Analyzing trace with hash 567432743, now seen corresponding path program 1 times [2024-11-14 04:43:33,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:43:33,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035853199] [2024-11-14 04:43:33,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:43:33,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:43:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:43:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-14 04:43:34,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:43:34,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035853199] [2024-11-14 04:43:34,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035853199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:43:34,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:43:34,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:43:34,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579207360] [2024-11-14 04:43:34,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:43:34,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:43:34,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:43:34,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:43:34,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:43:34,726 INFO L87 Difference]: Start difference. First operand 166 states and 206 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:43:36,760 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 [] [2024-11-14 04:43:38,765 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 [] [2024-11-14 04:43:41,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:44,225 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 [] [2024-11-14 04:43:46,246 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 [] [2024-11-14 04:43:48,254 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 [] [2024-11-14 04:43:50,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:52,272 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 [] [2024-11-14 04:43:54,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:56,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:43:58,349 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 [] [2024-11-14 04:44:00,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:44:02,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:44:04,362 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 [] [2024-11-14 04:44:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:44:05,030 INFO L93 Difference]: Finished difference Result 231 states and 300 transitions. [2024-11-14 04:44:05,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:44:05,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2024-11-14 04:44:05,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:44:05,037 INFO L225 Difference]: With dead ends: 231 [2024-11-14 04:44:05,037 INFO L226 Difference]: Without dead ends: 231 [2024-11-14 04:44:05,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:44:05,038 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 69 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 2 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.3s IncrementalHoareTripleChecker+Time [2024-11-14 04:44:05,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 322 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 102 Invalid, 14 Unknown, 0 Unchecked, 30.3s Time] [2024-11-14 04:44:05,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-14 04:44:05,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 168. [2024-11-14 04:44:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 149 states have (on average 1.2080536912751678) internal successors, (180), 161 states have internal predecessors, (180), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-14 04:44:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2024-11-14 04:44:05,051 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 49 [2024-11-14 04:44:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:44:05,051 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2024-11-14 04:44:05,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:44:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2024-11-14 04:44:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-14 04:44:05,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:44:05,053 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:44:05,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 04:44:05,054 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:44:05,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:44:05,054 INFO L85 PathProgramCache]: Analyzing trace with hash 68119395, now seen corresponding path program 1 times [2024-11-14 04:44:05,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:44:05,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917470688] [2024-11-14 04:44:05,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:44:05,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:44:05,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:44:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 04:44:05,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:44:05,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917470688] [2024-11-14 04:44:05,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917470688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:44:05,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 04:44:05,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 04:44:05,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706267499] [2024-11-14 04:44:05,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:44:05,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:44:05,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:44:05,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:44:05,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 04:44:05,538 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:44:07,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:44:09,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:44:11,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:44:13,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:44:15,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:44:17,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:44:19,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:44:19,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:44:19,945 INFO L93 Difference]: Finished difference Result 136 states and 161 transitions. [2024-11-14 04:44:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:44:19,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-11-14 04:44:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:44:19,946 INFO L225 Difference]: With dead ends: 136 [2024-11-14 04:44:19,946 INFO L226 Difference]: Without dead ends: 136 [2024-11-14 04:44:19,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:44:19,947 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 176 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 13 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-11-14 04:44:19,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 165 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 54 Invalid, 6 Unknown, 0 Unchecked, 14.4s Time] [2024-11-14 04:44:19,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-14 04:44:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-14 04:44:19,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.1721311475409837) internal successors, (143), 129 states have internal predecessors, (143), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-14 04:44:19,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 161 transitions. [2024-11-14 04:44:19,964 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 161 transitions. Word has length 65 [2024-11-14 04:44:19,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:44:19,965 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 161 transitions. [2024-11-14 04:44:19,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-14 04:44:19,966 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 161 transitions. [2024-11-14 04:44:19,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-14 04:44:19,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:44:19,970 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:44:19,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 04:44:19,970 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:44:19,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:44:19,971 INFO L85 PathProgramCache]: Analyzing trace with hash -969204832, now seen corresponding path program 1 times [2024-11-14 04:44:19,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:44:19,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520626308] [2024-11-14 04:44:19,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:44:19,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:44:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:44:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:44:21,823 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:44:21,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520626308] [2024-11-14 04:44:21,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520626308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:44:21,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40448863] [2024-11-14 04:44:21,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:44:21,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:44:21,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:44:21,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:44:21,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 04:44:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:44:53,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 04:44:53,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:44:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 04:44:53,971 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 04:44:53,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40448863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 04:44:53,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 04:44:53,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-14 04:44:53,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452648466] [2024-11-14 04:44:53,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 04:44:53,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 04:44:53,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:44:53,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 04:44:53,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:44:53,976 INFO L87 Difference]: Start difference. First operand 136 states and 161 transitions. Second operand has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:44:56,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:44:58,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:45:00,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:45:02,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:45:04,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:45:06,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:45:08,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:45:10,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:45:12,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:45:14,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:45:16,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:45:17,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:45:17,536 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2024-11-14 04:45:17,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 04:45:17,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 73 [2024-11-14 04:45:17,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:45:17,543 INFO L225 Difference]: With dead ends: 138 [2024-11-14 04:45:17,543 INFO L226 Difference]: Without dead ends: 138 [2024-11-14 04:45:17,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 04:45:17,544 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2024-11-14 04:45:17,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 359 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 11 Unknown, 0 Unchecked, 23.5s Time] [2024-11-14 04:45:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-14 04:45:17,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-14 04:45:17,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 123 states have (on average 1.1788617886178863) internal successors, (145), 131 states have internal predecessors, (145), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-14 04:45:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2024-11-14 04:45:17,551 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 73 [2024-11-14 04:45:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:45:17,552 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2024-11-14 04:45:17,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 22.666666666666668) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 04:45:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2024-11-14 04:45:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-14 04:45:17,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:45:17,553 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:45:17,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 04:45:17,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-14 04:45:17,754 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:45:17,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:45:17,755 INFO L85 PathProgramCache]: Analyzing trace with hash 278463216, now seen corresponding path program 1 times [2024-11-14 04:45:17,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:45:17,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187013746] [2024-11-14 04:45:17,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:45:17,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:45:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:45:19,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:45:19,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:45:19,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187013746] [2024-11-14 04:45:19,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187013746] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:45:19,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081183768] [2024-11-14 04:45:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:45:19,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:45:19,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:45:19,819 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:45:19,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 04:45:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:45:45,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-14 04:45:45,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 04:45:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 04:45:45,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 04:45:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 04:45:45,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081183768] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 04:45:45,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1318627078] [2024-11-14 04:45:45,593 INFO L159 IcfgInterpreter]: Started Sifa with 69 locations of interest [2024-11-14 04:45:45,594 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 04:45:45,597 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 04:45:45,602 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 04:45:45,603 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 04:46:07,510 INFO L197 IcfgInterpreter]: Interpreting procedure #Ultimate.C_memset with input of size 396 for LOIs [2024-11-14 04:46:12,835 INFO L197 IcfgInterpreter]: Interpreting procedure reach_error with input of size 7 for LOIs [2024-11-14 04:46:12,838 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 04:46:51,181 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_#Ultimate.C_memset_#ptr.offset| 0)) (.cse5 (= 44 |c_#Ultimate.C_memset_#amount|)) (.cse4 (= |c_#Ultimate.C_memset_#value| 0)) (.cse52 (= |c_#Ultimate.C_memset_#amount| 384))) (and (let ((.cse0 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse1 (= |c_old(#memory_int)| |c_#memory_int|)) (.cse3 (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| Int) (|v_#memory_int_426| (Array Int (Array Int Int))) (|v_#valid_55| (Array Int Int)) (|v_#memory_int_428| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_319| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_319| (Array Int (Array Int Int))) (|v_#memory_int_35| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_#length_33| (Array Int Int)) (|v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_12| Int) (|v_#memory_$Pointer$.offset_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_320| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_320| (Array Int (Array Int Int)))) (let ((.cse11 (select |v_#memory_$Pointer$.offset_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (.cse6 (select (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) 8)) (.cse12 (select |v_#memory_$Pointer$.offset_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (.cse7 (select |v_#memory_int_35| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (.cse10 (select |v_#memory_$Pointer$.base_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (.cse13 (select |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (.cse8 (select |v_#memory_int_128| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|)) (.cse9 (select |v_#memory_int_428| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|))) (and (= .cse6 |c_#Ultimate.C_memset_#ptr.base|) (= |c_#valid| (store |v_#valid_55| .cse6 1)) (= (store |v_#memory_int_35| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (store .cse7 32 4) 16 (select .cse8 16))) |v_#memory_int_128|) (= (store |v_#length_33| .cse6 44) |c_#length|) (= |c_old(#memory_int)| (store |v_#memory_int_428| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store .cse9 8 (select (select |c_old(#memory_int)| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) 8)))) (= 0 (select |v_#valid_55| .cse6)) (= |c_old(#memory_$Pointer$.base)| (store |v_#memory_$Pointer$.base_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (store (store .cse10 16 0) 12 0) 8 .cse6))) (= (store |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (select |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) 36 (select .cse11 36))) |v_#memory_$Pointer$.offset_21|) (= |v_#memory_$Pointer$.offset_320| (store |v_#memory_$Pointer$.offset_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (store .cse11 28 0) 32 (select .cse12 32)))) (<= (+ .cse6 1) |c_#StackHeapBarrier|) (not (= .cse6 0)) (= (store |v_#memory_$Pointer$.offset_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (store (store .cse12 16 0) 12 0) 8 0)) |c_old(#memory_$Pointer$.offset)|) (= |v_#memory_int_35| (store |v_#memory_int_426| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (store (select |v_#memory_int_426| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) 36 |v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_12|) 28 (select .cse7 28)))) (= (store |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (store .cse13 28 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) 32 (select .cse10 32))) |v_#memory_$Pointer$.base_320|) (= (store |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store (select |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|) 36 (select .cse13 36))) |v_#memory_$Pointer$.base_21|) (= |v_#memory_int_428| (store |v_#memory_int_128| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (store .cse8 12 (select .cse9 12)))))))) (and .cse0 .cse1 .cse3 .cse4 (exists ((|v_#memory_int_129| (Array Int (Array Int Int))) (|v_#valid_56| (Array Int Int)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| Int) (|v_#memory_$Pointer$.offset_106| (Array Int (Array Int Int))) (|v_#memory_int_429| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_108| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_107| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_106| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~mem54#1.base_14| Int) (|v_#length_34| (Array Int Int)) (|v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_11| Int) (|v_#memory_$Pointer$.base_322| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_322| (Array Int (Array Int Int))) (|v_#memory_int_130| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_#t~malloc61#1.base_6| Int)) (let ((.cse46 (select (select |v_#memory_$Pointer$.base_107| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse47 (select (select |v_#memory_$Pointer$.offset_108| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse41 (select (select |v_#memory_$Pointer$.base_322| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse42 (+ 16 (select (select |v_#memory_$Pointer$.offset_322| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)))) (let ((.cse35 (store |v_#memory_$Pointer$.offset_322| .cse41 (store (select |v_#memory_$Pointer$.offset_322| .cse41) .cse42 8))) (.cse44 (store |v_#memory_$Pointer$.base_322| .cse41 (store (select |v_#memory_$Pointer$.base_322| .cse41) .cse42 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))) (.cse50 (select (select |c_old(#memory_$Pointer$.base)| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse51 (select (select |c_old(#memory_$Pointer$.offset)| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse16 (store |v_#memory_$Pointer$.offset_108| .cse46 (store (select |v_#memory_$Pointer$.offset_108| .cse46) .cse47 0))) (.cse32 (store |v_#memory_$Pointer$.base_107| .cse46 (store (select |v_#memory_$Pointer$.base_107| .cse46) .cse47 |v_ULTIMATE.start_main_#t~malloc61#1.base_6|)))) (let ((.cse14 (select (select .cse32 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse15 (+ (select (select .cse16 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8) 40)) (.cse38 (select (select |c_old(#memory_$Pointer$.base)| .cse50) .cse51)) (.cse43 (select (select |c_old(#memory_$Pointer$.offset)| .cse50) .cse51)) (.cse39 (select (select |v_#memory_$Pointer$.base_108| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse40 (+ (select (select |v_#memory_$Pointer$.offset_106| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8) 20)) (.cse33 (select (select |v_#memory_$Pointer$.base_106| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse34 (+ 8 (select (select |v_#memory_$Pointer$.offset_107| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8))) (.cse36 (select (select .cse44 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)) (.cse37 (+ (select (select .cse35 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8) 4))) (and (= |c_old(#memory_int)| (store |v_#memory_int_129| .cse14 (store (select |v_#memory_int_129| .cse14) .cse15 2685476833))) (= (store .cse16 .cse14 (store (select .cse16 .cse14) .cse15 (select (select |c_old(#memory_$Pointer$.offset)| .cse14) .cse15))) |c_old(#memory_$Pointer$.offset)|) (let ((.cse17 (exists ((|v_#Ultimate.C_memset_#t~loopctr228_26| Int)) (and (<= 0 |v_#Ultimate.C_memset_#t~loopctr228_26|) (<= 44 (mod |v_#Ultimate.C_memset_#t~loopctr228_26| 4294967296))))) (.cse18 (exists ((|v_#memory_$Pointer$.offset_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_319| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_320| (Array Int (Array Int Int)))) (let ((.cse31 (select |v_#memory_$Pointer$.offset_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))) (and (= |v_#memory_$Pointer$.offset_320| (store |v_#memory_$Pointer$.offset_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store .cse31 28 0) 32 (select (select |v_#memory_$Pointer$.offset_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 32)))) (= (store |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (select |v_#memory_$Pointer$.offset_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 36 (select .cse31 36))) |v_#memory_$Pointer$.offset_21|)))))) (or (and .cse17 .cse18 (exists ((|v_#valid_55| (Array Int Int)) (|v_#memory_$Pointer$.base_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_319| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_13| (Array Int (Array Int Int))) (|v_#length_33| (Array Int Int)) (|v_#memory_$Pointer$.base_320| (Array Int (Array Int Int)))) (let ((.cse19 (select |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse20 (select |v_#memory_$Pointer$.base_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse21 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_13| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8))) (and (= |v_#memory_$Pointer$.base_320| (store |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store .cse19 28 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 32 (select .cse20 32)))) (= (store |v_#length_33| .cse21 44) |v_#length_34|) (= (store |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (select |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 36 (select .cse19 36))) |v_#memory_$Pointer$.base_21|) (= (select |v_#valid_55| .cse21) 0) (= (store |v_#valid_55| .cse21 1) |v_#valid_56|) (= |v_ULTIMATE.start_main_#t~mem54#1.base_14| .cse21) (<= (+ 1 .cse21) |c_#StackHeapBarrier|) (= |v_old(#memory_$Pointer$.base)_AFTER_CALL_13| (store |v_#memory_$Pointer$.base_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store (store .cse20 16 0) 12 0) 8 .cse21))) (not (= 0 .cse21))))) (exists ((|v_#memory_int_426| (Array Int (Array Int Int))) (|v_#memory_int_428| (Array Int (Array Int Int))) (|v_#memory_int_35| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int))) (|v_#memory_int_BEFORE_CALL_18| (Array Int (Array Int Int)))) (let ((.cse22 (select |v_#memory_int_428| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse24 (select |v_#memory_int_35| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse23 (select |v_#memory_int_128| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))) (and (= (store |v_#memory_int_428| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store .cse22 8 (select (select |v_#memory_int_BEFORE_CALL_18| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8))) |v_#memory_int_BEFORE_CALL_18|) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store .cse23 12 (select .cse22 12))) |v_#memory_int_428|) (= |v_#memory_int_35| (store |v_#memory_int_426| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store (select |v_#memory_int_426| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 36 |v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_11|) 28 (select .cse24 28)))) (= (store |v_#memory_int_35| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store .cse24 32 4) 16 (select .cse23 16))) |v_#memory_int_128|))))) (and .cse17 .cse18 (exists ((|v_#valid_55| (Array Int Int)) (|v_#memory_$Pointer$.base_21| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_319| (Array Int (Array Int Int))) (|v_old(#memory_$Pointer$.base)_AFTER_CALL_14| (Array Int (Array Int Int))) (|v_#length_33| (Array Int Int)) (|v_#memory_$Pointer$.base_320| (Array Int (Array Int Int)))) (let ((.cse26 (select |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse27 (select |v_#memory_$Pointer$.base_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse25 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_14| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8))) (and (not (= .cse25 0)) (<= (+ .cse25 1) |c_#StackHeapBarrier|) (= |v_#memory_$Pointer$.base_320| (store |v_#memory_$Pointer$.base_21| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store .cse26 28 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 32 (select .cse27 32)))) (= .cse25 |v_ULTIMATE.start_main_#t~mem54#1.base_14|) (= |v_#valid_56| (store |v_#valid_55| .cse25 1)) (= (store |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (select |v_#memory_$Pointer$.base_319| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 36 (select .cse26 36))) |v_#memory_$Pointer$.base_21|) (= (store |v_#length_33| .cse25 44) |v_#length_34|) (= (store |v_#memory_$Pointer$.base_320| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store (store .cse27 16 0) 12 0) 8 .cse25)) |v_old(#memory_$Pointer$.base)_AFTER_CALL_14|) (= 0 (select |v_#valid_55| .cse25))))) (exists ((|v_#memory_int_426| (Array Int (Array Int Int))) (|v_#memory_int_428| (Array Int (Array Int Int))) (|v_old(#memory_int)_AFTER_CALL_14| (Array Int (Array Int Int))) (|v_#memory_int_35| (Array Int (Array Int Int))) (|v_#memory_int_128| (Array Int (Array Int Int)))) (let ((.cse28 (select |v_#memory_int_428| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse30 (select |v_#memory_int_35| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|)) (.cse29 (select |v_#memory_int_128| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|))) (and (= |v_old(#memory_int)_AFTER_CALL_14| (store |v_#memory_int_428| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store .cse28 8 (select (select |v_old(#memory_int)_AFTER_CALL_14| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 8)))) (= (store |v_#memory_int_128| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store .cse29 12 (select .cse28 12))) |v_#memory_int_428|) (= |v_#memory_int_35| (store |v_#memory_int_426| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store (select |v_#memory_int_426| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11|) 36 |v_ULTIMATE.start_main_~_ha_hashv~0#1_BEFORE_CALL_11|) 28 (select .cse30 28)))) (= (store |v_#memory_int_35| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_11| (store (store .cse30 32 4) 16 (select .cse29 16))) |v_#memory_int_128|))))))) (= (store .cse32 .cse14 (store (select .cse32 .cse14) .cse15 (select (select |c_old(#memory_$Pointer$.base)| .cse14) .cse15))) |c_old(#memory_$Pointer$.base)|) (= (select |v_#valid_56| |v_ULTIMATE.start_main_#t~malloc61#1.base_6|) 0) (= (store |v_#memory_$Pointer$.base_106| .cse33 (store (select |v_#memory_$Pointer$.base_106| .cse33) .cse34 (select (select |v_#memory_$Pointer$.base_108| .cse33) .cse34))) |v_#memory_$Pointer$.base_108|) (= (store .cse35 .cse36 (store (select .cse35 .cse36) .cse37 (select (select |v_#memory_$Pointer$.offset_107| .cse36) .cse37))) |v_#memory_$Pointer$.offset_107|) (= (store |v_#memory_$Pointer$.offset_107| .cse33 (store (select |v_#memory_$Pointer$.offset_107| .cse33) .cse34 (select (select |v_#memory_$Pointer$.offset_106| .cse33) .cse34))) |v_#memory_$Pointer$.offset_106|) (= |c_#Ultimate.C_memset_#ptr.base| .cse38) (= (store |v_#length_34| |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 384) |c_#length|) (= (store |v_#memory_$Pointer$.offset_106| .cse39 (store (select |v_#memory_$Pointer$.offset_106| .cse39) .cse40 (select (select |v_#memory_$Pointer$.offset_108| .cse39) .cse40))) |v_#memory_$Pointer$.offset_108|) (= (store |v_#memory_$Pointer$.base_108| .cse39 (store (select |v_#memory_$Pointer$.base_108| .cse39) .cse40 (select (select |v_#memory_$Pointer$.base_107| .cse39) .cse40))) |v_#memory_$Pointer$.base_107|) (<= (+ |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 1) |c_#StackHeapBarrier|) (= |v_#memory_int_130| (store |v_#memory_int_429| .cse41 (store (select |v_#memory_int_429| .cse41) .cse42 (select (select |v_#memory_int_130| .cse41) .cse42)))) (not (= |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 0)) (= .cse43 |c_#Ultimate.C_memset_#ptr.offset|) (= |c_#valid| (store |v_#valid_56| |v_ULTIMATE.start_main_#t~malloc61#1.base_6| 1)) (= (store .cse44 .cse36 (store (select .cse44 .cse36) .cse37 (select (select |v_#memory_$Pointer$.base_106| .cse36) .cse37))) |v_#memory_$Pointer$.base_106|) (or (not (= .cse38 0)) (not (= .cse43 0))) (= (let ((.cse45 (let ((.cse48 (let ((.cse49 (store |v_#memory_int_130| .cse36 (store (select |v_#memory_int_130| .cse36) .cse37 32)))) (store .cse49 .cse33 (store (select .cse49 .cse33) .cse34 5))))) (store .cse48 .cse39 (store (select .cse48 .cse39) .cse40 8))))) (store .cse45 .cse46 (store (select .cse45 .cse46) .cse47 (select (select |v_#memory_int_129| .cse46) .cse47)))) |v_#memory_int_129|)))))) .cse52))) (or (and .cse2 .cse4 .cse5) (and .cse4 .cse52)))) is different from false [2024-11-14 04:49:27,030 WARN L286 SmtUtils]: Spent 2.23m on a formula simplification that was a NOOP. DAG size: 301 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:51:48,994 WARN L286 SmtUtils]: Spent 2.06m on a formula simplification that was a NOOP. DAG size: 306 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-14 04:53:17,182 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2646#(and (<= 1 |#StackHeapBarrier|) (= ~count_int_int~0 0))' at error location [2024-11-14 04:53:17,183 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 04:53:17,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 04:53:17,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-14 04:53:17,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068712760] [2024-11-14 04:53:17,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 04:53:17,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 04:53:17,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 04:53:17,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 04:53:17,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1240, Unknown=66, NotChecked=74, Total=1560 [2024-11-14 04:53:17,186 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand has 10 states, 7 states have (on average 11.142857142857142) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 04:53:19,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:21,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:23,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:24,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:28,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:30,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:32,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:34,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:36,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:38,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:40,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:42,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:44,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:46,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:47,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-14 04:53:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 04:53:49,336 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2024-11-14 04:53:49,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 04:53:49,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 11.142857142857142) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 75 [2024-11-14 04:53:49,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 04:53:49,337 INFO L225 Difference]: With dead ends: 147 [2024-11-14 04:53:49,338 INFO L226 Difference]: Without dead ends: 146 [2024-11-14 04:53:49,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 179 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 424.6s TimeCoverageRelationStatistics Valid=205, Invalid=1455, Unknown=66, NotChecked=80, Total=1806 [2024-11-14 04:53:49,339 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2024-11-14 04:53:49,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 591 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 13 Unknown, 0 Unchecked, 31.9s Time] [2024-11-14 04:53:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-14 04:53:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-14 04:53:49,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 130 states have (on average 1.2) internal successors, (156), 138 states have internal predecessors, (156), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 4 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-14 04:53:49,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 175 transitions. [2024-11-14 04:53:49,351 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 175 transitions. Word has length 75 [2024-11-14 04:53:49,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 04:53:49,351 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 175 transitions. [2024-11-14 04:53:49,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 11.142857142857142) internal successors, (78), 10 states have internal predecessors, (78), 2 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-14 04:53:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2024-11-14 04:53:49,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-14 04:53:49,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 04:53:49,356 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 04:53:49,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 04:53:49,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:53:49,563 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-14 04:53:49,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 04:53:49,563 INFO L85 PathProgramCache]: Analyzing trace with hash 722615296, now seen corresponding path program 2 times [2024-11-14 04:53:49,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 04:53:49,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428229034] [2024-11-14 04:53:49,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 04:53:49,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 04:53:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 04:53:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 04:53:51,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 04:53:51,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428229034] [2024-11-14 04:53:51,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428229034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 04:53:51,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135084072] [2024-11-14 04:53:51,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 04:53:51,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 04:53:51,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 04:53:51,563 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 04:53:51,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d9d9675-ea11-4a1f-bc46-942784b85ab1/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process