./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9d8386495cfc7d925686020c12a2509d702f4bf2aed1f5dea2d7da468cac3b6e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 07:18:06,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:18:06,544 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 07:18:06,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:18:06,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:18:06,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:18:06,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:18:06,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:18:06,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:18:06,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:18:06,577 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 07:18:06,578 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 07:18:06,578 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 07:18:06,579 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 07:18:06,579 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 07:18:06,579 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 07:18:06,580 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 07:18:06,580 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 07:18:06,581 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 07:18:06,581 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 07:18:06,582 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 07:18:06,586 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 07:18:06,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:18:06,587 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:18:06,588 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:18:06,588 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:18:06,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:18:06,589 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:18:06,589 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:18:06,589 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:18:06,590 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:18:06,590 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:18:06,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:18:06,591 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:18:06,591 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:18:06,592 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:18:06,592 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:18:06,592 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:18:06,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:18:06,593 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:18:06,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:18:06,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:18:06,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:18:06,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:18:06,595 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 07:18:06,595 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:18:06,595 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:18:06,596 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 07:18:06,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:18:06,596 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9d8386495cfc7d925686020c12a2509d702f4bf2aed1f5dea2d7da468cac3b6e [2024-11-09 07:18:06,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:18:06,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:18:06,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:18:06,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:18:06,918 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:18:06,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i Unable to find full path for "g++" [2024-11-09 07:18:08,963 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:18:09,206 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:18:09,207 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/sv-benchmarks/c/forester-heap/dll-simple-white-blue-2.i [2024-11-09 07:18:09,223 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/data/2e6de6d4a/43a335cb73324d4ab413ec3fcb965a4d/FLAGcc202b92e [2024-11-09 07:18:09,239 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/data/2e6de6d4a/43a335cb73324d4ab413ec3fcb965a4d [2024-11-09 07:18:09,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:18:09,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:18:09,245 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:18:09,245 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:18:09,251 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:18:09,252 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ca43d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09, skipping insertion in model container [2024-11-09 07:18:09,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,301 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:18:09,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:18:09,736 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:18:09,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:18:09,808 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:18:09,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09 WrapperNode [2024-11-09 07:18:09,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:18:09,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:18:09,810 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:18:09,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:18:09,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,862 INFO L138 Inliner]: procedures = 119, calls = 39, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 120 [2024-11-09 07:18:09,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:18:09,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:18:09,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:18:09,868 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:18:09,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,886 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,896 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,903 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,904 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:18:09,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:18:09,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:18:09,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:18:09,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09" (1/1) ... [2024-11-09 07:18:09,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 07:18:09,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:18:09,942 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 07:18:09,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 07:18:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:18:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:18:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:18:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:18:09,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 07:18:09,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 07:18:09,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:18:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:18:09,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:18:09,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:18:10,158 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:18:10,161 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:18:10,706 INFO L? ?]: Removed 130 outVars from TransFormulas that were not future-live. [2024-11-09 07:18:10,706 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:18:10,756 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:18:10,756 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-09 07:18:10,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:18:10 BoogieIcfgContainer [2024-11-09 07:18:10,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:18:10,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:18:10,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:18:10,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:18:10,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:18:09" (1/3) ... [2024-11-09 07:18:10,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676f16a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:18:10, skipping insertion in model container [2024-11-09 07:18:10,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:18:09" (2/3) ... [2024-11-09 07:18:10,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676f16a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:18:10, skipping insertion in model container [2024-11-09 07:18:10,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:18:10" (3/3) ... [2024-11-09 07:18:10,767 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-2.i [2024-11-09 07:18:10,786 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:18:10,786 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2024-11-09 07:18:10,859 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:18:10,866 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;@4fefd049, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:18:10,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2024-11-09 07:18:10,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 54 states have (on average 2.425925925925926) internal successors, (131), 113 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 07:18:10,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:10,898 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 07:18:10,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:10,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:10,907 INFO L85 PathProgramCache]: Analyzing trace with hash 8095, now seen corresponding path program 1 times [2024-11-09 07:18:10,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:10,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784292372] [2024-11-09 07:18:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:10,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:11,177 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-09 07:18:11,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:11,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784292372] [2024-11-09 07:18:11,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784292372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:11,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:11,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:18:11,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088157142] [2024-11-09 07:18:11,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:11,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:18:11,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:11,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:18:11,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:18:11,231 INFO L87 Difference]: Start difference. First operand has 114 states, 54 states have (on average 2.425925925925926) internal successors, (131), 113 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:11,399 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2024-11-09 07:18:11,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:18:11,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-09 07:18:11,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:11,410 INFO L225 Difference]: With dead ends: 109 [2024-11-09 07:18:11,411 INFO L226 Difference]: Without dead ends: 108 [2024-11-09 07:18:11,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:18:11,416 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 90 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:11,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 67 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:18:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-09 07:18:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-09 07:18:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 52 states have (on average 2.25) internal successors, (117), 107 states have internal predecessors, (117), 0 states have call successors, (0), 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-09 07:18:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2024-11-09 07:18:11,456 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 2 [2024-11-09 07:18:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:11,457 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2024-11-09 07:18:11,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2024-11-09 07:18:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-09 07:18:11,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:11,458 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-09 07:18:11,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:18:11,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:11,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash 8096, now seen corresponding path program 1 times [2024-11-09 07:18:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:11,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133055206] [2024-11-09 07:18:11,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:11,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:11,556 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-09 07:18:11,556 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:11,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133055206] [2024-11-09 07:18:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133055206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:11,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:11,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 07:18:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420295722] [2024-11-09 07:18:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:11,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:18:11,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:11,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:18:11,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:18:11,561 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:11,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:11,720 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2024-11-09 07:18:11,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:18:11,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-11-09 07:18:11,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:11,723 INFO L225 Difference]: With dead ends: 130 [2024-11-09 07:18:11,723 INFO L226 Difference]: Without dead ends: 130 [2024-11-09 07:18:11,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:18:11,725 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 90 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:11,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 107 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:18:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-09 07:18:11,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 105. [2024-11-09 07:18:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 52 states have (on average 2.1923076923076925) internal successors, (114), 104 states have internal predecessors, (114), 0 states have call successors, (0), 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-09 07:18:11,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2024-11-09 07:18:11,735 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 2 [2024-11-09 07:18:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:11,736 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2024-11-09 07:18:11,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2024-11-09 07:18:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:18:11,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:11,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:11,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:18:11,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:11,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:11,739 INFO L85 PathProgramCache]: Analyzing trace with hash -191625639, now seen corresponding path program 1 times [2024-11-09 07:18:11,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:11,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775545276] [2024-11-09 07:18:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:11,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:11,941 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-09 07:18:11,941 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:11,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775545276] [2024-11-09 07:18:11,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775545276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:11,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:11,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:18:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993808491] [2024-11-09 07:18:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:11,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:18:11,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:11,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:18:11,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:18:11,945 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:12,209 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2024-11-09 07:18:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:18:12,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:18:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:12,212 INFO L225 Difference]: With dead ends: 101 [2024-11-09 07:18:12,212 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 07:18:12,213 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-09 07:18:12,216 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 120 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:12,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 40 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:18:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 07:18:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-09 07:18:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 60 states have (on average 1.8833333333333333) internal successors, (113), 96 states have internal predecessors, (113), 0 states have call successors, (0), 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-09 07:18:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2024-11-09 07:18:12,234 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 7 [2024-11-09 07:18:12,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:12,235 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2024-11-09 07:18:12,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:12,235 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2024-11-09 07:18:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:18:12,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:12,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:12,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:18:12,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:12,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash -191625638, now seen corresponding path program 1 times [2024-11-09 07:18:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:12,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328393988] [2024-11-09 07:18:12,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:12,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:12,599 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-09 07:18:12,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:12,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328393988] [2024-11-09 07:18:12,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328393988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:12,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:12,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:18:12,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294288496] [2024-11-09 07:18:12,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:12,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:18:12,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:12,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:18:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:18:12,606 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:12,944 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2024-11-09 07:18:12,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:18:12,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 07:18:12,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:12,946 INFO L225 Difference]: With dead ends: 124 [2024-11-09 07:18:12,946 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 07:18:12,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:18:12,948 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 274 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:12,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 55 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:18:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 07:18:12,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 113. [2024-11-09 07:18:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 79 states have (on average 1.7088607594936709) internal successors, (135), 112 states have internal predecessors, (135), 0 states have call successors, (0), 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-09 07:18:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2024-11-09 07:18:12,957 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 7 [2024-11-09 07:18:12,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:12,957 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2024-11-09 07:18:12,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:12,958 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2024-11-09 07:18:12,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:18:12,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:12,958 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:12,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:18:12,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:12,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:12,960 INFO L85 PathProgramCache]: Analyzing trace with hash 531543841, now seen corresponding path program 1 times [2024-11-09 07:18:12,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:12,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423730907] [2024-11-09 07:18:12,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:12,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:13,124 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-09 07:18:13,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:13,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423730907] [2024-11-09 07:18:13,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423730907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:13,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:13,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:18:13,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245071645] [2024-11-09 07:18:13,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:13,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:18:13,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:13,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:18:13,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:18:13,131 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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-09 07:18:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:13,318 INFO L93 Difference]: Finished difference Result 112 states and 133 transitions. [2024-11-09 07:18:13,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:18:13,319 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-09 07:18:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:13,319 INFO L225 Difference]: With dead ends: 112 [2024-11-09 07:18:13,320 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 07:18:13,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:18:13,321 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:13,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 201 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:18:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 07:18:13,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-09 07:18:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 79 states have (on average 1.6835443037974684) internal successors, (133), 111 states have internal predecessors, (133), 0 states have call successors, (0), 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-09 07:18:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2024-11-09 07:18:13,329 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 9 [2024-11-09 07:18:13,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:13,330 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2024-11-09 07:18:13,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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-09 07:18:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2024-11-09 07:18:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 07:18:13,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:13,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:13,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:18:13,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:13,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash 531543842, now seen corresponding path program 1 times [2024-11-09 07:18:13,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:13,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478909210] [2024-11-09 07:18:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:13,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:13,512 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-09 07:18:13,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:13,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478909210] [2024-11-09 07:18:13,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478909210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:13,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:13,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:18:13,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197806028] [2024-11-09 07:18:13,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:13,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:18:13,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:13,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:18:13,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:18:13,515 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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-09 07:18:13,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:13,708 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2024-11-09 07:18:13,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:18:13,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2024-11-09 07:18:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:13,710 INFO L225 Difference]: With dead ends: 111 [2024-11-09 07:18:13,710 INFO L226 Difference]: Without dead ends: 111 [2024-11-09 07:18:13,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:18:13,711 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 2 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:13,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 189 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:18:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-09 07:18:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-09 07:18:13,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 79 states have (on average 1.6582278481012658) internal successors, (131), 110 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:13,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2024-11-09 07:18:13,718 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 9 [2024-11-09 07:18:13,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:13,718 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2024-11-09 07:18:13,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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-09 07:18:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2024-11-09 07:18:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:18:13,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:13,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:13,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:18:13,720 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:13,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:13,721 INFO L85 PathProgramCache]: Analyzing trace with hash -287287544, now seen corresponding path program 1 times [2024-11-09 07:18:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:13,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108503232] [2024-11-09 07:18:13,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:13,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:13,986 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-09 07:18:13,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:13,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108503232] [2024-11-09 07:18:13,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108503232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:13,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:13,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:18:13,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999430744] [2024-11-09 07:18:13,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:13,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:18:13,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:13,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:18:13,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:18:13,989 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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-09 07:18:14,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:14,334 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2024-11-09 07:18:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:18:14,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-09 07:18:14,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:14,336 INFO L225 Difference]: With dead ends: 113 [2024-11-09 07:18:14,336 INFO L226 Difference]: Without dead ends: 113 [2024-11-09 07:18:14,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:18:14,337 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 112 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:14,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 85 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:18:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-09 07:18:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2024-11-09 07:18:14,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.6455696202531647) internal successors, (130), 109 states have internal predecessors, (130), 0 states have call successors, (0), 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-09 07:18:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2024-11-09 07:18:14,350 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 11 [2024-11-09 07:18:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:14,351 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2024-11-09 07:18:14,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 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-09 07:18:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2024-11-09 07:18:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:18:14,352 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:14,352 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:14,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:18:14,352 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:14,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:14,353 INFO L85 PathProgramCache]: Analyzing trace with hash -287287543, now seen corresponding path program 1 times [2024-11-09 07:18:14,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:14,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767143475] [2024-11-09 07:18:14,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:14,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:14,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:14,769 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-09 07:18:14,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:14,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767143475] [2024-11-09 07:18:14,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767143475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:14,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:14,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:18:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361975069] [2024-11-09 07:18:14,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:14,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:18:14,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:14,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:18:14,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:18:14,772 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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-09 07:18:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:15,370 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2024-11-09 07:18:15,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:18:15,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2024-11-09 07:18:15,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:15,372 INFO L225 Difference]: With dead ends: 110 [2024-11-09 07:18:15,372 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 07:18:15,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:18:15,373 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 116 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:15,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 141 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:18:15,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 07:18:15,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 99. [2024-11-09 07:18:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.6164383561643836) internal successors, (118), 98 states have internal predecessors, (118), 0 states have call successors, (0), 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-09 07:18:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2024-11-09 07:18:15,378 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 11 [2024-11-09 07:18:15,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:15,378 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2024-11-09 07:18:15,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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-09 07:18:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2024-11-09 07:18:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:18:15,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:15,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:15,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:18:15,380 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:15,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1539089758, now seen corresponding path program 1 times [2024-11-09 07:18:15,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:15,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062262135] [2024-11-09 07:18:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:15,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:15,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062262135] [2024-11-09 07:18:15,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062262135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:15,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:15,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:18:15,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130330423] [2024-11-09 07:18:15,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:15,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:18:15,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:15,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:18:15,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:18:15,589 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:15,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:15,778 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2024-11-09 07:18:15,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:18:15,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 07:18:15,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:15,779 INFO L225 Difference]: With dead ends: 109 [2024-11-09 07:18:15,779 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 07:18:15,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:18:15,780 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 17 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:15,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 212 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:18:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 07:18:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2024-11-09 07:18:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 79 states have (on average 1.5949367088607596) internal successors, (126), 104 states have internal predecessors, (126), 0 states have call successors, (0), 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-09 07:18:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 126 transitions. [2024-11-09 07:18:15,792 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 126 transitions. Word has length 13 [2024-11-09 07:18:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:15,792 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 126 transitions. [2024-11-09 07:18:15,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2024-11-09 07:18:15,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:18:15,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:15,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:15,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:18:15,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:15,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:15,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1870509042, now seen corresponding path program 1 times [2024-11-09 07:18:15,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:15,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486881672] [2024-11-09 07:18:15,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:15,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:16,081 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486881672] [2024-11-09 07:18:16,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486881672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:18:16,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3013295] [2024-11-09 07:18:16,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:16,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:18:16,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:18:16,084 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:18:16,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:18:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:16,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:18:16,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:16,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:18:16,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:18:16,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-09 07:18:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:16,390 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:18:16,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3013295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:16,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:18:16,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 10 [2024-11-09 07:18:16,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188736957] [2024-11-09 07:18:16,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:16,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:18:16,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:16,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:18:16,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:18:16,393 INFO L87 Difference]: Start difference. First operand 105 states and 126 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:16,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:16,593 INFO L93 Difference]: Finished difference Result 128 states and 154 transitions. [2024-11-09 07:18:16,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:18:16,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 07:18:16,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:16,594 INFO L225 Difference]: With dead ends: 128 [2024-11-09 07:18:16,594 INFO L226 Difference]: Without dead ends: 128 [2024-11-09 07:18:16,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:18:16,595 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 31 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:16,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 184 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:18:16,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-09 07:18:16,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 108. [2024-11-09 07:18:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 107 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:16,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 129 transitions. [2024-11-09 07:18:16,600 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 129 transitions. Word has length 16 [2024-11-09 07:18:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:16,600 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 129 transitions. [2024-11-09 07:18:16,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 129 transitions. [2024-11-09 07:18:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:18:16,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:16,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:16,622 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:18:16,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 07:18:16,802 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:16,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash 449305592, now seen corresponding path program 1 times [2024-11-09 07:18:16,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:16,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365133464] [2024-11-09 07:18:16,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:16,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:16,898 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-09 07:18:16,898 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:16,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365133464] [2024-11-09 07:18:16,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365133464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:16,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:16,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:18:16,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279313229] [2024-11-09 07:18:16,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:16,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:18:16,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:16,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:18:16,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:18:16,900 INFO L87 Difference]: Start difference. First operand 108 states and 129 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:17,095 INFO L93 Difference]: Finished difference Result 124 states and 146 transitions. [2024-11-09 07:18:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:18:17,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 07:18:17,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:17,096 INFO L225 Difference]: With dead ends: 124 [2024-11-09 07:18:17,096 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 07:18:17,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:18:17,097 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 10 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:17,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 200 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:18:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 07:18:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 117. [2024-11-09 07:18:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.5604395604395604) internal successors, (142), 116 states have internal predecessors, (142), 0 states have call successors, (0), 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-09 07:18:17,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2024-11-09 07:18:17,101 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 142 transitions. Word has length 16 [2024-11-09 07:18:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:17,101 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 142 transitions. [2024-11-09 07:18:17,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2024-11-09 07:18:17,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:18:17,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:17,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:17,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:18:17,104 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:17,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:17,104 INFO L85 PathProgramCache]: Analyzing trace with hash 2030434494, now seen corresponding path program 1 times [2024-11-09 07:18:17,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:17,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654952408] [2024-11-09 07:18:17,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:17,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:17,379 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-09 07:18:17,380 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:17,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654952408] [2024-11-09 07:18:17,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654952408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:17,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:17,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:18:17,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610964735] [2024-11-09 07:18:17,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:17,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:18:17,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:17,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:18:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:18:17,382 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-09 07:18:17,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:17,692 INFO L93 Difference]: Finished difference Result 143 states and 175 transitions. [2024-11-09 07:18:17,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:18:17,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-09 07:18:17,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:17,694 INFO L225 Difference]: With dead ends: 143 [2024-11-09 07:18:17,694 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 07:18:17,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:18:17,695 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 171 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:17,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 76 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:18:17,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 07:18:17,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 117. [2024-11-09 07:18:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 92 states have (on average 1.5543478260869565) internal successors, (143), 116 states have internal predecessors, (143), 0 states have call successors, (0), 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-09 07:18:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2024-11-09 07:18:17,701 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 18 [2024-11-09 07:18:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:17,701 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2024-11-09 07:18:17,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 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-09 07:18:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2024-11-09 07:18:17,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:18:17,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:17,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:17,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:18:17,705 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:17,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2030434495, now seen corresponding path program 1 times [2024-11-09 07:18:17,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:17,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258956793] [2024-11-09 07:18:17,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:17,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:18,091 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-09 07:18:18,091 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:18,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258956793] [2024-11-09 07:18:18,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258956793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:18,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:18,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:18:18,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576223428] [2024-11-09 07:18:18,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:18,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:18:18,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:18,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:18:18,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:18:18,094 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-09 07:18:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:18,670 INFO L93 Difference]: Finished difference Result 157 states and 187 transitions. [2024-11-09 07:18:18,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:18:18,671 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-09 07:18:18,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:18,672 INFO L225 Difference]: With dead ends: 157 [2024-11-09 07:18:18,672 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 07:18:18,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:18:18,673 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 193 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:18,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 119 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:18:18,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 07:18:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 134. [2024-11-09 07:18:18,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.5871559633027523) internal successors, (173), 133 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 173 transitions. [2024-11-09 07:18:18,679 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 173 transitions. Word has length 18 [2024-11-09 07:18:18,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:18,681 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 173 transitions. [2024-11-09 07:18:18,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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-09 07:18:18,682 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 173 transitions. [2024-11-09 07:18:18,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:18:18,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:18,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:18,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:18:18,684 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:18,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:18,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1375271456, now seen corresponding path program 1 times [2024-11-09 07:18:18,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:18,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630400137] [2024-11-09 07:18:18,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:18,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:18,769 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-09 07:18:18,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:18,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630400137] [2024-11-09 07:18:18,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630400137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:18,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:18,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:18:18,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130022553] [2024-11-09 07:18:18,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:18,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:18:18,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:18,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:18:18,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:18:18,773 INFO L87 Difference]: Start difference. First operand 134 states and 173 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:18,908 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions. [2024-11-09 07:18:18,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:18:18,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-09 07:18:18,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:18,910 INFO L225 Difference]: With dead ends: 150 [2024-11-09 07:18:18,911 INFO L226 Difference]: Without dead ends: 150 [2024-11-09 07:18:18,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 07:18:18,912 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 129 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:18,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 89 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:18:18,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-09 07:18:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 134. [2024-11-09 07:18:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 109 states have (on average 1.5504587155963303) internal successors, (169), 133 states have internal predecessors, (169), 0 states have call successors, (0), 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-09 07:18:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 169 transitions. [2024-11-09 07:18:18,917 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 169 transitions. Word has length 20 [2024-11-09 07:18:18,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:18,917 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 169 transitions. [2024-11-09 07:18:18,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:18,918 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 169 transitions. [2024-11-09 07:18:18,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:18:18,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:18,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:18,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:18:18,920 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:18,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash -316777118, now seen corresponding path program 1 times [2024-11-09 07:18:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:18,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847308337] [2024-11-09 07:18:18,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:18,990 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-09 07:18:18,991 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:18,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847308337] [2024-11-09 07:18:18,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847308337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:18,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:18,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:18:18,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84149892] [2024-11-09 07:18:18,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:18,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:18:18,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:18,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:18:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:18:18,993 INFO L87 Difference]: Start difference. First operand 134 states and 169 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:19,115 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions. [2024-11-09 07:18:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:18:19,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 07:18:19,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:19,116 INFO L225 Difference]: With dead ends: 147 [2024-11-09 07:18:19,116 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 07:18:19,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 07:18:19,117 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 124 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:19,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 98 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:18:19,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 07:18:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2024-11-09 07:18:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 134 states have internal predecessors, (169), 0 states have call successors, (0), 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-09 07:18:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2024-11-09 07:18:19,121 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 21 [2024-11-09 07:18:19,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:19,122 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2024-11-09 07:18:19,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:19,122 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2024-11-09 07:18:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:18:19,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:19,123 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:18:19,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:18:19,123 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:19,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:19,123 INFO L85 PathProgramCache]: Analyzing trace with hash 2080999643, now seen corresponding path program 1 times [2024-11-09 07:18:19,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:19,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180489554] [2024-11-09 07:18:19,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:19,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:19,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:19,305 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180489554] [2024-11-09 07:18:19,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180489554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:18:19,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:18:19,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:18:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202972453] [2024-11-09 07:18:19,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:18:19,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:18:19,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:18:19,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:18:19,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:18:19,307 INFO L87 Difference]: Start difference. First operand 135 states and 169 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:19,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:18:19,587 INFO L93 Difference]: Finished difference Result 169 states and 203 transitions. [2024-11-09 07:18:19,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:18:19,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 07:18:19,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:18:19,589 INFO L225 Difference]: With dead ends: 169 [2024-11-09 07:18:19,589 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 07:18:19,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:18:19,589 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 48 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:18:19,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 225 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:18:19,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 07:18:19,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 140. [2024-11-09 07:18:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 115 states have (on average 1.5130434782608695) internal successors, (174), 139 states have internal predecessors, (174), 0 states have call successors, (0), 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-09 07:18:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 174 transitions. [2024-11-09 07:18:19,593 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 174 transitions. Word has length 21 [2024-11-09 07:18:19,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:18:19,594 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 174 transitions. [2024-11-09 07:18:19,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:18:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 174 transitions. [2024-11-09 07:18:19,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:18:19,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:18:19,594 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] [2024-11-09 07:18:19,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:18:19,595 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:18:19,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:18:19,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1266442730, now seen corresponding path program 1 times [2024-11-09 07:18:19,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:18:19,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756593371] [2024-11-09 07:18:19,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:19,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:18:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:20,010 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:18:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756593371] [2024-11-09 07:18:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756593371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:18:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246006462] [2024-11-09 07:18:20,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:18:20,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:18:20,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:18:20,012 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:18:20,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:18:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:18:20,138 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 07:18:20,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:18:20,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:18:20,201 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:18:20,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:18:20,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:18:20,358 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:18:20,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 07:18:20,432 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:18:20,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 07:18:20,469 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:18:20,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 07:18:20,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:18:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:20,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:18:20,738 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_613))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_615)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:18:20,746 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_613))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_615)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:18:20,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:18:20,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-09 07:18:20,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:18:20,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 131 [2024-11-09 07:18:20,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:18:20,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 78 [2024-11-09 07:18:20,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2024-11-09 07:18:22,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:18:22,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246006462] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:18:22,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1948818642] [2024-11-09 07:18:22,798 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 07:18:22,799 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:18:22,803 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:18:22,809 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:18:22,809 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:18:29,695 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:19:37,049 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4367#(exists ((|v_ULTIMATE.start_main_~x~0#1.base_146| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_146|) 1)) (or (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_142| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_119| Int)) (and (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_118| Int) (|v_#memory_$Pointer$.offset_98| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_104| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_102| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_100| (Array Int (Array Int Int))) (|v_#memory_int_82| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_141| Int) (|v_#memory_int_83| (Array Int (Array Int Int)))) (and (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_118|) (= (store (store |v_#memory_$Pointer$.offset_98| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.offset_98| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) |v_ULTIMATE.start_main_~x~0#1.base_142| (store (select (store |v_#memory_$Pointer$.offset_98| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.offset_98| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) |v_ULTIMATE.start_main_~x~0#1.base_142|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_119|) (select (select |v_#memory_$Pointer$.offset_100| |v_ULTIMATE.start_main_~x~0#1.base_142|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_119|)))) |v_#memory_$Pointer$.offset_100|) (<= 1 |#StackHeapBarrier|) (= |v_#memory_int_83| (store |v_#memory_int_82| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_int_82| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 4) (select (select |v_#memory_int_83| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 4))))) (= |v_ULTIMATE.start_main_~x~0#1.base_142| (select (select (store |v_#memory_$Pointer$.base_102| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_102| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 4) |v_ULTIMATE.start_main_~x~0#1.base_141|)) |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_104| |v_ULTIMATE.start_main_~x~0#1.base_142| (store (select |v_#memory_$Pointer$.base_104| |v_ULTIMATE.start_main_~x~0#1.base_142|) |v_ULTIMATE.start_main_~x~0#1.offset_119| 0))) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_141|) 1) (= |v_#memory_$Pointer$.base_104| (store (store |v_#memory_$Pointer$.base_102| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_102| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 4) |v_ULTIMATE.start_main_~x~0#1.base_141|)) |v_ULTIMATE.start_main_~x~0#1.base_142| (store (select (store |v_#memory_$Pointer$.base_102| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.base_102| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 4) |v_ULTIMATE.start_main_~x~0#1.base_141|)) |v_ULTIMATE.start_main_~x~0#1.base_142|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_119|) (select (select |v_#memory_$Pointer$.base_104| |v_ULTIMATE.start_main_~x~0#1.base_142|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_119|))))) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_118|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_141|)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_100| |v_ULTIMATE.start_main_~x~0#1.base_142| (store (select |v_#memory_$Pointer$.offset_100| |v_ULTIMATE.start_main_~x~0#1.base_142|) |v_ULTIMATE.start_main_~x~0#1.offset_119| 0))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select (store |v_#memory_$Pointer$.offset_98| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) (store (select |v_#memory_$Pointer$.offset_98| (select (select |v_#memory_$Pointer$.base_102| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) (+ (select (select |v_#memory_$Pointer$.offset_98| |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_118|)) |v_ULTIMATE.start_main_~x~0#1.base_141|) |v_ULTIMATE.start_main_~x~0#1.offset_118|) |v_ULTIMATE.start_main_~x~0#1.offset_119|) (= |#memory_int| (store |v_#memory_int_83| |v_ULTIMATE.start_main_~x~0#1.base_142| (store (store (select |v_#memory_int_83| |v_ULTIMATE.start_main_~x~0#1.base_142|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_119|) 0) |v_ULTIMATE.start_main_~x~0#1.offset_119| (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_142|) |v_ULTIMATE.start_main_~x~0#1.offset_119|)))))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_119|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_142|) 1) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_119|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_142|)))) (= |v_ULTIMATE.start_main_~x~0#1.base_146| |ULTIMATE.start_main_~head~0#1.base|)) (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_145| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_122| Int)) (and (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_145|) |v_ULTIMATE.start_main_~x~0#1.offset_122|) |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_145|) 1) (= |v_ULTIMATE.start_main_~x~0#1.base_146| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_145|) |v_ULTIMATE.start_main_~x~0#1.offset_122|)) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_122|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_145|)) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_122|))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|)))))' at error location [2024-11-09 07:19:37,050 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:19:37,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:19:37,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2024-11-09 07:19:37,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965086311] [2024-11-09 07:19:37,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:19:37,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:19:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:19:37,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:19:37,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1356, Unknown=28, NotChecked=154, Total=1722 [2024-11-09 07:19:37,053 INFO L87 Difference]: Start difference. First operand 140 states and 174 transitions. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 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-09 07:19:39,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:39,745 INFO L93 Difference]: Finished difference Result 305 states and 379 transitions. [2024-11-09 07:19:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 07:19:39,746 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 07:19:39,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:39,747 INFO L225 Difference]: With dead ends: 305 [2024-11-09 07:19:39,747 INFO L226 Difference]: Without dead ends: 305 [2024-11-09 07:19:39,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 68.9s TimeCoverageRelationStatistics Valid=301, Invalid=2129, Unknown=28, NotChecked=194, Total=2652 [2024-11-09 07:19:39,749 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 728 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 606 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:39,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 344 Invalid, 1685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 919 Invalid, 0 Unknown, 606 Unchecked, 1.9s Time] [2024-11-09 07:19:39,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-09 07:19:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 180. [2024-11-09 07:19:39,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 155 states have (on average 1.5483870967741935) internal successors, (240), 179 states have internal predecessors, (240), 0 states have call successors, (0), 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-09 07:19:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 240 transitions. [2024-11-09 07:19:39,759 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 240 transitions. Word has length 21 [2024-11-09 07:19:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:39,759 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 240 transitions. [2024-11-09 07:19:39,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 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-09 07:19:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 240 transitions. [2024-11-09 07:19:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:19:39,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:39,760 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] [2024-11-09 07:19:39,783 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:19:39,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 07:19:39,961 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:19:39,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:39,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1266442729, now seen corresponding path program 1 times [2024-11-09 07:19:39,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:19:39,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746678435] [2024-11-09 07:19:39,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:39,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:19:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:19:40,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:19:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746678435] [2024-11-09 07:19:40,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746678435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:19:40,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851648647] [2024-11-09 07:19:40,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:40,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:19:40,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:19:40,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:19:40,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:19:40,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:40,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-09 07:19:40,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:40,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:19:40,968 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:19:40,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:19:40,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:19:41,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:19:41,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:19:41,261 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:19:41,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 07:19:41,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:19:41,399 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:19:41,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:19:41,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:19:41,442 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:19:41,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 07:19:41,528 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:19:41,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-09 07:19:41,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:19:41,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:19:41,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:19:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:19:41,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:19:42,094 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_719) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_720) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_719 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_719) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-09 07:19:42,218 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_716))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_715) .cse0 v_ArrVal_719) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_720) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_715) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_716) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_719) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-09 07:19:42,240 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_715) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_716) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_719) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_716 (Array Int Int)) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_720 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_716))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_715) .cse1 v_ArrVal_719) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_720) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2024-11-09 07:19:42,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:19:42,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2024-11-09 07:19:42,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:19:42,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2024-11-09 07:19:42,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:19:42,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 632 treesize of output 567 [2024-11-09 07:19:42,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:19:42,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1831 treesize of output 1742 [2024-11-09 07:19:42,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 547 treesize of output 523 [2024-11-09 07:19:42,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 523 treesize of output 515 [2024-11-09 07:19:42,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 515 treesize of output 491 [2024-11-09 07:19:42,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:19:42,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 491 treesize of output 447 [2024-11-09 07:19:43,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:19:43,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2024-11-09 07:19:43,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:19:43,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2024-11-09 07:19:43,702 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:19:43,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2024-11-09 07:19:43,709 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:19:43,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-09 07:19:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:19:43,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851648647] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:19:43,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1695219019] [2024-11-09 07:19:43,922 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 07:19:43,922 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:19:43,923 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:19:43,923 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:19:43,923 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:19:50,398 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:21:16,253 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '5039#(exists ((|v_ULTIMATE.start_main_~x~0#1.offset_135| Int) (|v_ULTIMATE.start_main_~x~0#1.base_160| Int)) (and (or (< |v_ULTIMATE.start_main_~x~0#1.offset_135| 0) (< (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_160|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_135|))) (or (and (= |v_ULTIMATE.start_main_~x~0#1.base_160| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_135|) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_156| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_131| Int)) (and (exists ((|v_#memory_$Pointer$.base_130| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_126| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_155| Int) (|v_#memory_int_104| (Array Int (Array Int Int))) (|v_#memory_int_105| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_128| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_130| Int) (|v_#memory_$Pointer$.offset_124| (Array Int (Array Int Int)))) (and (<= 1 |#StackHeapBarrier|) (= (select (select (store |v_#memory_$Pointer$.offset_124| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) (store (select |v_#memory_$Pointer$.offset_124| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|)) (+ (select (select |v_#memory_$Pointer$.offset_124| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_130|)) |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) |v_ULTIMATE.start_main_~x~0#1.offset_131|) (= (store (store |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) (store (select |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|)) (+ (select (select |v_#memory_$Pointer$.offset_124| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 4) |v_ULTIMATE.start_main_~x~0#1.base_155|)) |v_ULTIMATE.start_main_~x~0#1.base_156| (store (select (store |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) (store (select |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|)) (+ (select (select |v_#memory_$Pointer$.offset_124| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 4) |v_ULTIMATE.start_main_~x~0#1.base_155|)) |v_ULTIMATE.start_main_~x~0#1.base_156|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_131|) (select (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_main_~x~0#1.base_156|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_131|)))) |v_#memory_$Pointer$.base_130|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_main_~x~0#1.base_156| (store (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_main_~x~0#1.base_156|) |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))) (= (store |v_#memory_int_104| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) (store (select |v_#memory_int_104| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|)) (+ (select (select |v_#memory_$Pointer$.offset_124| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 4) (select (select |v_#memory_int_105| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|)) (+ (select (select |v_#memory_$Pointer$.offset_124| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 4)))) |v_#memory_int_105|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_main_~x~0#1.base_156| (store (select |v_#memory_$Pointer$.base_130| |v_ULTIMATE.start_main_~x~0#1.base_156|) |v_ULTIMATE.start_main_~x~0#1.offset_131| 0))) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_155|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (store (store |v_#memory_$Pointer$.offset_124| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) (store (select |v_#memory_$Pointer$.offset_124| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|)) (+ (select (select |v_#memory_$Pointer$.offset_124| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_130|)) |v_ULTIMATE.start_main_~x~0#1.base_156| (store (select (store |v_#memory_$Pointer$.offset_124| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) (store (select |v_#memory_$Pointer$.offset_124| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|)) (+ (select (select |v_#memory_$Pointer$.offset_124| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_130|)) |v_ULTIMATE.start_main_~x~0#1.base_156|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_131|) (select (select |v_#memory_$Pointer$.offset_126| |v_ULTIMATE.start_main_~x~0#1.base_156|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_131|)))) |v_#memory_$Pointer$.offset_126|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_130|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_130|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_155|)) (= |v_ULTIMATE.start_main_~x~0#1.base_156| (select (select (store |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) (store (select |v_#memory_$Pointer$.base_128| (select (select |v_#memory_$Pointer$.base_128| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|)) (+ (select (select |v_#memory_$Pointer$.offset_124| |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|) 4) |v_ULTIMATE.start_main_~x~0#1.base_155|)) |v_ULTIMATE.start_main_~x~0#1.base_155|) |v_ULTIMATE.start_main_~x~0#1.offset_130|)) (= |#memory_int| (store |v_#memory_int_105| |v_ULTIMATE.start_main_~x~0#1.base_156| (store (store (select |v_#memory_int_105| |v_ULTIMATE.start_main_~x~0#1.base_156|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_131|) 0) |v_ULTIMATE.start_main_~x~0#1.offset_131| (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_156|) |v_ULTIMATE.start_main_~x~0#1.offset_131|)))))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_131|) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_131|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_156|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_156|) 1)))) (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_159| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_134| Int)) (and (= |v_ULTIMATE.start_main_~x~0#1.offset_135| (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_134|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_159|) 1) (= |v_ULTIMATE.start_main_~x~0#1.base_160| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_159|) |v_ULTIMATE.start_main_~x~0#1.offset_134|)) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_134|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_159|)) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_134|))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|)))))' at error location [2024-11-09 07:21:16,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:21:16,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:21:16,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 27 [2024-11-09 07:21:16,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053743945] [2024-11-09 07:21:16,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:21:16,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 07:21:16,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:21:16,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 07:21:16,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1523, Unknown=42, NotChecked=246, Total=1980 [2024-11-09 07:21:16,256 INFO L87 Difference]: Start difference. First operand 180 states and 240 transitions. Second operand has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 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-09 07:21:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:21:19,865 INFO L93 Difference]: Finished difference Result 252 states and 300 transitions. [2024-11-09 07:21:19,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 07:21:19,866 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 07:21:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:21:19,867 INFO L225 Difference]: With dead ends: 252 [2024-11-09 07:21:19,867 INFO L226 Difference]: Without dead ends: 252 [2024-11-09 07:21:19,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 88.0s TimeCoverageRelationStatistics Valid=322, Invalid=2509, Unknown=43, NotChecked=318, Total=3192 [2024-11-09 07:21:19,868 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 502 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 2394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 701 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:21:19,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 587 Invalid, 2394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1573 Invalid, 0 Unknown, 701 Unchecked, 2.4s Time] [2024-11-09 07:21:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-09 07:21:19,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 178. [2024-11-09 07:21:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 157 states have (on average 1.4458598726114649) internal successors, (227), 177 states have internal predecessors, (227), 0 states have call successors, (0), 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-09 07:21:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 227 transitions. [2024-11-09 07:21:19,874 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 227 transitions. Word has length 21 [2024-11-09 07:21:19,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:21:19,874 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 227 transitions. [2024-11-09 07:21:19,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 28 states have internal predecessors, (60), 0 states have call successors, (0), 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-09 07:21:19,874 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 227 transitions. [2024-11-09 07:21:19,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:21:19,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:21:19,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:21:19,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:21:20,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 07:21:20,076 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:21:20,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:21:20,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1230155829, now seen corresponding path program 1 times [2024-11-09 07:21:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:21:20,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549248533] [2024-11-09 07:21:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:21:20,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:21:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:21:20,194 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-09 07:21:20,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:21:20,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549248533] [2024-11-09 07:21:20,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549248533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:21:20,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:21:20,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:21:20,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218757191] [2024-11-09 07:21:20,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:21:20,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:21:20,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:21:20,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:21:20,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:21:20,198 INFO L87 Difference]: Start difference. First operand 178 states and 227 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:21:20,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:21:20,418 INFO L93 Difference]: Finished difference Result 185 states and 231 transitions. [2024-11-09 07:21:20,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:21:20,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:21:20,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:21:20,420 INFO L225 Difference]: With dead ends: 185 [2024-11-09 07:21:20,420 INFO L226 Difference]: Without dead ends: 185 [2024-11-09 07:21:20,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-09 07:21:20,421 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 121 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:21:20,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 83 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:21:20,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-09 07:21:20,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2024-11-09 07:21:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 158 states have (on average 1.4367088607594938) internal successors, (227), 178 states have internal predecessors, (227), 0 states have call successors, (0), 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-09 07:21:20,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 227 transitions. [2024-11-09 07:21:20,427 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 227 transitions. Word has length 22 [2024-11-09 07:21:20,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:21:20,428 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 227 transitions. [2024-11-09 07:21:20,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:21:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 227 transitions. [2024-11-09 07:21:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:21:20,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:21:20,429 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:21:20,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:21:20,429 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:21:20,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:21:20,429 INFO L85 PathProgramCache]: Analyzing trace with hash 536461476, now seen corresponding path program 1 times [2024-11-09 07:21:20,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:21:20,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514144267] [2024-11-09 07:21:20,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:21:20,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:21:20,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:21:20,909 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-09 07:21:20,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:21:20,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514144267] [2024-11-09 07:21:20,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514144267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:21:20,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:21:20,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:21:20,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704959227] [2024-11-09 07:21:20,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:21:20,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:21:20,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:21:20,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:21:20,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:21:20,912 INFO L87 Difference]: Start difference. First operand 179 states and 227 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:21:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:21:21,667 INFO L93 Difference]: Finished difference Result 216 states and 271 transitions. [2024-11-09 07:21:21,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:21:21,668 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 07:21:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:21:21,669 INFO L225 Difference]: With dead ends: 216 [2024-11-09 07:21:21,669 INFO L226 Difference]: Without dead ends: 216 [2024-11-09 07:21:21,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:21:21,670 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 136 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:21:21,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 221 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:21:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-09 07:21:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 190. [2024-11-09 07:21:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.4201183431952662) internal successors, (240), 189 states have internal predecessors, (240), 0 states have call successors, (0), 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-09 07:21:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 240 transitions. [2024-11-09 07:21:21,675 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 240 transitions. Word has length 22 [2024-11-09 07:21:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:21:21,675 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 240 transitions. [2024-11-09 07:21:21,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:21:21,676 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 240 transitions. [2024-11-09 07:21:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:21:21,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:21:21,676 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:21:21,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 07:21:21,677 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:21:21,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:21:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash -522802869, now seen corresponding path program 1 times [2024-11-09 07:21:21,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:21:21,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089496339] [2024-11-09 07:21:21,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:21:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:21:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:21:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:21:22,403 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:21:22,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089496339] [2024-11-09 07:21:22,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089496339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:21:22,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149094400] [2024-11-09 07:21:22,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:21:22,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:21:22,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:21:22,405 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:21:22,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:21:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:21:22,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 07:21:22,546 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:21:22,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:21:22,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:21:22,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:21:22,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:21:22,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-09 07:21:22,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:21:22,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-11-09 07:21:22,971 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:21:22,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:21:23,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 07:21:23,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2024-11-09 07:21:23,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-09 07:21:23,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2024-11-09 07:21:23,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-11-09 07:21:23,309 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 07:21:23,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 49 [2024-11-09 07:21:23,844 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:21:23,861 INFO L349 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2024-11-09 07:21:23,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 41 [2024-11-09 07:21:23,896 INFO L349 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2024-11-09 07:21:23,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 19 [2024-11-09 07:21:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:21:23,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:21:24,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:24,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2024-11-09 07:21:24,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:24,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2024-11-09 07:21:26,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:26,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 39 [2024-11-09 07:21:26,350 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:21:26,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:26,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2024-11-09 07:21:26,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:26,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-11-09 07:21:26,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2024-11-09 07:21:26,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:26,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 07:21:26,555 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:21:26,556 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:21:26,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-11-09 07:21:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:21:26,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149094400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:21:26,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1484880] [2024-11-09 07:21:26,734 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 07:21:26,734 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:21:26,734 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:21:26,734 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:21:26,734 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:21:27,372 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:21:39,479 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6475#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_174| Int)) (not (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_174|) 1))))' at error location [2024-11-09 07:21:39,479 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:21:39,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:21:39,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 26 [2024-11-09 07:21:39,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92247871] [2024-11-09 07:21:39,480 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:21:39,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:21:39,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:21:39,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:21:39,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1522, Unknown=13, NotChecked=0, Total=1806 [2024-11-09 07:21:39,481 INFO L87 Difference]: Start difference. First operand 190 states and 240 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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-09 07:21:42,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:21:42,620 INFO L93 Difference]: Finished difference Result 229 states and 287 transitions. [2024-11-09 07:21:42,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:21:42,621 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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 23 [2024-11-09 07:21:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:21:42,622 INFO L225 Difference]: With dead ends: 229 [2024-11-09 07:21:42,622 INFO L226 Difference]: Without dead ends: 229 [2024-11-09 07:21:42,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=404, Invalid=2445, Unknown=13, NotChecked=0, Total=2862 [2024-11-09 07:21:42,624 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 228 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:21:42,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 489 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 07:21:42,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-09 07:21:42,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 206. [2024-11-09 07:21:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 185 states have (on average 1.4108108108108108) internal successors, (261), 205 states have internal predecessors, (261), 0 states have call successors, (0), 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-09 07:21:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 261 transitions. [2024-11-09 07:21:42,630 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 261 transitions. Word has length 23 [2024-11-09 07:21:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:21:42,630 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 261 transitions. [2024-11-09 07:21:42,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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-09 07:21:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 261 transitions. [2024-11-09 07:21:42,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:21:42,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:21:42,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:21:42,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:21:42,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-09 07:21:42,832 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:21:42,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:21:42,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1615776181, now seen corresponding path program 1 times [2024-11-09 07:21:42,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:21:42,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874248258] [2024-11-09 07:21:42,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:21:42,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:21:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:21:43,260 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-09 07:21:43,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:21:43,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874248258] [2024-11-09 07:21:43,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874248258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:21:43,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:21:43,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:21:43,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371810996] [2024-11-09 07:21:43,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:21:43,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:21:43,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:21:43,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:21:43,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:21:43,262 INFO L87 Difference]: Start difference. First operand 206 states and 261 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:21:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:21:43,909 INFO L93 Difference]: Finished difference Result 226 states and 279 transitions. [2024-11-09 07:21:43,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:21:43,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-09 07:21:43,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:21:43,910 INFO L225 Difference]: With dead ends: 226 [2024-11-09 07:21:43,910 INFO L226 Difference]: Without dead ends: 226 [2024-11-09 07:21:43,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:21:43,911 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 45 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:21:43,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 234 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:21:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-09 07:21:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2024-11-09 07:21:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 197 states have (on average 1.385786802030457) internal successors, (273), 217 states have internal predecessors, (273), 0 states have call successors, (0), 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-09 07:21:43,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 273 transitions. [2024-11-09 07:21:43,918 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 273 transitions. Word has length 23 [2024-11-09 07:21:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:21:43,918 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 273 transitions. [2024-11-09 07:21:43,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:21:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 273 transitions. [2024-11-09 07:21:43,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:21:43,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:21:43,921 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] [2024-11-09 07:21:43,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:21:43,921 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:21:43,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:21:43,922 INFO L85 PathProgramCache]: Analyzing trace with hash 322005273, now seen corresponding path program 1 times [2024-11-09 07:21:43,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:21:43,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355337126] [2024-11-09 07:21:43,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:21:43,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:21:43,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:21:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:21:44,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:21:44,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355337126] [2024-11-09 07:21:44,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355337126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:21:44,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462258191] [2024-11-09 07:21:44,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:21:44,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:21:44,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:21:44,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:21:44,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:21:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:21:44,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-09 07:21:44,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:21:44,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:21:44,803 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:21:44,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:21:44,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:21:45,084 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:21:45,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 07:21:45,191 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:21:45,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 07:21:45,238 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:21:45,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 07:21:45,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-09 07:21:45,429 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2024-11-09 07:21:45,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2024-11-09 07:21:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:21:45,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:21:45,697 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1076 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1076) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:21:45,705 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1074 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1074))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1076)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:21:45,714 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1076 (Array Int Int)) (v_ArrVal_1074 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1074))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1076)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:21:45,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:45,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2024-11-09 07:21:45,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:45,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2024-11-09 07:21:45,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 163 [2024-11-09 07:21:45,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:21:45,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 159 [2024-11-09 07:21:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:21:48,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462258191] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:21:48,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [516436156] [2024-11-09 07:21:48,159 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 07:21:48,159 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:21:48,160 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:21:48,160 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:21:48,160 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:21:54,375 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:24:53,443 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 273 DAG size of output: 177 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:25:27,379 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7577#(and (<= (+ 12 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (exists ((|v_ULTIMATE.start_main_#t~nondet9#1_21| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet9#1_21| 0)) (<= |v_ULTIMATE.start_main_#t~nondet9#1_21| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet9#1_21| 2147483648)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (exists ((|v_#valid_131| (Array Int Int)) (|v_#memory_$Pointer$.offset_170| (Array Int (Array Int Int))) (|v_#length_118| (Array Int Int)) (|v_#memory_$Pointer$.base_180| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_172| (Array Int (Array Int Int))) (|v_#memory_int_144| (Array Int (Array Int Int))) (|v_#memory_int_145| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_179| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_178| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_182| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_155| Int)) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_172| |ULTIMATE.start_main_~x~0#1.base| (store (select |v_#memory_$Pointer$.offset_172| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~y~0#1.offset|))) (not (= (select (select |v_#memory_$Pointer$.base_179| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) (= (select |v_#valid_131| |v_ULTIMATE.start_main_~x~0#1.base_182|) 1) (or (not (= (select (select |v_#memory_$Pointer$.base_178| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~y~0#1.offset| 0))) (= (select (select |v_#memory_$Pointer$.offset_170| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~y~0#1.offset|) (<= (+ (select (select |v_#memory_$Pointer$.base_179| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) |#StackHeapBarrier|) (= (store |v_#memory_$Pointer$.base_179| |ULTIMATE.start_main_~x~0#1.base| (store (select |v_#memory_$Pointer$.base_179| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (select (select |v_#memory_$Pointer$.base_180| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)))) |v_#memory_$Pointer$.base_180|) (= (store |v_#memory_$Pointer$.base_180| |ULTIMATE.start_main_~x~0#1.base| (store (select |v_#memory_$Pointer$.base_180| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| (select (select |v_#memory_$Pointer$.base_178| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) |#memory_$Pointer$.base|) (= (store |v_#length_118| (select (select |v_#memory_$Pointer$.base_179| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12) |#length|) (= (store |v_#valid_131| (select (select |v_#memory_$Pointer$.base_179| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) |#valid|) (not (= (select |#valid| (select (select |v_#memory_$Pointer$.base_178| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_155|) (select |v_#length_118| |v_ULTIMATE.start_main_~x~0#1.base_182|)) (= |v_#memory_$Pointer$.offset_172| (store |v_#memory_$Pointer$.offset_170| |ULTIMATE.start_main_~x~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_170| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| 0) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (select (select |v_#memory_$Pointer$.offset_172| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))) (= (select |v_#valid_131| |ULTIMATE.start_main_~x~0#1.base|) 1) (= |v_#memory_$Pointer$.base_179| (store |v_#memory_$Pointer$.base_178| |ULTIMATE.start_main_~x~0#1.base| (store (select |v_#memory_$Pointer$.base_178| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| (select (select |v_#memory_$Pointer$.base_179| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= (select |v_#valid_131| (select (select |v_#memory_$Pointer$.base_179| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.offset_154| Int) (|v_ULTIMATE.start_main_~x~0#1.base_181| Int) (|v_#memory_$Pointer$.offset_167| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_177| (Array Int (Array Int Int))) (|v_#memory_int_141| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_175| (Array Int (Array Int Int))) (|v_#memory_int_142| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_169| (Array Int (Array Int Int)))) (and (<= 1 |#StackHeapBarrier|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_154|) (select |v_#length_118| |v_ULTIMATE.start_main_~x~0#1.base_181|)) (= (store |v_#memory_$Pointer$.offset_169| |v_ULTIMATE.start_main_~x~0#1.base_182| (store (select |v_#memory_$Pointer$.offset_169| |v_ULTIMATE.start_main_~x~0#1.base_182|) |v_ULTIMATE.start_main_~x~0#1.offset_155| 0)) |v_#memory_$Pointer$.offset_170|) (= (select (select (store |v_#memory_$Pointer$.offset_167| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|) (store (select |v_#memory_$Pointer$.offset_167| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_167| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|) |v_ULTIMATE.start_main_~x~0#1.offset_155|) (= |v_#memory_$Pointer$.base_177| (store (store |v_#memory_$Pointer$.base_175| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|) (store (select |v_#memory_$Pointer$.base_175| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_167| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) |v_ULTIMATE.start_main_~x~0#1.base_181|)) |v_ULTIMATE.start_main_~x~0#1.base_182| (store (select (store |v_#memory_$Pointer$.base_175| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|) (store (select |v_#memory_$Pointer$.base_175| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_167| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) |v_ULTIMATE.start_main_~x~0#1.base_181|)) |v_ULTIMATE.start_main_~x~0#1.base_182|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_155|) (select (select |v_#memory_$Pointer$.base_177| |v_ULTIMATE.start_main_~x~0#1.base_182|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_155|))))) (= |v_ULTIMATE.start_main_~x~0#1.base_182| (select (select (store |v_#memory_$Pointer$.base_175| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|) (store (select |v_#memory_$Pointer$.base_175| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_167| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) |v_ULTIMATE.start_main_~x~0#1.base_181|)) |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) (= (store |v_#memory_$Pointer$.base_177| |v_ULTIMATE.start_main_~x~0#1.base_182| (store (select |v_#memory_$Pointer$.base_177| |v_ULTIMATE.start_main_~x~0#1.base_182|) |v_ULTIMATE.start_main_~x~0#1.offset_155| 0)) |v_#memory_$Pointer$.base_178|) (= |v_#memory_$Pointer$.offset_169| (store (store |v_#memory_$Pointer$.offset_167| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|) (store (select |v_#memory_$Pointer$.offset_167| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_167| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) |v_ULTIMATE.start_main_~x~0#1.base_182| (store (select (store |v_#memory_$Pointer$.offset_167| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|) (store (select |v_#memory_$Pointer$.offset_167| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_167| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) |v_ULTIMATE.start_main_~x~0#1.base_182|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_155|) (select (select |v_#memory_$Pointer$.offset_169| |v_ULTIMATE.start_main_~x~0#1.base_182|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_155|))))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_154|) (= (store |v_#memory_int_141| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|) (store (select |v_#memory_int_141| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_167| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) (select (select |v_#memory_int_142| (select (select |v_#memory_$Pointer$.base_175| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|)) (+ 4 (select (select |v_#memory_$Pointer$.offset_167| |v_ULTIMATE.start_main_~x~0#1.base_181|) |v_ULTIMATE.start_main_~x~0#1.offset_154|))))) |v_#memory_int_142|) (= (store |v_#memory_int_142| |v_ULTIMATE.start_main_~x~0#1.base_182| (store (store (select |v_#memory_int_142| |v_ULTIMATE.start_main_~x~0#1.base_182|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_155|) 0) |v_ULTIMATE.start_main_~x~0#1.offset_155| (select (select |v_#memory_int_144| |v_ULTIMATE.start_main_~x~0#1.base_182|) |v_ULTIMATE.start_main_~x~0#1.offset_155|))) |v_#memory_int_144|) (= (select |v_#valid_131| |v_ULTIMATE.start_main_~x~0#1.base_181|) 1))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_155|) (= |#memory_int| (store |v_#memory_int_145| |ULTIMATE.start_main_~x~0#1.base| (store (store (select |v_#memory_int_145| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) 1) |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= (store |v_#memory_int_144| |ULTIMATE.start_main_~x~0#1.base| (store (select |v_#memory_int_144| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| (select (select |v_#memory_int_145| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) |v_#memory_int_145|))))' at error location [2024-11-09 07:25:27,379 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:25:27,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:25:27,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2024-11-09 07:25:27,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16050276] [2024-11-09 07:25:27,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:25:27,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 07:25:27,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:25:27,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 07:25:27,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1620, Unknown=69, NotChecked=258, Total=2162 [2024-11-09 07:25:27,382 INFO L87 Difference]: Start difference. First operand 218 states and 273 transitions. Second operand has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 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-09 07:25:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:25:29,892 INFO L93 Difference]: Finished difference Result 343 states and 399 transitions. [2024-11-09 07:25:29,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 07:25:29,893 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 07:25:29,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:25:29,894 INFO L225 Difference]: With dead ends: 343 [2024-11-09 07:25:29,894 INFO L226 Difference]: Without dead ends: 343 [2024-11-09 07:25:29,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 215.0s TimeCoverageRelationStatistics Valid=334, Invalid=2470, Unknown=70, NotChecked=318, Total=3192 [2024-11-09 07:25:29,895 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 427 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 995 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 801 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:25:29,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 388 Invalid, 1886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 995 Invalid, 0 Unknown, 801 Unchecked, 1.8s Time] [2024-11-09 07:25:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-09 07:25:29,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 223. [2024-11-09 07:25:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 203 states have (on average 1.374384236453202) internal successors, (279), 222 states have internal predecessors, (279), 0 states have call successors, (0), 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-09 07:25:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 279 transitions. [2024-11-09 07:25:29,902 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 279 transitions. Word has length 25 [2024-11-09 07:25:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:25:29,902 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 279 transitions. [2024-11-09 07:25:29,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 25 states have internal predecessors, (59), 0 states have call successors, (0), 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-09 07:25:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 279 transitions. [2024-11-09 07:25:29,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:25:29,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:25:29,903 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] [2024-11-09 07:25:29,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:25:30,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-09 07:25:30,107 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:25:30,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:25:30,108 INFO L85 PathProgramCache]: Analyzing trace with hash 322005274, now seen corresponding path program 1 times [2024-11-09 07:25:30,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:25:30,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968038311] [2024-11-09 07:25:30,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:30,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:25:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:25:30,916 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:25:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968038311] [2024-11-09 07:25:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968038311] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:25:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306495968] [2024-11-09 07:25:30,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:25:30,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:25:30,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:25:30,918 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:25:30,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:25:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:25:31,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-09 07:25:31,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:25:31,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:25:31,213 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:25:31,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:25:31,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:25:31,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:25:31,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:25:31,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:25:31,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:25:31,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2024-11-09 07:25:31,713 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:25:31,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:25:31,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:25:31,754 INFO L349 Elim1Store]: treesize reduction 46, result has 9.8 percent of original size [2024-11-09 07:25:31,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 36 [2024-11-09 07:25:31,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:25:31,873 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:25:31,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 58 [2024-11-09 07:25:31,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 24 [2024-11-09 07:25:32,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2024-11-09 07:25:32,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-09 07:25:32,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:25:32,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:25:32,282 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 07:25:32,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 07:25:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:25:32,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:25:33,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:25:33,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 131 [2024-11-09 07:25:33,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 103 [2024-11-09 07:25:33,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 101 [2024-11-09 07:25:34,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:25:34,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2024-11-09 07:25:34,075 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:25:34,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2024-11-09 07:25:34,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2024-11-09 07:25:35,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:25:35,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 849 treesize of output 1048 [2024-11-09 07:25:38,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:25:38,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306495968] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:25:38,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1672349383] [2024-11-09 07:25:38,226 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 07:25:38,226 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:25:38,226 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:25:38,226 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:25:38,226 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:25:44,220 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:28:52,019 WARN L286 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 273 DAG size of output: 177 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:29:29,598 WARN L286 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 278 DAG size of output: 177 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 07:29:29,599 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8364#(and (<= (+ 12 |ULTIMATE.start_main_~x~0#1.offset|) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (exists ((|v_#memory_$Pointer$.offset_203| (Array Int (Array Int Int))) (|v_#valid_141| (Array Int Int)) (|v_#length_128| (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_190| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_163| Int) (|v_#memory_$Pointer$.base_212| (Array Int (Array Int Int))) (|v_#memory_int_172| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_211| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_210| (Array Int (Array Int Int))) (|v_#memory_int_173| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_201| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_173| |ULTIMATE.start_main_~x~0#1.base| (store (store (select |v_#memory_int_173| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) 1) |ULTIMATE.start_main_~x~0#1.offset| (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= (select |v_#valid_141| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |v_#valid_141| |v_ULTIMATE.start_main_~x~0#1.base_190|) 1) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_163|) (exists ((|v_#memory_int_170| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_189| Int) (|v_#memory_$Pointer$.base_209| (Array Int (Array Int Int))) (|v_#memory_int_169| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_207| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_162| Int) (|v_#memory_$Pointer$.offset_198| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_200| (Array Int (Array Int Int)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_198| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) (store (select |v_#memory_$Pointer$.offset_198| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|)) (+ (select (select |v_#memory_$Pointer$.offset_198| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_162|)) |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) |v_ULTIMATE.start_main_~x~0#1.offset_163|) (<= 1 |#StackHeapBarrier|) (= (store (store |v_#memory_$Pointer$.base_207| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) (store (select |v_#memory_$Pointer$.base_207| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|)) (+ (select (select |v_#memory_$Pointer$.offset_198| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) 4) |v_ULTIMATE.start_main_~x~0#1.base_189|)) |v_ULTIMATE.start_main_~x~0#1.base_190| (store (select (store |v_#memory_$Pointer$.base_207| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) (store (select |v_#memory_$Pointer$.base_207| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|)) (+ (select (select |v_#memory_$Pointer$.offset_198| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) 4) |v_ULTIMATE.start_main_~x~0#1.base_189|)) |v_ULTIMATE.start_main_~x~0#1.base_190|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_163|) (select (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_190|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_163|)))) |v_#memory_$Pointer$.base_209|) (= (select |v_#valid_141| |v_ULTIMATE.start_main_~x~0#1.base_189|) 1) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_162|) (select |v_#length_128| |v_ULTIMATE.start_main_~x~0#1.base_189|)) (= (store |v_#memory_int_169| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) (store (select |v_#memory_int_169| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|)) (+ (select (select |v_#memory_$Pointer$.offset_198| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) 4) (select (select |v_#memory_int_170| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|)) (+ (select (select |v_#memory_$Pointer$.offset_198| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) 4)))) |v_#memory_int_170|) (= |v_ULTIMATE.start_main_~x~0#1.base_190| (select (select (store |v_#memory_$Pointer$.base_207| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) (store (select |v_#memory_$Pointer$.base_207| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|)) (+ (select (select |v_#memory_$Pointer$.offset_198| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) 4) |v_ULTIMATE.start_main_~x~0#1.base_189|)) |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (store (store |v_#memory_$Pointer$.offset_198| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) (store (select |v_#memory_$Pointer$.offset_198| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|)) (+ (select (select |v_#memory_$Pointer$.offset_198| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_162|)) |v_ULTIMATE.start_main_~x~0#1.base_190| (store (select (store |v_#memory_$Pointer$.offset_198| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) (store (select |v_#memory_$Pointer$.offset_198| (select (select |v_#memory_$Pointer$.base_207| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|)) (+ (select (select |v_#memory_$Pointer$.offset_198| |v_ULTIMATE.start_main_~x~0#1.base_189|) |v_ULTIMATE.start_main_~x~0#1.offset_162|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_162|)) |v_ULTIMATE.start_main_~x~0#1.base_190|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_163|) (select (select |v_#memory_$Pointer$.offset_200| |v_ULTIMATE.start_main_~x~0#1.base_190|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_163|)))) |v_#memory_$Pointer$.offset_200|) (= |v_#memory_int_172| (store |v_#memory_int_170| |v_ULTIMATE.start_main_~x~0#1.base_190| (store (store (select |v_#memory_int_170| |v_ULTIMATE.start_main_~x~0#1.base_190|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_163|) 0) |v_ULTIMATE.start_main_~x~0#1.offset_163| (select (select |v_#memory_int_172| |v_ULTIMATE.start_main_~x~0#1.base_190|) |v_ULTIMATE.start_main_~x~0#1.offset_163|)))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_162|) (= |v_#memory_$Pointer$.offset_201| (store |v_#memory_$Pointer$.offset_200| |v_ULTIMATE.start_main_~x~0#1.base_190| (store (select |v_#memory_$Pointer$.offset_200| |v_ULTIMATE.start_main_~x~0#1.base_190|) |v_ULTIMATE.start_main_~x~0#1.offset_163| 0))) (= (store |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_190| (store (select |v_#memory_$Pointer$.base_209| |v_ULTIMATE.start_main_~x~0#1.base_190|) |v_ULTIMATE.start_main_~x~0#1.offset_163| 0)) |v_#memory_$Pointer$.base_210|))) (= (store |v_#memory_$Pointer$.base_211| |ULTIMATE.start_main_~x~0#1.base| (store (select |v_#memory_$Pointer$.base_211| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (select (select |v_#memory_$Pointer$.base_212| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)))) |v_#memory_$Pointer$.base_212|) (or (not (= (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) (not (= 0 (select (select |v_#memory_$Pointer$.base_210| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_#memory_$Pointer$.base_211| (store |v_#memory_$Pointer$.base_210| |ULTIMATE.start_main_~x~0#1.base| (store (select |v_#memory_$Pointer$.base_210| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| (select (select |v_#memory_$Pointer$.base_211| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_203| |ULTIMATE.start_main_~x~0#1.base| (store (select |v_#memory_$Pointer$.offset_203| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))) (= (store |v_#length_128| (select (select |v_#memory_$Pointer$.base_211| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 12) |#length|) (= (store |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base| (store (store (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| 0) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) (select (select |v_#memory_$Pointer$.offset_203| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)))) |v_#memory_$Pointer$.offset_203|) (not (= (select (select |v_#memory_$Pointer$.base_211| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) (= (store |v_#valid_141| (select (select |v_#memory_$Pointer$.base_211| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) |#valid|) (= (store |v_#memory_int_172| |ULTIMATE.start_main_~x~0#1.base| (store (select |v_#memory_int_172| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| (select (select |v_#memory_int_173| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) |v_#memory_int_173|) (= (select |v_#valid_141| (select (select |v_#memory_$Pointer$.base_211| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 0) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_163|) (select |v_#length_128| |v_ULTIMATE.start_main_~x~0#1.base_190|)) (= (store |v_#memory_$Pointer$.base_212| |ULTIMATE.start_main_~x~0#1.base| (store (select |v_#memory_$Pointer$.base_212| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| (select (select |v_#memory_$Pointer$.base_210| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) |#memory_$Pointer$.base|) (or (< (select |#length| (select (select |v_#memory_$Pointer$.base_210| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) (< (+ (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) 0)) (<= (+ (select (select |v_#memory_$Pointer$.base_211| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 1) |#StackHeapBarrier|))) (exists ((|v_ULTIMATE.start_main_#t~nondet9#1_23| Int)) (and (not (= |v_ULTIMATE.start_main_#t~nondet9#1_23| 0)) (<= |v_ULTIMATE.start_main_#t~nondet9#1_23| 2147483647) (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet9#1_23| 2147483648)))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))' at error location [2024-11-09 07:29:29,599 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:29:29,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:29:29,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 31 [2024-11-09 07:29:29,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115602767] [2024-11-09 07:29:29,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:29:29,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 07:29:29,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:29:29,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 07:29:29,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=2517, Unknown=62, NotChecked=0, Total=2862 [2024-11-09 07:29:29,603 INFO L87 Difference]: Start difference. First operand 223 states and 279 transitions. Second operand has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 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-09 07:29:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:29:42,148 INFO L93 Difference]: Finished difference Result 295 states and 343 transitions. [2024-11-09 07:29:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:29:42,149 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 07:29:42,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:29:42,150 INFO L225 Difference]: With dead ends: 295 [2024-11-09 07:29:42,150 INFO L226 Difference]: Without dead ends: 295 [2024-11-09 07:29:42,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 235.4s TimeCoverageRelationStatistics Valid=490, Invalid=4003, Unknown=63, NotChecked=0, Total=4556 [2024-11-09 07:29:42,152 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 413 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:29:42,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 741 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-09 07:29:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-09 07:29:42,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 222. [2024-11-09 07:29:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 203 states have (on average 1.3596059113300492) internal successors, (276), 221 states have internal predecessors, (276), 0 states have call successors, (0), 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-09 07:29:42,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 276 transitions. [2024-11-09 07:29:42,158 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 276 transitions. Word has length 25 [2024-11-09 07:29:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:29:42,159 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 276 transitions. [2024-11-09 07:29:42,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 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-09 07:29:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 276 transitions. [2024-11-09 07:29:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:29:42,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:29:42,160 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:29:42,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 07:29:42,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:29:42,361 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:29:42,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:29:42,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1859027613, now seen corresponding path program 2 times [2024-11-09 07:29:42,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:29:42,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692858814] [2024-11-09 07:29:42,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:29:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:29:42,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:29:43,197 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:29:43,197 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:29:43,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692858814] [2024-11-09 07:29:43,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692858814] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:29:43,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528692126] [2024-11-09 07:29:43,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:29:43,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:29:43,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:29:43,202 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:29:43,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:29:43,523 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 07:29:43,524 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:29:43,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 07:29:43,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:29:43,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:29:43,725 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:29:43,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:29:43,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:29:43,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:29:44,067 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:29:44,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-09 07:29:44,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:29:44,227 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:29:44,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 17 [2024-11-09 07:29:44,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:29:44,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:29:44,296 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:29:44,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2024-11-09 07:29:44,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2024-11-09 07:29:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:29:45,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:29:46,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:46,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-11-09 07:29:46,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:46,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2024-11-09 07:29:46,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:46,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2024-11-09 07:29:46,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:46,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2024-11-09 07:29:51,412 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1319 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1319))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1318 (Array Int Int)) (v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_168| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1318))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (< (select (select (store .cse0 .cse1 v_arrayElimArr_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_168|) (not (= (select v_arrayElimArr_11 .cse2) 0)) (< |v_ULTIMATE.start_main_~x~0#1.offset_168| 0) (= 0 (select (let ((.cse3 (store .cse4 .cse1 v_arrayElimArr_11))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) |v_ULTIMATE.start_main_~x~0#1.offset_168|)) (not (= (select v_arrayElimArr_12 .cse2) 0)))))) (< .cse2 0))))) (forall ((v_ArrVal_1319 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1319))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1318 (Array Int Int)) (v_arrayElimArr_13 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_168| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1318))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse7 (store .cse10 .cse9 v_arrayElimArr_14))) (or (not (= (select v_arrayElimArr_13 .cse6) 0)) (not (= (select v_arrayElimArr_14 .cse6) 0)) (= (select (select .cse7 (select (select (store .cse8 .cse9 v_arrayElimArr_13) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) |v_ULTIMATE.start_main_~x~0#1.offset_168|) 0) (< |v_ULTIMATE.start_main_~x~0#1.offset_168| 0) (< (select (select .cse7 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_168|)))))) (< .cse6 0))))))) is different from false [2024-11-09 07:29:51,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:51,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 134 [2024-11-09 07:29:51,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:51,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 66 [2024-11-09 07:29:51,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:51,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 343 treesize of output 306 [2024-11-09 07:29:51,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:51,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 920 treesize of output 959 [2024-11-09 07:29:52,186 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:52,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 434 treesize of output 420 [2024-11-09 07:29:52,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:52,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 444 treesize of output 400 [2024-11-09 07:29:52,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:52,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 409 treesize of output 415 [2024-11-09 07:29:52,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:29:52,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 393 treesize of output 411 [2024-11-09 07:31:18,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:31:18,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2024-11-09 07:31:18,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:31:18,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 66 [2024-11-09 07:31:18,621 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:31:18,854 INFO L349 Elim1Store]: treesize reduction 64, result has 45.8 percent of original size [2024-11-09 07:31:18,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1196 treesize of output 849 [2024-11-09 07:31:18,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:31:18,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:31:18,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 116 [2024-11-09 07:31:18,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-11-09 07:31:19,047 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:31:19,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 31 [2024-11-09 07:31:19,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:31:19,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2024-11-09 07:31:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:31:19,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528692126] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:31:19,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1961088084] [2024-11-09 07:31:19,645 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 07:31:19,645 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:31:19,646 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:31:19,646 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:31:19,646 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:31:25,614 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 07:32:39,476 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '9111#(exists ((|v_ULTIMATE.start_main_~x~0#1.base_206| Int)) (and (not (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_206|) 1)) (or (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_205| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_178| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_205|) 1) (= |v_ULTIMATE.start_main_~x~0#1.base_206| (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_205|) |v_ULTIMATE.start_main_~x~0#1.offset_178|)) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_178|) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_205|) |v_ULTIMATE.start_main_~x~0#1.offset_178|) |ULTIMATE.start_main_~x~0#1.offset|) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_178|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_205|)))) (<= 0 |ULTIMATE.start_main_~head~0#1.offset|)) (and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_202| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_175| Int)) (and (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_202|) 1) (exists ((|v_#memory_$Pointer$.offset_227| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.base_201| Int) (|v_#memory_$Pointer$.offset_229| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_238| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.base_236| (Array Int (Array Int Int))) (|v_ULTIMATE.start_main_~x~0#1.offset_174| Int) (|v_#memory_int_194| (Array Int (Array Int Int))) (|v_#memory_int_195| (Array Int (Array Int Int)))) (and (= |v_ULTIMATE.start_main_~x~0#1.base_202| (select (select (store |v_#memory_$Pointer$.base_236| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) (store (select |v_#memory_$Pointer$.base_236| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) (+ (select (select |v_#memory_$Pointer$.offset_227| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) 4) |v_ULTIMATE.start_main_~x~0#1.base_201|)) |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) (<= 1 |#StackHeapBarrier|) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_229| |v_ULTIMATE.start_main_~x~0#1.base_202| (store (select |v_#memory_$Pointer$.offset_229| |v_ULTIMATE.start_main_~x~0#1.base_202|) |v_ULTIMATE.start_main_~x~0#1.offset_175| 0))) (= (store |v_#memory_int_194| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) (store (select |v_#memory_int_194| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) (+ (select (select |v_#memory_$Pointer$.offset_227| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) 4) (select (select |v_#memory_int_195| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) (+ (select (select |v_#memory_$Pointer$.offset_227| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) 4)))) |v_#memory_int_195|) (= (store (store |v_#memory_$Pointer$.base_236| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) (store (select |v_#memory_$Pointer$.base_236| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) (+ (select (select |v_#memory_$Pointer$.offset_227| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) 4) |v_ULTIMATE.start_main_~x~0#1.base_201|)) |v_ULTIMATE.start_main_~x~0#1.base_202| (store (select (store |v_#memory_$Pointer$.base_236| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) (store (select |v_#memory_$Pointer$.base_236| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) (+ (select (select |v_#memory_$Pointer$.offset_227| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) 4) |v_ULTIMATE.start_main_~x~0#1.base_201|)) |v_ULTIMATE.start_main_~x~0#1.base_202|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_175|) (select (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_main_~x~0#1.base_202|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_175|)))) |v_#memory_$Pointer$.base_238|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_174|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_201|)) (= |v_ULTIMATE.start_main_~x~0#1.offset_175| (select (select (store |v_#memory_$Pointer$.offset_227| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) (store (select |v_#memory_$Pointer$.offset_227| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) (+ (select (select |v_#memory_$Pointer$.offset_227| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_201|) 1) (= |v_#memory_$Pointer$.offset_229| (store (store |v_#memory_$Pointer$.offset_227| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) (store (select |v_#memory_$Pointer$.offset_227| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) (+ (select (select |v_#memory_$Pointer$.offset_227| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) |v_ULTIMATE.start_main_~x~0#1.base_202| (store (select (store |v_#memory_$Pointer$.offset_227| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) (store (select |v_#memory_$Pointer$.offset_227| (select (select |v_#memory_$Pointer$.base_236| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) (+ (select (select |v_#memory_$Pointer$.offset_227| |v_ULTIMATE.start_main_~x~0#1.base_201|) |v_ULTIMATE.start_main_~x~0#1.offset_174|) 4) |v_ULTIMATE.start_main_~x~0#1.offset_174|)) |v_ULTIMATE.start_main_~x~0#1.base_202|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_175|) (select (select |v_#memory_$Pointer$.offset_229| |v_ULTIMATE.start_main_~x~0#1.base_202|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_175|))))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_main_~x~0#1.base_202| (store (select |v_#memory_$Pointer$.base_238| |v_ULTIMATE.start_main_~x~0#1.base_202|) |v_ULTIMATE.start_main_~x~0#1.offset_175| 0))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_174|) (= |#memory_int| (store |v_#memory_int_195| |v_ULTIMATE.start_main_~x~0#1.base_202| (store (store (select |v_#memory_int_195| |v_ULTIMATE.start_main_~x~0#1.base_202|) (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_175|) 0) |v_ULTIMATE.start_main_~x~0#1.offset_175| (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_202|) |v_ULTIMATE.start_main_~x~0#1.offset_175|)))))) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_175|) (<= (+ 12 |v_ULTIMATE.start_main_~x~0#1.offset_175|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_202|)))) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |v_ULTIMATE.start_main_~x~0#1.base_206| |ULTIMATE.start_main_~head~0#1.base|)))))' at error location [2024-11-09 07:32:39,476 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 07:32:39,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:32:39,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 36 [2024-11-09 07:32:39,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360313226] [2024-11-09 07:32:39,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:39,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 07:32:39,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:32:39,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 07:32:39,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2435, Unknown=31, NotChecked=100, Total=2756 [2024-11-09 07:32:39,480 INFO L87 Difference]: Start difference. First operand 222 states and 276 transitions. Second operand has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 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-09 07:32:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:45,500 INFO L93 Difference]: Finished difference Result 247 states and 298 transitions. [2024-11-09 07:32:45,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:32:45,500 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-09 07:32:45,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:45,502 INFO L225 Difference]: With dead ends: 247 [2024-11-09 07:32:45,502 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 07:32:45,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 979 ImplicationChecksByTransitivity, 82.4s TimeCoverageRelationStatistics Valid=320, Invalid=3312, Unknown=32, NotChecked=118, Total=3782 [2024-11-09 07:32:45,504 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 292 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 55 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:45,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 886 Invalid, 1991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1752 Invalid, 3 Unknown, 181 Unchecked, 4.4s Time] [2024-11-09 07:32:45,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 07:32:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 213. [2024-11-09 07:32:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 194 states have (on average 1.3505154639175259) internal successors, (262), 212 states have internal predecessors, (262), 0 states have call successors, (0), 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-09 07:32:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 262 transitions. [2024-11-09 07:32:45,511 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 262 transitions. Word has length 25 [2024-11-09 07:32:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:45,512 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 262 transitions. [2024-11-09 07:32:45,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0277777777777777) internal successors, (73), 36 states have internal predecessors, (73), 0 states have call successors, (0), 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-09 07:32:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 262 transitions. [2024-11-09 07:32:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 07:32:45,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:45,513 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:45,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:32:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:45,714 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:32:45,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:45,715 INFO L85 PathProgramCache]: Analyzing trace with hash -49644417, now seen corresponding path program 1 times [2024-11-09 07:32:45,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:32:45,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012216695] [2024-11-09 07:32:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:46,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:32:46,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:32:46,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012216695] [2024-11-09 07:32:46,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012216695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:32:46,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476568371] [2024-11-09 07:32:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:46,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:46,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:32:46,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:32:46,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:32:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:46,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:32:46,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:46,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:32:46,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-09 07:32:46,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 07:32:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:32:46,531 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:32:46,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476568371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:46,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:32:46,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2024-11-09 07:32:46,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519170942] [2024-11-09 07:32:46,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:46,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:32:46,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 07:32:46,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:32:46,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:32:46,533 INFO L87 Difference]: Start difference. First operand 213 states and 262 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:32:47,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:47,354 INFO L93 Difference]: Finished difference Result 254 states and 300 transitions. [2024-11-09 07:32:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:32:47,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 07:32:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:47,357 INFO L225 Difference]: With dead ends: 254 [2024-11-09 07:32:47,357 INFO L226 Difference]: Without dead ends: 254 [2024-11-09 07:32:47,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:32:47,358 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 192 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:47,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 191 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:32:47,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-09 07:32:47,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 233. [2024-11-09 07:32:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 214 states have (on average 1.3317757009345794) internal successors, (285), 232 states have internal predecessors, (285), 0 states have call successors, (0), 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-09 07:32:47,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 285 transitions. [2024-11-09 07:32:47,366 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 285 transitions. Word has length 26 [2024-11-09 07:32:47,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:47,367 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 285 transitions. [2024-11-09 07:32:47,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:32:47,367 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 285 transitions. [2024-11-09 07:32:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:32:47,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:47,368 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:47,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:32:47,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 07:32:47,569 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 56 more)] === [2024-11-09 07:32:47,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:47,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1006477618, now seen corresponding path program 3 times [2024-11-09 07:32:47,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 07:32:47,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995255885] [2024-11-09 07:32:47,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:47,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:32:49,024 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 07:32:49,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995255885] [2024-11-09 07:32:49,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995255885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:32:49,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144588419] [2024-11-09 07:32:49,024 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:32:49,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:49,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 07:32:49,025 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:32:49,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c40bdbf4-d16f-4658-b951-cb3cec26e455/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:32:49,479 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:32:49,479 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:32:49,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 07:32:49,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:49,735 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:32:49,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:32:49,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:32:50,103 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:32:50,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 07:32:50,250 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:32:50,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 07:32:50,302 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-09 07:32:50,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2024-11-09 07:32:50,395 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 07:32:50,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 07:32:50,526 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2024-11-09 07:32:50,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2024-11-09 07:32:50,795 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 07:32:50,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 50 [2024-11-09 07:32:50,997 INFO L349 Elim1Store]: treesize reduction 40, result has 21.6 percent of original size [2024-11-09 07:32:50,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 48 [2024-11-09 07:32:51,076 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 07:32:51,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 57 [2024-11-09 07:32:51,460 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 07:32:51,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2024-11-09 07:32:51,465 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:32:51,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:51,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1562 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1562) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:32:51,629 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1560))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1562)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2024-11-09 07:32:51,760 INFO L349 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2024-11-09 07:32:51,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2024-11-09 07:32:51,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1560))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1562)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) is different from false [2024-11-09 07:32:51,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:32:51,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2024-11-09 07:32:51,934 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_arrayElimArr_19 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (v_ArrVal_1560 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_19 |ULTIMATE.start_main_~x~0#1.offset|))) (or (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_19) .cse1 v_ArrVal_1560))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1562)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2024-11-09 07:32:51,969 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_19 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_185| Int) (v_ArrVal_1560 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_19 |v_ULTIMATE.start_main_~x~0#1.offset_185|))) (or (not (= (select |c_#valid| .cse0) 0)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse1 (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_19) .cse0 v_ArrVal_1560))) (store .cse2 (select (select .cse2 .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_185|) v_ArrVal_1562)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2024-11-09 07:32:51,991 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1555 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_185| Int) (v_ArrVal_1560 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_19 |v_ULTIMATE.start_main_~x~0#1.offset_185|))) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1555))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (let ((.cse0 (store (store .cse2 .cse1 v_arrayElimArr_19) .cse3 v_ArrVal_1560))) (store .cse0 (select (select .cse0 .cse1) |v_ULTIMATE.start_main_~x~0#1.offset_185|) v_ArrVal_1562)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1))) (not (= (select |c_#valid| .cse3) 0))))) is different from false [2024-11-09 07:32:52,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1555 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_ArrVal_1562 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_185| Int) (v_ArrVal_1560 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_19 |v_ULTIMATE.start_main_~x~0#1.offset_185|))) (or (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1555))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (let ((.cse1 (store (store .cse2 .cse0 v_arrayElimArr_19) .cse3 v_ArrVal_1560))) (store .cse1 (select (select .cse1 .cse0) |v_ULTIMATE.start_main_~x~0#1.offset_185|) v_ArrVal_1562)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (select |c_#valid| .cse3) 0))))) is different from false [2024-11-09 07:32:52,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:32:52,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 73 [2024-11-09 07:32:52,106 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:32:52,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8856 treesize of output 6375 [2024-11-09 07:32:52,427 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:32:52,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 962 treesize of output 831 [2024-11-09 07:32:52,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:32:52,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1632 treesize of output 1318 [2024-11-09 07:32:52,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1304 treesize of output 1232 [2024-11-09 07:32:52,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:32:52,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1232 treesize of output 1154 [2024-11-09 07:32:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 07:32:54,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144588419] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:54,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [829492836] [2024-11-09 07:32:54,722 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2024-11-09 07:32:54,722 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 07:32:54,722 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 07:32:54,723 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 07:32:54,723 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 07:33:00,785 INFO L180 IcfgInterpreter]: Interpretation finished