./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/dancing.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:31:02,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:31:02,613 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:31:02,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:31:02,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:31:02,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:31:02,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:31:02,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:31:02,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:31:02,677 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:31:02,677 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:31:02,677 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:31:02,678 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:31:02,678 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:31:02,678 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:31:02,678 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:31:02,679 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:31:02,680 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:31:02,681 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:31:02,681 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:31:02,681 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:31:02,681 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:31:02,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:31:02,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:31:02,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:31:02,682 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:31:02,682 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:31:02,682 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:31:02,682 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:31:02,682 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:31:02,682 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:31:02,682 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:31:02,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:31:02,683 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:31:02,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:31:02,683 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:31:02,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:31:02,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:31:02,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:31:02,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:31:02,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:31:02,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:31:02,684 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:31:02,684 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:31:02,684 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:31:02,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:31:02,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:31:02,684 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:31:02,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:31:02,686 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2024-11-14 03:31:03,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:31:03,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:31:03,092 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:31:03,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:31:03,094 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:31:03,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/heap-manipulation/dancing.i Unable to find full path for "g++" [2024-11-14 03:31:05,328 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:31:05,858 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:31:05,862 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/sv-benchmarks/c/heap-manipulation/dancing.i [2024-11-14 03:31:05,892 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/data/fabc05fdf/7e1f5536a25048058b902a69109fbaeb/FLAG1f07c8fdb [2024-11-14 03:31:06,400 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/data/fabc05fdf/7e1f5536a25048058b902a69109fbaeb [2024-11-14 03:31:06,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:31:06,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:31:06,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:31:06,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:31:06,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:31:06,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:06,416 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@678f2f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06, skipping insertion in model container [2024-11-14 03:31:06,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:06,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:31:06,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:31:06,846 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:31:06,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:31:06,933 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:31:06,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06 WrapperNode [2024-11-14 03:31:06,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:31:06,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:31:06,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:31:06,936 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:31:06,945 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:06,959 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:06,986 INFO L138 Inliner]: procedures = 124, calls = 41, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 95 [2024-11-14 03:31:06,989 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:31:06,990 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:31:06,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:31:06,991 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:31:07,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:07,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:07,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:07,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:07,030 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:07,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:07,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:07,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:07,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:31:07,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:31:07,055 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:31:07,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:31:07,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06" (1/1) ... [2024-11-14 03:31:07,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:31:07,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:31:07,096 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:31:07,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:31:07,129 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2024-11-14 03:31:07,129 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2024-11-14 03:31:07,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 03:31:07,129 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 03:31:07,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-14 03:31:07,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:31:07,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 03:31:07,130 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-14 03:31:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-14 03:31:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 03:31:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:31:07,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:31:07,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:31:07,281 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:31:07,283 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:31:07,804 INFO L? ?]: Removed 104 outVars from TransFormulas that were not future-live. [2024-11-14 03:31:07,804 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:31:07,878 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:31:07,879 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 03:31:07,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:31:07 BoogieIcfgContainer [2024-11-14 03:31:07,879 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:31:07,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:31:07,887 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:31:07,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:31:07,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:31:06" (1/3) ... [2024-11-14 03:31:07,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66645c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:31:07, skipping insertion in model container [2024-11-14 03:31:07,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:31:06" (2/3) ... [2024-11-14 03:31:07,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66645c0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:31:07, skipping insertion in model container [2024-11-14 03:31:07,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:31:07" (3/3) ... [2024-11-14 03:31:07,898 INFO L112 eAbstractionObserver]: Analyzing ICFG dancing.i [2024-11-14 03:31:07,919 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:31:07,921 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG dancing.i that has 3 procedures, 101 locations, 1 initial locations, 1 loop locations, and 44 error locations. [2024-11-14 03:31:07,979 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:31:07,996 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;@5ad9c9cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:31:07,996 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-14 03:31:08,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 92 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:31:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 03:31:08,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:08,015 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 03:31:08,015 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:08,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:08,024 INFO L85 PathProgramCache]: Analyzing trace with hash 6855, now seen corresponding path program 1 times [2024-11-14 03:31:08,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132606136] [2024-11-14 03:31:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:08,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:08,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:08,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132606136] [2024-11-14 03:31:08,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132606136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:08,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:08,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:31:08,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847898846] [2024-11-14 03:31:08,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:08,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:31:08,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:08,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:31:08,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:31:08,371 INFO L87 Difference]: Start difference. First operand has 101 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 92 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-14 03:31:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:08,578 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2024-11-14 03:31:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:31:08,581 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-14 03:31:08,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:08,591 INFO L225 Difference]: With dead ends: 98 [2024-11-14 03:31:08,591 INFO L226 Difference]: Without dead ends: 97 [2024-11-14 03:31:08,594 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-14 03:31:08,599 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:08,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 81 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:31:08,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-14 03:31:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-14 03:31:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 88 states have internal predecessors, (97), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:31:08,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2024-11-14 03:31:08,665 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 2 [2024-11-14 03:31:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:08,666 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2024-11-14 03:31:08,666 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-14 03:31:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2024-11-14 03:31:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-11-14 03:31:08,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:08,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-11-14 03:31:08,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:31:08,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:08,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:08,671 INFO L85 PathProgramCache]: Analyzing trace with hash 6856, now seen corresponding path program 1 times [2024-11-14 03:31:08,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:08,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744288194] [2024-11-14 03:31:08,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:08,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:08,861 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:08,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744288194] [2024-11-14 03:31:08,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744288194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:08,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:08,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:31:08,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100949] [2024-11-14 03:31:08,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:08,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:31:08,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:08,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:31:08,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:31:08,869 INFO L87 Difference]: Start difference. First operand 97 states and 109 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-14 03:31:09,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:09,041 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2024-11-14 03:31:09,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:31:09,042 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-14 03:31:09,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:09,043 INFO L225 Difference]: With dead ends: 95 [2024-11-14 03:31:09,045 INFO L226 Difference]: Without dead ends: 95 [2024-11-14 03:31:09,046 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-14 03:31:09,047 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 72 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:09,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 82 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:31:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-14 03:31:09,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-14 03:31:09,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 47 states have (on average 2.021276595744681) internal successors, (95), 86 states have internal predecessors, (95), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:31:09,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2024-11-14 03:31:09,060 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 2 [2024-11-14 03:31:09,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:09,060 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2024-11-14 03:31:09,061 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-14 03:31:09,061 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2024-11-14 03:31:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 03:31:09,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:09,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:09,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:31:09,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:09,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:09,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1171190916, now seen corresponding path program 1 times [2024-11-14 03:31:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:09,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083267306] [2024-11-14 03:31:09,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:09,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:09,238 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:09,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083267306] [2024-11-14 03:31:09,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083267306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:09,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:09,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:31:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253704393] [2024-11-14 03:31:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:09,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:31:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:09,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:31:09,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:31:09,241 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:09,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:09,389 INFO L93 Difference]: Finished difference Result 93 states and 105 transitions. [2024-11-14 03:31:09,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:31:09,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-14 03:31:09,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:09,392 INFO L225 Difference]: With dead ends: 93 [2024-11-14 03:31:09,394 INFO L226 Difference]: Without dead ends: 93 [2024-11-14 03:31:09,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:31:09,396 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:09,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 149 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:31:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-14 03:31:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-14 03:31:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 47 states have (on average 1.9787234042553192) internal successors, (93), 84 states have internal predecessors, (93), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:31:09,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2024-11-14 03:31:09,413 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 7 [2024-11-14 03:31:09,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:09,413 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2024-11-14 03:31:09,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:09,413 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2024-11-14 03:31:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 03:31:09,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:09,414 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:09,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:31:09,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:09,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:09,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1171190915, now seen corresponding path program 1 times [2024-11-14 03:31:09,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:09,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413747699] [2024-11-14 03:31:09,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:09,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:09,691 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:09,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413747699] [2024-11-14 03:31:09,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413747699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:09,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:09,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:31:09,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101266615] [2024-11-14 03:31:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:09,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:31:09,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:09,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:31:09,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:31:09,693 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:09,819 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2024-11-14 03:31:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:31:09,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-14 03:31:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:09,821 INFO L225 Difference]: With dead ends: 91 [2024-11-14 03:31:09,821 INFO L226 Difference]: Without dead ends: 91 [2024-11-14 03:31:09,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:31:09,823 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:09,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 151 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:31:09,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-14 03:31:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-14 03:31:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 47 states have (on average 1.9361702127659575) internal successors, (91), 82 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:31:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2024-11-14 03:31:09,831 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 7 [2024-11-14 03:31:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:09,831 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2024-11-14 03:31:09,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-11-14 03:31:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:31:09,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:09,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:09,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:31:09,832 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:09,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:09,833 INFO L85 PathProgramCache]: Analyzing trace with hash -230244395, now seen corresponding path program 1 times [2024-11-14 03:31:09,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:09,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464182383] [2024-11-14 03:31:09,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:09,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:10,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:10,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:10,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464182383] [2024-11-14 03:31:10,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464182383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:10,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:10,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:31:10,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669872146] [2024-11-14 03:31:10,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:10,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:31:10,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:10,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:31:10,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:31:10,061 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:10,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:10,213 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2024-11-14 03:31:10,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:31:10,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-14 03:31:10,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:10,215 INFO L225 Difference]: With dead ends: 161 [2024-11-14 03:31:10,215 INFO L226 Difference]: Without dead ends: 161 [2024-11-14 03:31:10,215 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-14 03:31:10,216 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 67 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:10,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 352 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:31:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-14 03:31:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2024-11-14 03:31:10,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 2.0259740259740258) internal successors, (156), 113 states have internal predecessors, (156), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-14 03:31:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 176 transitions. [2024-11-14 03:31:10,243 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 176 transitions. Word has length 9 [2024-11-14 03:31:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:10,244 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 176 transitions. [2024-11-14 03:31:10,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:10,244 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 176 transitions. [2024-11-14 03:31:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:31:10,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:10,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:10,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:31:10,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:10,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:10,250 INFO L85 PathProgramCache]: Analyzing trace with hash -233038816, now seen corresponding path program 1 times [2024-11-14 03:31:10,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:10,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497232081] [2024-11-14 03:31:10,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:10,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:10,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-14 03:31:10,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:10,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497232081] [2024-11-14 03:31:10,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497232081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:10,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:10,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-14 03:31:10,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290019749] [2024-11-14 03:31:10,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:10,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:31:10,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:10,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:31:10,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:31:10,602 INFO L87 Difference]: Start difference. First operand 126 states and 176 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-14 03:31:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:10,764 INFO L93 Difference]: Finished difference Result 125 states and 175 transitions. [2024-11-14 03:31:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:31:10,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-14 03:31:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:10,767 INFO L225 Difference]: With dead ends: 125 [2024-11-14 03:31:10,767 INFO L226 Difference]: Without dead ends: 125 [2024-11-14 03:31:10,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:31:10,768 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 128 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:10,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 95 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:31:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-14 03:31:10,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-14 03:31:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 77 states have (on average 2.012987012987013) internal successors, (155), 112 states have internal predecessors, (155), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-14 03:31:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 175 transitions. [2024-11-14 03:31:10,779 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 175 transitions. Word has length 9 [2024-11-14 03:31:10,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:10,779 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 175 transitions. [2024-11-14 03:31:10,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 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-14 03:31:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 175 transitions. [2024-11-14 03:31:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 03:31:10,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:10,780 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:10,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:31:10,780 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:10,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash -233038817, now seen corresponding path program 1 times [2024-11-14 03:31:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:10,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443270193] [2024-11-14 03:31:10,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:10,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:10,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443270193] [2024-11-14 03:31:10,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443270193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:10,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:10,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:31:10,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106860705] [2024-11-14 03:31:10,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:10,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:31:10,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:10,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:31:10,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:31:10,968 INFO L87 Difference]: Start difference. First operand 125 states and 175 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-14 03:31:11,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:11,166 INFO L93 Difference]: Finished difference Result 124 states and 174 transitions. [2024-11-14 03:31:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:31:11,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-14 03:31:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:11,168 INFO L225 Difference]: With dead ends: 124 [2024-11-14 03:31:11,168 INFO L226 Difference]: Without dead ends: 124 [2024-11-14 03:31:11,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:31:11,170 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 126 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:11,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 110 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:31:11,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-14 03:31:11,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-14 03:31:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 2.0) internal successors, (154), 111 states have internal predecessors, (154), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-14 03:31:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 174 transitions. [2024-11-14 03:31:11,179 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 174 transitions. Word has length 9 [2024-11-14 03:31:11,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:11,179 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 174 transitions. [2024-11-14 03:31:11,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 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-14 03:31:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 174 transitions. [2024-11-14 03:31:11,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:31:11,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:11,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:11,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:31:11,181 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:11,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:11,182 INFO L85 PathProgramCache]: Analyzing trace with hash -148420256, now seen corresponding path program 1 times [2024-11-14 03:31:11,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:11,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313390433] [2024-11-14 03:31:11,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:11,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:11,316 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:11,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313390433] [2024-11-14 03:31:11,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313390433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:11,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:11,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:31:11,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260001809] [2024-11-14 03:31:11,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:11,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:31:11,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:11,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:31:11,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:31:11,318 INFO L87 Difference]: Start difference. First operand 124 states and 174 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:31:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:11,701 INFO L93 Difference]: Finished difference Result 148 states and 171 transitions. [2024-11-14 03:31:11,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:31:11,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-14 03:31:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:11,704 INFO L225 Difference]: With dead ends: 148 [2024-11-14 03:31:11,704 INFO L226 Difference]: Without dead ends: 148 [2024-11-14 03:31:11,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:31:11,705 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 140 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:11,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 188 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:31:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-14 03:31:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 119. [2024-11-14 03:31:11,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.8571428571428572) internal successors, (143), 106 states have internal predecessors, (143), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-14 03:31:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 163 transitions. [2024-11-14 03:31:11,714 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 163 transitions. Word has length 12 [2024-11-14 03:31:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:11,714 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 163 transitions. [2024-11-14 03:31:11,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:31:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2024-11-14 03:31:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 03:31:11,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:11,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:11,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:31:11,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:11,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:11,716 INFO L85 PathProgramCache]: Analyzing trace with hash -148420255, now seen corresponding path program 1 times [2024-11-14 03:31:11,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:11,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794887675] [2024-11-14 03:31:11,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:11,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:11,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:11,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794887675] [2024-11-14 03:31:11,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794887675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:11,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:11,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:31:11,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799449515] [2024-11-14 03:31:11,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:11,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:31:11,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:11,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:31:11,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:31:11,982 INFO L87 Difference]: Start difference. First operand 119 states and 163 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:31:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:12,393 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2024-11-14 03:31:12,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:31:12,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-14 03:31:12,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:12,394 INFO L225 Difference]: With dead ends: 143 [2024-11-14 03:31:12,395 INFO L226 Difference]: Without dead ends: 143 [2024-11-14 03:31:12,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:31:12,396 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 177 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:12,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 198 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:31:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-14 03:31:12,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 119. [2024-11-14 03:31:12,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.7792207792207793) internal successors, (137), 106 states have internal predecessors, (137), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-14 03:31:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2024-11-14 03:31:12,404 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 12 [2024-11-14 03:31:12,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:12,404 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2024-11-14 03:31:12,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:31:12,404 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2024-11-14 03:31:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:31:12,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:12,405 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:12,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:31:12,405 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:12,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:12,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1232216098, now seen corresponding path program 1 times [2024-11-14 03:31:12,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:12,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670877755] [2024-11-14 03:31:12,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:12,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:12,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:12,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670877755] [2024-11-14 03:31:12,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670877755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:12,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981804113] [2024-11-14 03:31:12,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:12,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:31:12,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:31:12,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:31:12,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 03:31:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:12,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-14 03:31:12,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:12,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:12,881 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 03:31:12,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-14 03:31:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:12,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981804113] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:31:12,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1547495055] [2024-11-14 03:31:12,947 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-14 03:31:12,947 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:31:12,952 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:31:12,957 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:31:12,958 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:31:19,960 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 13 for LOIs [2024-11-14 03:31:19,987 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:31:21,810 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2313#(and (not (= (select |#valid| |is_list_containing_x_#in~l.base|) 1)) (= |is_list_containing_x_#in~x.offset| is_list_containing_x_~x.offset) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (or (not (= is_list_containing_x_~x.offset is_list_containing_x_~l.offset)) (not (= is_list_containing_x_~x.base |is_list_containing_x_#in~l.base|))) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_17| Int)) (= 0 |v_ULTIMATE.start_main_#t~nondet16#1_17|)) (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~l.offset))' at error location [2024-11-14 03:31:21,810 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:31:21,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:31:21,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-14 03:31:21,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567209624] [2024-11-14 03:31:21,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:31:21,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:31:21,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:21,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:31:21,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=230, Unknown=1, NotChecked=0, Total=272 [2024-11-14 03:31:21,814 INFO L87 Difference]: Start difference. First operand 119 states and 157 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:22,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:22,152 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2024-11-14 03:31:22,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:31:22,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:31:22,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:22,154 INFO L225 Difference]: With dead ends: 133 [2024-11-14 03:31:22,154 INFO L226 Difference]: Without dead ends: 133 [2024-11-14 03:31:22,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=49, Invalid=292, Unknown=1, NotChecked=0, Total=342 [2024-11-14 03:31:22,156 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 131 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:22,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 163 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:31:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-14 03:31:22,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2024-11-14 03:31:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 84 states have (on average 1.75) internal successors, (147), 112 states have internal predecessors, (147), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:31:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 169 transitions. [2024-11-14 03:31:22,166 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 169 transitions. Word has length 15 [2024-11-14 03:31:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:22,166 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 169 transitions. [2024-11-14 03:31:22,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 169 transitions. [2024-11-14 03:31:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:31:22,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:22,167 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:22,205 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 03:31:22,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 03:31:22,372 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:22,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:22,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1232216099, now seen corresponding path program 1 times [2024-11-14 03:31:22,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:22,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476346931] [2024-11-14 03:31:22,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:22,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:22,639 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:22,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476346931] [2024-11-14 03:31:22,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476346931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:22,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138396860] [2024-11-14 03:31:22,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:22,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:31:22,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:31:22,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:31:22,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 03:31:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:22,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 03:31:22,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:22,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:23,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:31:23,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-14 03:31:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138396860] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:31:23,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1933649376] [2024-11-14 03:31:23,188 INFO L159 IcfgInterpreter]: Started Sifa with 14 locations of interest [2024-11-14 03:31:23,188 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:31:23,188 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:31:23,189 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:31:23,189 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:31:28,695 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 10 for LOIs [2024-11-14 03:31:28,710 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:31:30,527 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2689#(and (or (not (= |is_list_containing_x_#in~l.offset| is_list_containing_x_~x.offset)) (not (= is_list_containing_x_~x.base |is_list_containing_x_#in~l.base|))) (= |is_list_containing_x_#in~x.offset| is_list_containing_x_~x.offset) (= is_list_containing_x_~x.base |is_list_containing_x_#in~x.base|) (or (< (select |#length| |is_list_containing_x_#in~l.base|) (+ |is_list_containing_x_#in~l.offset| 8)) (< (+ |is_list_containing_x_#in~l.offset| 4) 0)) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_24| Int)) (= 0 |v_ULTIMATE.start_main_#t~nondet16#1_24|)))' at error location [2024-11-14 03:31:30,527 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:31:30,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:31:30,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2024-11-14 03:31:30,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226917658] [2024-11-14 03:31:30,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:31:30,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 03:31:30,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:30,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 03:31:30,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=643, Unknown=1, NotChecked=0, Total=756 [2024-11-14 03:31:30,529 INFO L87 Difference]: Start difference. First operand 127 states and 169 transitions. Second operand has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:31,010 INFO L93 Difference]: Finished difference Result 130 states and 173 transitions. [2024-11-14 03:31:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:31:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:31:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:31,012 INFO L225 Difference]: With dead ends: 130 [2024-11-14 03:31:31,012 INFO L226 Difference]: Without dead ends: 130 [2024-11-14 03:31:31,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=132, Invalid=737, Unknown=1, NotChecked=0, Total=870 [2024-11-14 03:31:31,014 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 196 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:31,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 288 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:31:31,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-14 03:31:31,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2024-11-14 03:31:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 84 states have (on average 1.7142857142857142) internal successors, (144), 111 states have internal predecessors, (144), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:31:31,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 166 transitions. [2024-11-14 03:31:31,021 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 166 transitions. Word has length 15 [2024-11-14 03:31:31,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:31,021 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 166 transitions. [2024-11-14 03:31:31,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.625) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:31,022 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 166 transitions. [2024-11-14 03:31:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-14 03:31:31,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:31,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:31,045 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 03:31:31,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-14 03:31:31,227 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:31,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:31,228 INFO L85 PathProgramCache]: Analyzing trace with hash 363906212, now seen corresponding path program 1 times [2024-11-14 03:31:31,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:31,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701936582] [2024-11-14 03:31:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:31,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:31,583 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:31,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701936582] [2024-11-14 03:31:31,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701936582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:31,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:31,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:31:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37412148] [2024-11-14 03:31:31,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:31,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:31:31,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:31,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:31:31,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:31:31,585 INFO L87 Difference]: Start difference. First operand 126 states and 166 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:31:31,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:31,848 INFO L93 Difference]: Finished difference Result 158 states and 199 transitions. [2024-11-14 03:31:31,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:31:31,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-14 03:31:31,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:31,850 INFO L225 Difference]: With dead ends: 158 [2024-11-14 03:31:31,850 INFO L226 Difference]: Without dead ends: 158 [2024-11-14 03:31:31,851 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:31:31,851 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 150 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:31,852 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 291 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:31:31,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-14 03:31:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 123. [2024-11-14 03:31:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.7037037037037037) internal successors, (138), 108 states have internal predecessors, (138), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:31:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 160 transitions. [2024-11-14 03:31:31,861 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 160 transitions. Word has length 16 [2024-11-14 03:31:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:31,862 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 160 transitions. [2024-11-14 03:31:31,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:31:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 160 transitions. [2024-11-14 03:31:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:31:31,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:31,864 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-14 03:31:31,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 03:31:31,864 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:31,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash -2147015418, now seen corresponding path program 1 times [2024-11-14 03:31:31,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:31,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416100839] [2024-11-14 03:31:31,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:31,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:32,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:32,210 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:32,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416100839] [2024-11-14 03:31:32,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416100839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:32,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:32,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:31:32,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592160050] [2024-11-14 03:31:32,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:32,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:31:32,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:32,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:31:32,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:31:32,213 INFO L87 Difference]: Start difference. First operand 123 states and 160 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:31:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:32,454 INFO L93 Difference]: Finished difference Result 143 states and 173 transitions. [2024-11-14 03:31:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:31:32,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2024-11-14 03:31:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:32,456 INFO L225 Difference]: With dead ends: 143 [2024-11-14 03:31:32,457 INFO L226 Difference]: Without dead ends: 143 [2024-11-14 03:31:32,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:31:32,457 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:32,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 327 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:31:32,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-14 03:31:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 120. [2024-11-14 03:31:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 105 states have internal predecessors, (132), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-14 03:31:32,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 154 transitions. [2024-11-14 03:31:32,468 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 154 transitions. Word has length 18 [2024-11-14 03:31:32,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:32,470 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 154 transitions. [2024-11-14 03:31:32,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:31:32,470 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 154 transitions. [2024-11-14 03:31:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:31:32,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:32,470 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:32,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 03:31:32,471 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:32,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:32,471 INFO L85 PathProgramCache]: Analyzing trace with hash -136123917, now seen corresponding path program 1 times [2024-11-14 03:31:32,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:32,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518440604] [2024-11-14 03:31:32,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:32,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:32,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:32,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:32,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518440604] [2024-11-14 03:31:32,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518440604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:32,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214418241] [2024-11-14 03:31:32,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:32,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:31:32,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:31:32,628 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:31:32,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 03:31:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:32,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-14 03:31:32,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:32,875 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:32,983 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 03:31:32,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-14 03:31:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:32,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214418241] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:31:32,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1391840555] [2024-11-14 03:31:32,997 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:31:32,997 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:31:32,998 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:31:32,998 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:31:32,998 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:31:33,430 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 18 for LOIs [2024-11-14 03:31:33,442 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:31:36,039 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3641#(and (not (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_30| Int)) (= 0 |v_ULTIMATE.start_main_#t~nondet16#1_30|)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| 0) (<= 2 |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2024-11-14 03:31:36,039 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:31:36,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:31:36,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2024-11-14 03:31:36,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787796894] [2024-11-14 03:31:36,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:31:36,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-14 03:31:36,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:36,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-14 03:31:36,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=608, Unknown=2, NotChecked=0, Total=702 [2024-11-14 03:31:36,041 INFO L87 Difference]: Start difference. First operand 120 states and 154 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:31:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:36,764 INFO L93 Difference]: Finished difference Result 195 states and 251 transitions. [2024-11-14 03:31:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 03:31:36,765 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 18 [2024-11-14 03:31:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:36,767 INFO L225 Difference]: With dead ends: 195 [2024-11-14 03:31:36,767 INFO L226 Difference]: Without dead ends: 195 [2024-11-14 03:31:36,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=135, Invalid=919, Unknown=2, NotChecked=0, Total=1056 [2024-11-14 03:31:36,768 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 463 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:36,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 256 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:31:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-14 03:31:36,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 158. [2024-11-14 03:31:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 110 states have (on average 1.7545454545454546) internal successors, (193), 138 states have internal predecessors, (193), 15 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2024-11-14 03:31:36,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 228 transitions. [2024-11-14 03:31:36,780 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 228 transitions. Word has length 18 [2024-11-14 03:31:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:36,780 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 228 transitions. [2024-11-14 03:31:36,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:31:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 228 transitions. [2024-11-14 03:31:36,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:31:36,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:36,781 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:36,803 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-14 03:31:36,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-14 03:31:36,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:36,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:36,982 INFO L85 PathProgramCache]: Analyzing trace with hash -136123916, now seen corresponding path program 1 times [2024-11-14 03:31:36,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:36,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323603211] [2024-11-14 03:31:36,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:36,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:37,271 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:37,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323603211] [2024-11-14 03:31:37,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323603211] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:37,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738106240] [2024-11-14 03:31:37,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:37,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:31:37,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:31:37,274 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:31:37,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 03:31:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:37,389 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 03:31:37,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:37,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:37,645 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:37,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:31:37,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-11-14 03:31:37,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:37,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738106240] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:31:37,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [504998773] [2024-11-14 03:31:37,988 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:31:37,988 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:31:37,988 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:31:37,988 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:31:37,988 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:31:38,352 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 18 for LOIs [2024-11-14 03:31:38,375 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:31:40,980 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4147#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_36| Int)) (= 0 |v_ULTIMATE.start_main_#t~nondet16#1_36|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (<= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) 7) (<= 2 |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2024-11-14 03:31:40,980 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:31:40,980 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:31:40,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2024-11-14 03:31:40,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139835501] [2024-11-14 03:31:40,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:31:40,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 03:31:40,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:40,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 03:31:40,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1223, Unknown=2, NotChecked=0, Total=1406 [2024-11-14 03:31:40,982 INFO L87 Difference]: Start difference. First operand 158 states and 228 transitions. Second operand has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:31:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:41,898 INFO L93 Difference]: Finished difference Result 189 states and 244 transitions. [2024-11-14 03:31:41,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:31:41,899 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 18 [2024-11-14 03:31:41,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:41,900 INFO L225 Difference]: With dead ends: 189 [2024-11-14 03:31:41,900 INFO L226 Difference]: Without dead ends: 189 [2024-11-14 03:31:41,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=275, Invalid=1703, Unknown=2, NotChecked=0, Total=1980 [2024-11-14 03:31:41,901 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 538 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:41,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 349 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:31:41,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-14 03:31:41,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 156. [2024-11-14 03:31:41,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 111 states have (on average 1.6666666666666667) internal successors, (185), 136 states have internal predecessors, (185), 15 states have call successors, (15), 5 states have call predecessors, (15), 6 states have return successors, (20), 14 states have call predecessors, (20), 15 states have call successors, (20) [2024-11-14 03:31:41,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 220 transitions. [2024-11-14 03:31:41,911 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 220 transitions. Word has length 18 [2024-11-14 03:31:41,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:41,912 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 220 transitions. [2024-11-14 03:31:41,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 19 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:31:41,912 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 220 transitions. [2024-11-14 03:31:41,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:31:41,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:41,913 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:41,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-14 03:31:42,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-14 03:31:42,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:42,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:42,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1977688619, now seen corresponding path program 1 times [2024-11-14 03:31:42,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:42,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870386510] [2024-11-14 03:31:42,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:42,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:42,442 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:42,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870386510] [2024-11-14 03:31:42,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870386510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:42,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146806560] [2024-11-14 03:31:42,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:42,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:31:42,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:31:42,445 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:31:42,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 03:31:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:42,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-14 03:31:42,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:42,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:31:42,627 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 19 treesize of output 1 [2024-11-14 03:31:42,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:31:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:42,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:42,738 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 34 treesize of output 28 [2024-11-14 03:31:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:42,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146806560] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:31:42,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [463314354] [2024-11-14 03:31:42,853 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:31:42,853 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:31:42,854 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:31:42,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:31:42,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-14 03:31:42,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193561890] [2024-11-14 03:31:42,859 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:31:42,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-14 03:31:42,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:42,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-14 03:31:42,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-11-14 03:31:42,860 INFO L87 Difference]: Start difference. First operand 156 states and 220 transitions. Second operand has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:43,689 INFO L93 Difference]: Finished difference Result 257 states and 368 transitions. [2024-11-14 03:31:43,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 03:31:43,690 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-14 03:31:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:43,692 INFO L225 Difference]: With dead ends: 257 [2024-11-14 03:31:43,692 INFO L226 Difference]: Without dead ends: 257 [2024-11-14 03:31:43,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2024-11-14 03:31:43,693 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 287 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:43,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 766 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-14 03:31:43,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-14 03:31:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 179. [2024-11-14 03:31:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 127 states have (on average 1.5905511811023623) internal successors, (202), 153 states have internal predecessors, (202), 20 states have call successors, (20), 7 states have call predecessors, (20), 8 states have return successors, (25), 18 states have call predecessors, (25), 20 states have call successors, (25) [2024-11-14 03:31:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 247 transitions. [2024-11-14 03:31:43,705 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 247 transitions. Word has length 21 [2024-11-14 03:31:43,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:43,705 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 247 transitions. [2024-11-14 03:31:43,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:43,706 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 247 transitions. [2024-11-14 03:31:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 03:31:43,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:43,707 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:43,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-14 03:31:43,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-14 03:31:43,908 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:43,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:43,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1977688618, now seen corresponding path program 1 times [2024-11-14 03:31:43,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:43,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950145023] [2024-11-14 03:31:43,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:43,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:44,530 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:44,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:44,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950145023] [2024-11-14 03:31:44,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950145023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:44,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496211414] [2024-11-14 03:31:44,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:44,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:31:44,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:31:44,535 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:31:44,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 03:31:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:44,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-14 03:31:44,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:44,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:31:44,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:31:44,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:31:44,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:31:44,843 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 18 treesize of output 13 [2024-11-14 03:31:44,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:31:44,858 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 18 treesize of output 13 [2024-11-14 03:31:44,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:31:44,880 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 18 treesize of output 13 [2024-11-14 03:31:44,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:31:44,890 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 18 treesize of output 13 [2024-11-14 03:31:44,931 INFO L349 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2024-11-14 03:31:44,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2024-11-14 03:31:44,954 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-11-14 03:31:44,954 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 29 treesize of output 17 [2024-11-14 03:31:45,462 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 42 treesize of output 18 [2024-11-14 03:31:45,472 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 9 treesize of output 3 [2024-11-14 03:31:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:45,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:46,309 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_581 (Array Int Int))) (< 0 (+ 5 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_581))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (or (< 0 (+ 5 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_581))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_580))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse5 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_581))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))) (or (< (+ 7 .cse5) (select |c_#length| (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_580))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))) (= .cse5 0))))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_581 (Array Int Int))) (let ((.cse10 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse11 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_580))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse10 |c_ULTIMATE.start_main_~n~0#1.base|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))) (or (< (+ 7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| v_ArrVal_581))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse10 |c_ULTIMATE.start_main_~n~0#1.offset|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)) (select |c_#length| .cse11)) (= .cse11 0))))))) is different from false [2024-11-14 03:31:46,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:31:46,477 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 395 treesize of output 400 [2024-11-14 03:31:49,214 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~n~0#1.base_48| Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int)) (< 0 (+ 5 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_8))) (store .cse0 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_6 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)))) (forall ((v_prenex_7 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_7) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_48| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_48| Int)) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (= |v_ULTIMATE.start_main_~n~0#1.base_48| (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_2))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_48|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))) (forall ((v_prenex_3 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_48| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_48| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_580 (Array Int Int)) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_ArrVal_580))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))) (or (= .cse3 0) (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_2))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_48|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) .cse3) (= |v_ULTIMATE.start_main_~n~0#1.base_48| (select (select (store .cse5 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_48|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_48| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_48| Int)) (or (forall ((v_prenex_8 (Array Int Int)) (v_prenex_6 Int)) (< 0 (+ 5 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_8))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_6 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)))) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_580 (Array Int Int)) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_2))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_48|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_ArrVal_580))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_48|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))) (forall ((v_prenex_7 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_7) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_48| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_48| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_581 (Array Int Int))) (< (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_48| v_ArrVal_581))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 1)) (forall ((v_ArrVal_580 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_ArrVal_580) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_48| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_48| Int)) (or (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (< (select (select (let ((.cse10 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_3))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_580 (Array Int Int)) (v_prenex_2 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_ArrVal_580))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_48|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_48| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_48| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_581 (Array Int Int))) (< (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_48| v_ArrVal_581))) (store .cse12 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse12 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_48| 1)) (forall ((v_ArrVal_580 (Array Int Int)) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (let ((.cse13 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_ArrVal_580) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))) (or (= .cse13 0) (= (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_2))) (store .cse14 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse14 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_48|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) .cse13)))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_48| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_580 (Array Int Int)) (v_prenex_1 Int) (v_prenex_2 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_2))) (or (= (select (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) (select (select (let ((.cse16 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_ArrVal_580))) (store .cse16 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse16 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_48|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)) (= |v_ULTIMATE.start_main_~n~0#1.base_48| (select (select (store .cse15 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse15 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) |v_ULTIMATE.start_main_~n~0#1.base_48|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))))) (forall ((v_prenex_3 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_3) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_48| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_48| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_48| 1)) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_580 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_ArrVal_580))) (or (= (select (select .cse17 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0) (= |v_ULTIMATE.start_main_~n~0#1.base_48| (select (select (store .cse17 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse17 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ |ULTIMATE.start_main_~tail~0#1.offset| 4) |v_ULTIMATE.start_main_~n~0#1.base_48|)) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1))))))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_48| Int)) (or (forall ((v_prenex_2 (Array Int Int))) (not (= |v_ULTIMATE.start_main_~n~0#1.base_48| (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_2) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)))) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (< (select (select (let ((.cse18 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_3))) (store .cse18 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse18 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_48| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_48| Int)) (or (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (< (select (select (let ((.cse19 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_3))) (store .cse19 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse19 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_1 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 1)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_48| 1)))) (forall ((|v_ULTIMATE.start_main_~n~0#1.base_48| Int)) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse20 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~n~0#1.base_48| v_prenex_5))) (store .cse20 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse20 |c_ULTIMATE.start_main_~tail~0#1.base|) (+ v_prenex_4 4) 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 4))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_main_~n~0#1.base_48| 1)))))) is different from true [2024-11-14 03:31:49,511 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:31:49,511 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 74 treesize of output 54 [2024-11-14 03:31:49,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:31:49,520 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 39 treesize of output 33 [2024-11-14 03:31:49,527 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 28 treesize of output 24 [2024-11-14 03:31:49,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:31:49,539 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 22 treesize of output 23 [2024-11-14 03:31:49,546 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 36 treesize of output 24 [2024-11-14 03:31:49,552 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 39 treesize of output 27 [2024-11-14 03:31:49,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-14 03:31:49,571 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:31:49,571 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 1 [2024-11-14 03:31:49,580 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:31:49,590 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:31:49,591 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 1 [2024-11-14 03:31:49,596 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:31:49,613 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:31:49,614 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 96 treesize of output 1 [2024-11-14 03:31:49,623 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:31:49,630 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:31:49,637 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:31:49,641 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-14 03:31:49,651 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:31:49,651 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 29 treesize of output 1 [2024-11-14 03:31:49,663 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:31:49,664 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 50 treesize of output 1 [2024-11-14 03:31:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-14 03:31:49,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496211414] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:31:49,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1729325163] [2024-11-14 03:31:49,709 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:31:49,709 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:31:49,709 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:31:49,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:31:49,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 33 [2024-11-14 03:31:49,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649416111] [2024-11-14 03:31:49,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:31:49,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 03:31:49,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:49,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 03:31:49,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=907, Unknown=2, NotChecked=122, Total=1122 [2024-11-14 03:31:49,712 INFO L87 Difference]: Start difference. First operand 179 states and 247 transitions. Second operand has 34 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 27 states have internal predecessors, (57), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:52,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:31:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:55,661 INFO L93 Difference]: Finished difference Result 365 states and 472 transitions. [2024-11-14 03:31:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-14 03:31:55,662 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 27 states have internal predecessors, (57), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-14 03:31:55,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:55,664 INFO L225 Difference]: With dead ends: 365 [2024-11-14 03:31:55,665 INFO L226 Difference]: Without dead ends: 365 [2024-11-14 03:31:55,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=317, Invalid=2551, Unknown=2, NotChecked=210, Total=3080 [2024-11-14 03:31:55,669 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 612 mSDsluCounter, 1249 mSDsCounter, 0 mSdLazyCounter, 1846 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 578 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:55,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1329 Invalid, 2507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1846 Invalid, 0 Unknown, 578 Unchecked, 3.7s Time] [2024-11-14 03:31:55,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-14 03:31:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 252. [2024-11-14 03:31:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 185 states have (on average 1.5675675675675675) internal successors, (290), 214 states have internal predecessors, (290), 30 states have call successors, (30), 11 states have call predecessors, (30), 13 states have return successors, (40), 26 states have call predecessors, (40), 30 states have call successors, (40) [2024-11-14 03:31:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 360 transitions. [2024-11-14 03:31:55,688 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 360 transitions. Word has length 21 [2024-11-14 03:31:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:55,688 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 360 transitions. [2024-11-14 03:31:55,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 27 states have internal predecessors, (57), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:31:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 360 transitions. [2024-11-14 03:31:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:31:55,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:55,689 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:55,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 03:31:55,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-14 03:31:55,890 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:55,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:55,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1443556769, now seen corresponding path program 1 times [2024-11-14 03:31:55,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:55,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657812339] [2024-11-14 03:31:55,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:55,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:31:55,961 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657812339] [2024-11-14 03:31:55,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657812339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:55,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:55,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:31:55,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502783840] [2024-11-14 03:31:55,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:55,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:31:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:55,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:31:55,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:31:55,965 INFO L87 Difference]: Start difference. First operand 252 states and 360 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:31:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:55,995 INFO L93 Difference]: Finished difference Result 268 states and 384 transitions. [2024-11-14 03:31:55,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:31:55,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-14 03:31:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:55,998 INFO L225 Difference]: With dead ends: 268 [2024-11-14 03:31:55,998 INFO L226 Difference]: Without dead ends: 266 [2024-11-14 03:31:55,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:31:55,999 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:55,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 265 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:31:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-14 03:31:56,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 256. [2024-11-14 03:31:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 187 states have (on average 1.5614973262032086) internal successors, (292), 218 states have internal predecessors, (292), 30 states have call successors, (30), 11 states have call predecessors, (30), 15 states have return successors, (44), 26 states have call predecessors, (44), 30 states have call successors, (44) [2024-11-14 03:31:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 366 transitions. [2024-11-14 03:31:56,025 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 366 transitions. Word has length 20 [2024-11-14 03:31:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:56,025 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 366 transitions. [2024-11-14 03:31:56,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:31:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 366 transitions. [2024-11-14 03:31:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 03:31:56,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:56,027 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:31:56,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-14 03:31:56,027 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:56,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash 968331934, now seen corresponding path program 1 times [2024-11-14 03:31:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181999239] [2024-11-14 03:31:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:56,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:56,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:56,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181999239] [2024-11-14 03:31:56,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181999239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:31:56,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:31:56,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:31:56,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181865168] [2024-11-14 03:31:56,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:31:56,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:31:56,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:31:56,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:31:56,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:31:56,103 INFO L87 Difference]: Start difference. First operand 256 states and 366 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:31:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:31:56,167 INFO L93 Difference]: Finished difference Result 272 states and 387 transitions. [2024-11-14 03:31:56,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:31:56,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2024-11-14 03:31:56,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:31:56,169 INFO L225 Difference]: With dead ends: 272 [2024-11-14 03:31:56,169 INFO L226 Difference]: Without dead ends: 272 [2024-11-14 03:31:56,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:31:56,170 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 3 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:31:56,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 327 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:31:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-14 03:31:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 266. [2024-11-14 03:31:56,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 190 states have (on average 1.5526315789473684) internal successors, (295), 227 states have internal predecessors, (295), 36 states have call successors, (36), 12 states have call predecessors, (36), 16 states have return successors, (50), 26 states have call predecessors, (50), 36 states have call successors, (50) [2024-11-14 03:31:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 381 transitions. [2024-11-14 03:31:56,183 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 381 transitions. Word has length 22 [2024-11-14 03:31:56,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:31:56,183 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 381 transitions. [2024-11-14 03:31:56,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-14 03:31:56,184 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 381 transitions. [2024-11-14 03:31:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 03:31:56,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:31:56,184 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] [2024-11-14 03:31:56,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 03:31:56,185 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:31:56,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:31:56,185 INFO L85 PathProgramCache]: Analyzing trace with hash 397665207, now seen corresponding path program 1 times [2024-11-14 03:31:56,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:31:56,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229911246] [2024-11-14 03:31:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:56,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:31:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:57,114 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:31:57,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229911246] [2024-11-14 03:31:57,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229911246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:31:57,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921639456] [2024-11-14 03:31:57,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:31:57,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:31:57,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:31:57,117 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:31:57,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 03:31:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:31:57,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 03:31:57,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:31:57,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:31:57,346 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 19 treesize of output 1 [2024-11-14 03:31:57,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:31:57,718 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 32 treesize of output 26 [2024-11-14 03:31:57,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:57,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:31:57,940 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 34 treesize of output 28 [2024-11-14 03:31:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:31:58,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921639456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:31:58,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1350841772] [2024-11-14 03:31:58,061 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 03:31:58,061 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:31:58,061 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:31:58,062 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:31:58,062 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:31:58,408 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 18 for LOIs [2024-11-14 03:31:58,421 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:32:01,899 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '7152#(and (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 4)) 1)) (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1) (= |ULTIMATE.start_remove_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#t~mem5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 4) |ULTIMATE.start_remove_#t~mem4#1.offset|) (<= 2 |ULTIMATE.start_main_~#list~0#1.base|) (<= 8 (select |#length| |ULTIMATE.start_remove_~x#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 0) |ULTIMATE.start_remove_#t~mem5#1.base|) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_46| Int)) (= 0 |v_ULTIMATE.start_main_#t~nondet16#1_46|)) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| 0) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 4) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 4) 0))) (= |ULTIMATE.start_main_~tail~0#1.offset| 0))' at error location [2024-11-14 03:32:01,899 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:32:01,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:32:01,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 9] total 29 [2024-11-14 03:32:01,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584365943] [2024-11-14 03:32:01,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:32:01,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-14 03:32:01,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:32:01,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-14 03:32:01,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=2070, Unknown=2, NotChecked=0, Total=2256 [2024-11-14 03:32:01,902 INFO L87 Difference]: Start difference. First operand 266 states and 381 transitions. Second operand has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 26 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:32:04,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:07,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:09,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:11,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:13,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:32:14,525 INFO L93 Difference]: Finished difference Result 399 states and 530 transitions. [2024-11-14 03:32:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-14 03:32:14,525 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 26 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2024-11-14 03:32:14,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:32:14,527 INFO L225 Difference]: With dead ends: 399 [2024-11-14 03:32:14,527 INFO L226 Difference]: Without dead ends: 399 [2024-11-14 03:32:14,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=350, Invalid=3188, Unknown=2, NotChecked=0, Total=3540 [2024-11-14 03:32:14,529 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 677 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1434 mSolverCounterSat, 165 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1434 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2024-11-14 03:32:14,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 862 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1434 Invalid, 5 Unknown, 0 Unchecked, 11.9s Time] [2024-11-14 03:32:14,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-14 03:32:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 308. [2024-11-14 03:32:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 221 states have (on average 1.5339366515837105) internal successors, (339), 260 states have internal predecessors, (339), 43 states have call successors, (43), 16 states have call predecessors, (43), 20 states have return successors, (57), 31 states have call predecessors, (57), 43 states have call successors, (57) [2024-11-14 03:32:14,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 439 transitions. [2024-11-14 03:32:14,545 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 439 transitions. Word has length 22 [2024-11-14 03:32:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:32:14,545 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 439 transitions. [2024-11-14 03:32:14,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 26 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:32:14,545 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 439 transitions. [2024-11-14 03:32:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 03:32:14,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:32:14,546 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] [2024-11-14 03:32:14,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 03:32:14,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:32:14,747 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:32:14,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:32:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash 397665208, now seen corresponding path program 1 times [2024-11-14 03:32:14,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:32:14,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299092082] [2024-11-14 03:32:14,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:32:14,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:32:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:32:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:32:15,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:32:15,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299092082] [2024-11-14 03:32:15,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299092082] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:32:15,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343039606] [2024-11-14 03:32:15,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:32:15,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:32:15,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:32:15,754 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:32:15,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 03:32:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:32:15,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-14 03:32:15,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:32:15,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:32:15,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:32:15,991 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 19 treesize of output 1 [2024-11-14 03:32:16,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:32:16,409 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 32 treesize of output 26 [2024-11-14 03:32:16,421 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:32:16,422 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 19 treesize of output 7 [2024-11-14 03:32:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:32:16,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:32:16,823 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 70 treesize of output 64 [2024-11-14 03:32:16,827 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 94 treesize of output 82 [2024-11-14 03:32:16,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:32:16,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:32:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:32:16,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343039606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:32:16,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2108067399] [2024-11-14 03:32:16,942 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-14 03:32:16,942 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:32:16,942 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:32:16,942 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:32:16,942 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:32:17,287 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 18 for LOIs [2024-11-14 03:32:17,295 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:32:20,880 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '8060#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_remove_~x#1.base|) 1) (= |ULTIMATE.start_remove_~x#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_remove_#t~mem5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 0)) (<= 8 (select |#length| |ULTIMATE.start_remove_~x#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 0) |ULTIMATE.start_remove_#t~mem5#1.base|) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (= |ULTIMATE.start_remove_~x#1.offset| 0) (<= 2 |ULTIMATE.start_main_~x~0#1.base|) (or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 4) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 4) 0))) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_52| Int)) (= 0 |v_ULTIMATE.start_main_#t~nondet16#1_52|)) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (or (< (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_~x#1.base|) 4)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 4) 4)) (< (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_~x#1.base|) 4) 0)))' at error location [2024-11-14 03:32:20,881 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:32:20,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:32:20,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 31 [2024-11-14 03:32:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432487862] [2024-11-14 03:32:20,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:32:20,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-14 03:32:20,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:32:20,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-14 03:32:20,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2260, Unknown=2, NotChecked=0, Total=2450 [2024-11-14 03:32:20,882 INFO L87 Difference]: Start difference. First operand 308 states and 439 transitions. Second operand has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 28 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:32:24,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:32:24,696 INFO L93 Difference]: Finished difference Result 456 states and 606 transitions. [2024-11-14 03:32:24,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 03:32:24,696 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 28 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2024-11-14 03:32:24,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:32:24,699 INFO L225 Difference]: With dead ends: 456 [2024-11-14 03:32:24,699 INFO L226 Difference]: Without dead ends: 456 [2024-11-14 03:32:24,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=415, Invalid=3743, Unknown=2, NotChecked=0, Total=4160 [2024-11-14 03:32:24,700 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 618 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 2030 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 2030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:32:24,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 885 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 2030 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 03:32:24,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-14 03:32:24,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 350. [2024-11-14 03:32:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 252 states have (on average 1.5238095238095237) internal successors, (384), 293 states have internal predecessors, (384), 50 states have call successors, (50), 20 states have call predecessors, (50), 24 states have return successors, (64), 36 states have call predecessors, (64), 50 states have call successors, (64) [2024-11-14 03:32:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 498 transitions. [2024-11-14 03:32:24,717 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 498 transitions. Word has length 22 [2024-11-14 03:32:24,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:32:24,718 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 498 transitions. [2024-11-14 03:32:24,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 28 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-14 03:32:24,718 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 498 transitions. [2024-11-14 03:32:24,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:32:24,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:32:24,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:32:24,739 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-14 03:32:24,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-14 03:32:24,923 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:32:24,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:32:24,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1458207566, now seen corresponding path program 1 times [2024-11-14 03:32:24,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:32:24,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354207022] [2024-11-14 03:32:24,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:32:24,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:32:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:32:24,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:32:24,994 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:32:24,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354207022] [2024-11-14 03:32:24,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354207022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:32:24,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:32:24,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:32:24,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246832784] [2024-11-14 03:32:24,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:32:24,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:32:24,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:32:24,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:32:24,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:32:24,996 INFO L87 Difference]: Start difference. First operand 350 states and 498 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:32:25,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:32:25,222 INFO L93 Difference]: Finished difference Result 360 states and 490 transitions. [2024-11-14 03:32:25,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:32:25,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-14 03:32:25,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:32:25,224 INFO L225 Difference]: With dead ends: 360 [2024-11-14 03:32:25,224 INFO L226 Difference]: Without dead ends: 360 [2024-11-14 03:32:25,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:32:25,226 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 164 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:32:25,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 140 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:32:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-14 03:32:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 347. [2024-11-14 03:32:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 252 states have (on average 1.4642857142857142) internal successors, (369), 290 states have internal predecessors, (369), 50 states have call successors, (50), 20 states have call predecessors, (50), 24 states have return successors, (64), 36 states have call predecessors, (64), 50 states have call successors, (64) [2024-11-14 03:32:25,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 483 transitions. [2024-11-14 03:32:25,244 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 483 transitions. Word has length 24 [2024-11-14 03:32:25,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:32:25,244 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 483 transitions. [2024-11-14 03:32:25,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:32:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 483 transitions. [2024-11-14 03:32:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:32:25,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:32:25,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:32:25,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-14 03:32:25,246 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:32:25,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:32:25,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1458207565, now seen corresponding path program 1 times [2024-11-14 03:32:25,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:32:25,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729939424] [2024-11-14 03:32:25,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:32:25,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:32:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:32:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:32:25,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:32:25,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729939424] [2024-11-14 03:32:25,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729939424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:32:25,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:32:25,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:32:25,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129960842] [2024-11-14 03:32:25,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:32:25,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:32:25,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:32:25,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:32:25,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:32:25,375 INFO L87 Difference]: Start difference. First operand 347 states and 483 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:32:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:32:25,658 INFO L93 Difference]: Finished difference Result 357 states and 483 transitions. [2024-11-14 03:32:25,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:32:25,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-14 03:32:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:32:25,660 INFO L225 Difference]: With dead ends: 357 [2024-11-14 03:32:25,661 INFO L226 Difference]: Without dead ends: 357 [2024-11-14 03:32:25,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-14 03:32:25,661 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 126 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:32:25,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 182 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:32:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-14 03:32:25,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 347. [2024-11-14 03:32:25,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 252 states have (on average 1.4365079365079365) internal successors, (362), 290 states have internal predecessors, (362), 50 states have call successors, (50), 20 states have call predecessors, (50), 24 states have return successors, (64), 36 states have call predecessors, (64), 50 states have call successors, (64) [2024-11-14 03:32:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 476 transitions. [2024-11-14 03:32:25,678 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 476 transitions. Word has length 24 [2024-11-14 03:32:25,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:32:25,679 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 476 transitions. [2024-11-14 03:32:25,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:32:25,679 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 476 transitions. [2024-11-14 03:32:25,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 03:32:25,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:32:25,681 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:32:25,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-14 03:32:25,681 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:32:25,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:32:25,681 INFO L85 PathProgramCache]: Analyzing trace with hash 230607705, now seen corresponding path program 1 times [2024-11-14 03:32:25,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:32:25,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261659513] [2024-11-14 03:32:25,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:32:25,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:32:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:32:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:32:26,364 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:32:26,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261659513] [2024-11-14 03:32:26,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261659513] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:32:26,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564086673] [2024-11-14 03:32:26,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:32:26,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:32:26,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:32:26,367 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:32:26,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-14 03:32:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:32:26,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-14 03:32:26,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:32:26,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-14 03:32:26,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:32:26,877 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 30 treesize of output 24 [2024-11-14 03:32:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:32:26,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:32:27,128 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 32 treesize of output 26 [2024-11-14 03:32:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:32:27,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564086673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:32:27,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1228616784] [2024-11-14 03:32:27,171 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-14 03:32:27,171 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:32:27,172 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:32:27,172 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:32:27,172 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:32:27,554 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 21 for LOIs [2024-11-14 03:32:27,565 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:32:41,581 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10510#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 4) 0) (<= 1 |#StackHeapBarrier|) (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_58| Int)) (= 0 |v_ULTIMATE.start_main_#t~nondet16#1_58|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0))) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (<= 2 |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= |ULTIMATE.start_remove_#t~mem8#1.offset| 0) (= |ULTIMATE.start_remove_#t~mem8#1.base| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 4) 0) (= |ULTIMATE.start_remove_#t~mem7#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1)))' at error location [2024-11-14 03:32:41,581 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:32:41,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:32:41,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 26 [2024-11-14 03:32:41,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212413466] [2024-11-14 03:32:41,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:32:41,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 03:32:41,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:32:41,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 03:32:41,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1894, Unknown=6, NotChecked=0, Total=2070 [2024-11-14 03:32:41,583 INFO L87 Difference]: Start difference. First operand 347 states and 476 transitions. Second operand has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:32:43,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:45,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:47,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:49,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:51,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:53,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:56,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:32:58,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:00,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:02,626 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:04,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:06,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:08,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:10,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:12,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:14,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:16,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:18,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:20,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:23,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:25,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:27,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:29,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:31,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:33,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:33:33,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:33:33,734 INFO L93 Difference]: Finished difference Result 393 states and 500 transitions. [2024-11-14 03:33:33,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-14 03:33:33,735 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2024-11-14 03:33:33,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:33:33,737 INFO L225 Difference]: With dead ends: 393 [2024-11-14 03:33:33,737 INFO L226 Difference]: Without dead ends: 393 [2024-11-14 03:33:33,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=344, Invalid=3190, Unknown=6, NotChecked=0, Total=3540 [2024-11-14 03:33:33,739 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 553 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 146 mSolverCounterUnsat, 25 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 25 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:33:33,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 1055 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1236 Invalid, 25 Unknown, 0 Unchecked, 51.4s Time] [2024-11-14 03:33:33,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-14 03:33:33,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 308. [2024-11-14 03:33:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 223 states have (on average 1.4394618834080717) internal successors, (321), 256 states have internal predecessors, (321), 41 states have call successors, (41), 19 states have call predecessors, (41), 23 states have return successors, (53), 32 states have call predecessors, (53), 41 states have call successors, (53) [2024-11-14 03:33:33,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 415 transitions. [2024-11-14 03:33:33,753 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 415 transitions. Word has length 24 [2024-11-14 03:33:33,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:33:33,754 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 415 transitions. [2024-11-14 03:33:33,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.7692307692307692) internal successors, (46), 22 states have internal predecessors, (46), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-14 03:33:33,754 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 415 transitions. [2024-11-14 03:33:33,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:33:33,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:33:33,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:33:33,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-14 03:33:33,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:33:33,960 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:33:33,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:33:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash 2132674844, now seen corresponding path program 1 times [2024-11-14 03:33:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:33:33,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592356939] [2024-11-14 03:33:33,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:33:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:34,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:33:34,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:33:34,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592356939] [2024-11-14 03:33:34,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592356939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:33:34,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:33:34,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:33:34,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146898052] [2024-11-14 03:33:34,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:33:34,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:33:34,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:33:34,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:33:34,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:33:34,221 INFO L87 Difference]: Start difference. First operand 308 states and 415 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:33:34,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:33:34,528 INFO L93 Difference]: Finished difference Result 310 states and 411 transitions. [2024-11-14 03:33:34,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:33:34,529 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-14 03:33:34,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:33:34,531 INFO L225 Difference]: With dead ends: 310 [2024-11-14 03:33:34,531 INFO L226 Difference]: Without dead ends: 310 [2024-11-14 03:33:34,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:33:34,532 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 81 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:33:34,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 332 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:33:34,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-14 03:33:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 304. [2024-11-14 03:33:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 219 states have (on average 1.4292237442922375) internal successors, (313), 252 states have internal predecessors, (313), 41 states have call successors, (41), 19 states have call predecessors, (41), 23 states have return successors, (53), 32 states have call predecessors, (53), 41 states have call successors, (53) [2024-11-14 03:33:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 407 transitions. [2024-11-14 03:33:34,548 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 407 transitions. Word has length 27 [2024-11-14 03:33:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:33:34,549 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 407 transitions. [2024-11-14 03:33:34,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:33:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 407 transitions. [2024-11-14 03:33:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 03:33:34,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:33:34,551 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:33:34,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-14 03:33:34,552 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:33:34,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:33:34,552 INFO L85 PathProgramCache]: Analyzing trace with hash 144309159, now seen corresponding path program 1 times [2024-11-14 03:33:34,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:33:34,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477789655] [2024-11-14 03:33:34,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:34,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:33:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:34,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 03:33:34,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:33:34,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477789655] [2024-11-14 03:33:34,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477789655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:33:34,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:33:34,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:33:34,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895988070] [2024-11-14 03:33:34,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:33:34,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:33:34,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:33:34,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:33:34,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:33:34,620 INFO L87 Difference]: Start difference. First operand 304 states and 407 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:33:34,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:33:34,678 INFO L93 Difference]: Finished difference Result 309 states and 408 transitions. [2024-11-14 03:33:34,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:33:34,678 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-14 03:33:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:33:34,680 INFO L225 Difference]: With dead ends: 309 [2024-11-14 03:33:34,680 INFO L226 Difference]: Without dead ends: 309 [2024-11-14 03:33:34,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:33:34,681 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 18 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:33:34,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 232 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:33:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-14 03:33:34,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 268. [2024-11-14 03:33:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 194 states have (on average 1.4175257731958764) internal successors, (275), 225 states have internal predecessors, (275), 33 states have call successors, (33), 16 states have call predecessors, (33), 20 states have return successors, (45), 26 states have call predecessors, (45), 33 states have call successors, (45) [2024-11-14 03:33:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 353 transitions. [2024-11-14 03:33:34,693 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 353 transitions. Word has length 28 [2024-11-14 03:33:34,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:33:34,694 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 353 transitions. [2024-11-14 03:33:34,694 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), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:33:34,694 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 353 transitions. [2024-11-14 03:33:34,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:33:34,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:33:34,695 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:33:34,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-14 03:33:34,695 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:33:34,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:33:34,695 INFO L85 PathProgramCache]: Analyzing trace with hash -462267674, now seen corresponding path program 1 times [2024-11-14 03:33:34,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:33:34,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523239514] [2024-11-14 03:33:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:34,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:33:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:34,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:33:34,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:33:34,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523239514] [2024-11-14 03:33:34,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523239514] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:33:34,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839644903] [2024-11-14 03:33:34,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:34,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:33:34,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:33:34,923 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:33:34,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-14 03:33:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:35,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-14 03:33:35,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:33:35,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:33:35,565 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 9 treesize of output 3 [2024-11-14 03:33:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:33:35,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:33:35,694 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 10 treesize of output 4 [2024-11-14 03:33:36,010 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 10 treesize of output 4 [2024-11-14 03:33:36,160 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-14 03:33:36,160 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 29 treesize of output 28 [2024-11-14 03:33:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:33:36,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839644903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:33:36,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1644899352] [2024-11-14 03:33:36,167 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 03:33:36,167 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:33:36,168 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:33:36,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:33:36,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 25 [2024-11-14 03:33:36,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655598911] [2024-11-14 03:33:36,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:33:36,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 03:33:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:33:36,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 03:33:36,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2024-11-14 03:33:36,170 INFO L87 Difference]: Start difference. First operand 268 states and 353 transitions. Second operand has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 24 states have internal predecessors, (58), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:33:38,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:33:38,172 INFO L93 Difference]: Finished difference Result 515 states and 698 transitions. [2024-11-14 03:33:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-14 03:33:38,173 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 24 states have internal predecessors, (58), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2024-11-14 03:33:38,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:33:38,175 INFO L225 Difference]: With dead ends: 515 [2024-11-14 03:33:38,176 INFO L226 Difference]: Without dead ends: 515 [2024-11-14 03:33:38,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=477, Invalid=2493, Unknown=0, NotChecked=0, Total=2970 [2024-11-14 03:33:38,177 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 683 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:33:38,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 553 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 03:33:38,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-11-14 03:33:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 355. [2024-11-14 03:33:38,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 261 states have (on average 1.4444444444444444) internal successors, (377), 298 states have internal predecessors, (377), 45 states have call successors, (45), 22 states have call predecessors, (45), 28 states have return successors, (72), 34 states have call predecessors, (72), 45 states have call successors, (72) [2024-11-14 03:33:38,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 494 transitions. [2024-11-14 03:33:38,195 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 494 transitions. Word has length 27 [2024-11-14 03:33:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:33:38,195 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 494 transitions. [2024-11-14 03:33:38,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 24 states have internal predecessors, (58), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:33:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 494 transitions. [2024-11-14 03:33:38,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:33:38,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:33:38,196 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:33:38,217 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-14 03:33:38,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-14 03:33:38,401 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:33:38,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:33:38,401 INFO L85 PathProgramCache]: Analyzing trace with hash -462267673, now seen corresponding path program 1 times [2024-11-14 03:33:38,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:33:38,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036692278] [2024-11-14 03:33:38,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:38,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:33:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:33:38,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:33:38,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036692278] [2024-11-14 03:33:38,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036692278] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:33:38,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274960024] [2024-11-14 03:33:38,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:38,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:33:38,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:33:38,732 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:33:38,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-14 03:33:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:38,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 03:33:38,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:33:38,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:33:39,538 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 7 treesize of output 3 [2024-11-14 03:33:39,546 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 7 treesize of output 3 [2024-11-14 03:33:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:33:39,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:33:39,929 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 10 treesize of output 4 [2024-11-14 03:33:39,934 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 24 treesize of output 12 [2024-11-14 03:33:40,273 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 10 treesize of output 4 [2024-11-14 03:33:40,282 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 10 treesize of output 4 [2024-11-14 03:33:40,512 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 28 treesize of output 26 [2024-11-14 03:33:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:33:40,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274960024] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:33:40,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1925909843] [2024-11-14 03:33:40,560 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 03:33:40,561 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:33:40,561 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:33:40,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:33:40,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2024-11-14 03:33:40,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194436002] [2024-11-14 03:33:40,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:33:40,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-14 03:33:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:33:40,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-14 03:33:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=792, Unknown=0, NotChecked=0, Total=930 [2024-11-14 03:33:40,563 INFO L87 Difference]: Start difference. First operand 355 states and 494 transitions. Second operand has 31 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:33:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:33:43,969 INFO L93 Difference]: Finished difference Result 530 states and 702 transitions. [2024-11-14 03:33:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 03:33:43,970 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 27 [2024-11-14 03:33:43,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:33:43,972 INFO L225 Difference]: With dead ends: 530 [2024-11-14 03:33:43,972 INFO L226 Difference]: Without dead ends: 530 [2024-11-14 03:33:43,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=443, Invalid=2419, Unknown=0, NotChecked=0, Total=2862 [2024-11-14 03:33:43,973 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 1021 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2005 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 2212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 2005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:33:43,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 1093 Invalid, 2212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 2005 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 03:33:43,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-14 03:33:43,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 320. [2024-11-14 03:33:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 237 states have (on average 1.4388185654008439) internal successors, (341), 269 states have internal predecessors, (341), 42 states have call successors, (42), 19 states have call predecessors, (42), 20 states have return successors, (59), 31 states have call predecessors, (59), 42 states have call successors, (59) [2024-11-14 03:33:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 442 transitions. [2024-11-14 03:33:43,996 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 442 transitions. Word has length 27 [2024-11-14 03:33:43,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:33:43,996 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 442 transitions. [2024-11-14 03:33:43,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.2857142857142856) internal successors, (64), 27 states have internal predecessors, (64), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:33:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 442 transitions. [2024-11-14 03:33:43,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:33:43,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:33:43,997 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:33:44,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-14 03:33:44,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-14 03:33:44,202 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:33:44,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:33:44,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1487090339, now seen corresponding path program 2 times [2024-11-14 03:33:44,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:33:44,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180438215] [2024-11-14 03:33:44,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:44,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:33:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:33:44,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:33:44,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180438215] [2024-11-14 03:33:44,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180438215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:33:44,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212197337] [2024-11-14 03:33:44,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:33:44,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:33:44,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:33:44,730 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:33:44,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-14 03:33:44,881 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:33:44,881 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:33:44,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-14 03:33:44,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:33:44,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:33:45,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:33:45,037 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 19 treesize of output 1 [2024-11-14 03:33:45,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-14 03:33:45,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:33:45,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:33:45,424 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 34 treesize of output 28 [2024-11-14 03:33:45,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:33:45,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:33:45,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:33:45,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:33:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:33:45,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212197337] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:33:45,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [366427457] [2024-11-14 03:33:45,544 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:33:45,544 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:33:45,544 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:33:45,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:33:45,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2024-11-14 03:33:45,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615386417] [2024-11-14 03:33:45,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:33:45,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-14 03:33:45,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:33:45,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-14 03:33:45,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2024-11-14 03:33:45,549 INFO L87 Difference]: Start difference. First operand 320 states and 442 transitions. Second operand has 27 states, 23 states have (on average 2.739130434782609) internal successors, (63), 21 states have internal predecessors, (63), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:33:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:33:46,793 INFO L93 Difference]: Finished difference Result 351 states and 478 transitions. [2024-11-14 03:33:46,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-14 03:33:46,794 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 2.739130434782609) internal successors, (63), 21 states have internal predecessors, (63), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-14 03:33:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:33:46,795 INFO L225 Difference]: With dead ends: 351 [2024-11-14 03:33:46,795 INFO L226 Difference]: Without dead ends: 351 [2024-11-14 03:33:46,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2024-11-14 03:33:46,796 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 268 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:33:46,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 963 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-14 03:33:46,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-14 03:33:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 320. [2024-11-14 03:33:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 237 states have (on average 1.4345991561181435) internal successors, (340), 269 states have internal predecessors, (340), 42 states have call successors, (42), 19 states have call predecessors, (42), 20 states have return successors, (59), 31 states have call predecessors, (59), 42 states have call successors, (59) [2024-11-14 03:33:46,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 441 transitions. [2024-11-14 03:33:46,815 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 441 transitions. Word has length 27 [2024-11-14 03:33:46,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:33:46,815 INFO L471 AbstractCegarLoop]: Abstraction has 320 states and 441 transitions. [2024-11-14 03:33:46,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 2.739130434782609) internal successors, (63), 21 states have internal predecessors, (63), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:33:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 441 transitions. [2024-11-14 03:33:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 03:33:46,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:33:46,817 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:33:46,839 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-14 03:33:47,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-14 03:33:47,022 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:33:47,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:33:47,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1457535510, now seen corresponding path program 1 times [2024-11-14 03:33:47,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:33:47,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300578296] [2024-11-14 03:33:47,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:47,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:33:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:33:48,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:33:48,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300578296] [2024-11-14 03:33:48,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300578296] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:33:48,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684014037] [2024-11-14 03:33:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:33:48,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:33:48,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:33:48,031 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:33:48,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-14 03:33:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:33:48,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-11-14 03:33:48,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:33:48,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:33:48,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:33:48,287 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 21 treesize of output 20 [2024-11-14 03:33:48,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-14 03:33:48,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:33:48,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-14 03:33:48,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:33:48,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-14 03:33:48,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:33:48,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-14 03:33:48,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:33:48,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-14 03:33:48,596 INFO L349 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2024-11-14 03:33:48,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 33 [2024-11-14 03:33:48,632 INFO L349 Elim1Store]: treesize reduction 38, result has 30.9 percent of original size [2024-11-14 03:33:48,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 32 [2024-11-14 03:33:50,967 INFO L349 Elim1Store]: treesize reduction 92, result has 38.3 percent of original size [2024-11-14 03:33:50,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 204 treesize of output 232 [2024-11-14 03:33:50,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:33:51,081 INFO L349 Elim1Store]: treesize reduction 96, result has 42.2 percent of original size [2024-11-14 03:33:51,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 147 treesize of output 183 [2024-11-14 03:33:51,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:51,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:33:51,987 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 22 treesize of output 30 [2024-11-14 03:33:52,093 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:33:52,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:33:52,129 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 22 treesize of output 30 [2024-11-14 03:33:52,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:33:52,297 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 22 treesize of output 30 [2024-11-14 03:33:54,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:54,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:54,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:55,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:55,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:55,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:55,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:55,774 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:33:55,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:56,280 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 03:33:56,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:56,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:56,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:56,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:33:57,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:57,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:57,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:57,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:57,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:57,578 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:33:57,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:58,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:58,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:58,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:58,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:58,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:33:58,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:58,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:33:58,973 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 22 treesize of output 30 [2024-11-14 03:33:59,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:59,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:33:59,091 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 22 treesize of output 30 [2024-11-14 03:33:59,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:59,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:33:59,208 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 22 treesize of output 30 [2024-11-14 03:33:59,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:59,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:59,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:59,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:33:59,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:33:59,774 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:33:59,775 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 22 treesize of output 30 [2024-11-14 03:33:59,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:34:12,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:34:12,732 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 22 treesize of output 30 [2024-11-14 03:34:13,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:13,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:14,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:34:14,060 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 22 treesize of output 30 [2024-11-14 03:34:14,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:14,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:14,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:14,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:28,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:28,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:29,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:30,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:30,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:30,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:34:30,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:30,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:34:30,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:39,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-14 03:34:39,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2024-11-14 03:34:39,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:34:39,758 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 22 treesize of output 30 [2024-11-14 03:34:50,662 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-14 03:34:50,662 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 10 [2024-11-14 03:34:51,021 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-14 03:34:51,021 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 10 [2024-11-14 03:34:51,217 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-14 03:34:51,217 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 10 [2024-11-14 03:34:51,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-14 03:34:51,683 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-14 03:34:51,683 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 10 [2024-11-14 03:34:52,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:34:52,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:34:52,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2024-11-14 03:34:52,861 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 17 treesize of output 7 [2024-11-14 03:34:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:34:52,925 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:34:53,139 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2024-11-14 03:34:53,139 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 19 treesize of output 18 [2024-11-14 03:34:53,386 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_remove_~x#1.offset| 4))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) .cse2))) (and (or (forall ((v_ArrVal_1245 (Array Int Int))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1245) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|))) (forall ((v_ArrVal_1246 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1246) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0))) (forall ((v_ArrVal_1245 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1245) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|))) (or (= .cse0 .cse1) (= .cse1 0)))))) (and (= |c_ULTIMATE.start_remove_#t~mem3#1.offset| 0) (= |c_ULTIMATE.start_remove_#t~mem3#1.base| 0)) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_~x#1.base|) .cse2) 0))) is different from false [2024-11-14 03:34:53,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684014037] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:34:53,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [794515012] [2024-11-14 03:34:53,826 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-14 03:34:53,826 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:34:53,826 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:34:53,826 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:34:53,826 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:34:54,135 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 18 for LOIs [2024-11-14 03:34:54,146 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:35:00,472 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '15691#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 4) |ULTIMATE.start_remove_#t~mem8#1.base|) (<= 1 |#StackHeapBarrier|) (<= 8 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_#t~nondet16#1_69| Int)) (= 0 |v_ULTIMATE.start_main_#t~nondet16#1_69|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0))) (= |ULTIMATE.start_remove_#t~mem8#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 4)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~tail~0#1.base|) (exists ((|v_#memory_$Pointer$.base_206| (Array Int (Array Int Int))) (|v_#memory_int_178| (Array Int (Array Int Int))) (|v_#memory_$Pointer$.offset_201| (Array Int (Array Int Int)))) (and (<= (+ (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) 4) 4) (select |#length| (select (select |v_#memory_$Pointer$.base_206| |ULTIMATE.start_main_~x~0#1.base|) 4))) (= (select |#valid| (select (select |v_#memory_$Pointer$.base_206| |ULTIMATE.start_main_~x~0#1.base|) 4)) 1) (or (not (= (select (select |v_#memory_$Pointer$.base_206| |ULTIMATE.start_main_~x~0#1.base|) 4) 0)) (not (= (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) 4) 0))) (<= 0 (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) 4)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_201| (select (select |v_#memory_$Pointer$.base_206| |ULTIMATE.start_main_~x~0#1.base|) 4) (store (select |v_#memory_$Pointer$.offset_201| (select (select |v_#memory_$Pointer$.base_206| |ULTIMATE.start_main_~x~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) 4) (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) 0)))) (= |#memory_int| (store |v_#memory_int_178| (select (select |v_#memory_$Pointer$.base_206| |ULTIMATE.start_main_~x~0#1.base|) 4) (store (select |v_#memory_int_178| (select (select |v_#memory_$Pointer$.base_206| |ULTIMATE.start_main_~x~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) 4) (select (select |#memory_int| (select (select |v_#memory_$Pointer$.base_206| |ULTIMATE.start_main_~x~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) 4))))) (= (store |v_#memory_$Pointer$.base_206| (select (select |v_#memory_$Pointer$.base_206| |ULTIMATE.start_main_~x~0#1.base|) 4) (store (select |v_#memory_$Pointer$.base_206| (select (select |v_#memory_$Pointer$.base_206| |ULTIMATE.start_main_~x~0#1.base|) 4)) (select (select |v_#memory_$Pointer$.offset_201| |ULTIMATE.start_main_~x~0#1.base|) 4) (select (select |v_#memory_$Pointer$.base_206| |ULTIMATE.start_main_~x~0#1.base|) 0))) |#memory_$Pointer$.base|))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (<= 2 |ULTIMATE.start_main_~x~0#1.base|) (= |ULTIMATE.start_main_~tail~0#1.offset| 0) (= |ULTIMATE.start_remove_#t~mem7#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0)) (not (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1)))' at error location [2024-11-14 03:35:00,472 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-14 03:35:00,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:35:00,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 28 [2024-11-14 03:35:00,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965386696] [2024-11-14 03:35:00,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 03:35:00,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 03:35:00,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:00,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 03:35:00,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3296, Unknown=6, NotChecked=116, Total=3660 [2024-11-14 03:35:00,475 INFO L87 Difference]: Start difference. First operand 320 states and 441 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 24 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:35:03,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:35:11,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:35:17,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:35:19,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:35:22,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:35:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:22,532 INFO L93 Difference]: Finished difference Result 469 states and 581 transitions. [2024-11-14 03:35:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 03:35:22,532 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 24 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-14 03:35:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:22,534 INFO L225 Difference]: With dead ends: 469 [2024-11-14 03:35:22,535 INFO L226 Difference]: Without dead ends: 469 [2024-11-14 03:35:22,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=663, Invalid=6475, Unknown=6, NotChecked=166, Total=7310 [2024-11-14 03:35:22,537 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 855 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 166 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:22,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 1372 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1668 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2024-11-14 03:35:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-14 03:35:22,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 357. [2024-11-14 03:35:22,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 264 states have (on average 1.4053030303030303) internal successors, (371), 296 states have internal predecessors, (371), 47 states have call successors, (47), 24 states have call predecessors, (47), 25 states have return successors, (64), 36 states have call predecessors, (64), 47 states have call successors, (64) [2024-11-14 03:35:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 482 transitions. [2024-11-14 03:35:22,552 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 482 transitions. Word has length 27 [2024-11-14 03:35:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:22,552 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 482 transitions. [2024-11-14 03:35:22,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 24 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:35:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 482 transitions. [2024-11-14 03:35:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 03:35:22,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:22,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:22,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-14 03:35:22,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:22,755 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:35:22,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:22,755 INFO L85 PathProgramCache]: Analyzing trace with hash 808794665, now seen corresponding path program 1 times [2024-11-14 03:35:22,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:22,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536494259] [2024-11-14 03:35:22,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:22,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:22,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:35:22,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:22,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536494259] [2024-11-14 03:35:22,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536494259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:35:22,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:35:22,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 03:35:22,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677937173] [2024-11-14 03:35:22,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:35:22,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:35:22,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:22,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:35:22,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:35:22,932 INFO L87 Difference]: Start difference. First operand 357 states and 482 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:35:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:23,292 INFO L93 Difference]: Finished difference Result 385 states and 517 transitions. [2024-11-14 03:35:23,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:35:23,292 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-14 03:35:23,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:23,294 INFO L225 Difference]: With dead ends: 385 [2024-11-14 03:35:23,294 INFO L226 Difference]: Without dead ends: 385 [2024-11-14 03:35:23,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:35:23,295 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 34 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:23,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 300 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:35:23,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-14 03:35:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 367. [2024-11-14 03:35:23,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 272 states have (on average 1.3897058823529411) internal successors, (378), 303 states have internal predecessors, (378), 50 states have call successors, (50), 23 states have call predecessors, (50), 24 states have return successors, (68), 40 states have call predecessors, (68), 50 states have call successors, (68) [2024-11-14 03:35:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 496 transitions. [2024-11-14 03:35:23,308 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 496 transitions. Word has length 29 [2024-11-14 03:35:23,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:23,308 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 496 transitions. [2024-11-14 03:35:23,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:35:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 496 transitions. [2024-11-14 03:35:23,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:35:23,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:23,310 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:23,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-14 03:35:23,310 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:35:23,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:23,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1550557994, now seen corresponding path program 1 times [2024-11-14 03:35:23,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:23,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781279173] [2024-11-14 03:35:23,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:24,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:35:24,046 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:24,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781279173] [2024-11-14 03:35:24,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781279173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:35:24,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964658875] [2024-11-14 03:35:24,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:24,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:24,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:35:24,050 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:35:24,052 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-14 03:35:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:24,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 77 conjuncts are in the unsatisfiable core [2024-11-14 03:35:24,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:35:24,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:35:24,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:35:24,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:35:24,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:35:24,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:35:24,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-14 03:35:25,774 INFO L349 Elim1Store]: treesize reduction 48, result has 65.0 percent of original size [2024-11-14 03:35:25,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 120 treesize of output 178 [2024-11-14 03:35:25,983 INFO L349 Elim1Store]: treesize reduction 48, result has 65.0 percent of original size [2024-11-14 03:35:25,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 96 treesize of output 154 [2024-11-14 03:35:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:35:30,097 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:35:32,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:32,273 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 84 treesize of output 74 [2024-11-14 03:35:32,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:32,282 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 118 treesize of output 78 [2024-11-14 03:35:32,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:32,301 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 100 treesize of output 93 [2024-11-14 03:35:32,310 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 52 treesize of output 44 [2024-11-14 03:35:32,594 INFO L349 Elim1Store]: treesize reduction 34, result has 83.2 percent of original size [2024-11-14 03:35:32,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 262 treesize of output 355 [2024-11-14 03:35:32,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:32,648 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 192 treesize of output 180 [2024-11-14 03:35:35,759 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:35,760 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 84 treesize of output 64 [2024-11-14 03:35:35,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:35,770 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 108 treesize of output 78 [2024-11-14 03:35:35,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:35:35,781 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:35:35,804 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-14 03:35:35,804 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 166 treesize of output 126 [2024-11-14 03:35:35,824 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-14 03:35:35,824 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 200 treesize of output 164 [2024-11-14 03:35:35,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:35,858 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 96 treesize of output 100 [2024-11-14 03:35:35,868 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 71 treesize of output 51 [2024-11-14 03:35:36,204 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:36,205 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 106 treesize of output 86 [2024-11-14 03:35:36,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:36,216 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 96 treesize of output 66 [2024-11-14 03:35:36,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:36,237 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 125 treesize of output 112 [2024-11-14 03:35:36,506 INFO L349 Elim1Store]: treesize reduction 86, result has 63.2 percent of original size [2024-11-14 03:35:36,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 261 treesize of output 332 [2024-11-14 03:35:36,532 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 144 treesize of output 108 [2024-11-14 03:35:36,585 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-14 03:35:36,585 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 139 [2024-11-14 03:35:39,738 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:35:39,739 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 84 treesize of output 1 [2024-11-14 03:35:39,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:39,756 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 106 treesize of output 86 [2024-11-14 03:35:39,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:39,775 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 96 treesize of output 66 [2024-11-14 03:35:39,818 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-14 03:35:39,819 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 125 treesize of output 101 [2024-11-14 03:35:39,853 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:35:40,057 INFO L349 Elim1Store]: treesize reduction 137, result has 38.6 percent of original size [2024-11-14 03:35:40,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 261 treesize of output 270 [2024-11-14 03:35:40,079 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 127 treesize of output 95 [2024-11-14 03:35:40,119 INFO L349 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2024-11-14 03:35:40,119 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 122 treesize of output 110 [2024-11-14 03:35:40,240 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:35:40,240 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 106 treesize of output 1 [2024-11-14 03:35:40,254 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:35:40,255 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 84 treesize of output 1 [2024-11-14 03:35:40,273 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:35:40,273 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 106 treesize of output 1 [2024-11-14 03:35:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:35:41,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964658875] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:35:41,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2136645649] [2024-11-14 03:35:41,143 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-14 03:35:41,143 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:35:41,143 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:35:41,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:35:41,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 17] total 39 [2024-11-14 03:35:41,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642622072] [2024-11-14 03:35:41,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:35:41,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-14 03:35:41,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:35:41,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-14 03:35:41,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1314, Unknown=3, NotChecked=0, Total=1482 [2024-11-14 03:35:41,147 INFO L87 Difference]: Start difference. First operand 367 states and 496 transitions. Second operand has 39 states, 37 states have (on average 1.945945945945946) internal successors, (72), 35 states have internal predecessors, (72), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:35:44,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:35:48,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:35:50,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:35:53,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:35:55,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:35:56,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:35:56,280 INFO L93 Difference]: Finished difference Result 471 states and 623 transitions. [2024-11-14 03:35:56,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-14 03:35:56,281 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 1.945945945945946) internal successors, (72), 35 states have internal predecessors, (72), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 31 [2024-11-14 03:35:56,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:35:56,283 INFO L225 Difference]: With dead ends: 471 [2024-11-14 03:35:56,283 INFO L226 Difference]: Without dead ends: 467 [2024-11-14 03:35:56,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=467, Invalid=3190, Unknown=3, NotChecked=0, Total=3660 [2024-11-14 03:35:56,284 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 364 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 104 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 1930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:35:56,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1739 Invalid, 1930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1821 Invalid, 5 Unknown, 0 Unchecked, 13.3s Time] [2024-11-14 03:35:56,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-11-14 03:35:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 380. [2024-11-14 03:35:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 281 states have (on average 1.3807829181494662) internal successors, (388), 312 states have internal predecessors, (388), 51 states have call successors, (51), 26 states have call predecessors, (51), 27 states have return successors, (69), 41 states have call predecessors, (69), 51 states have call successors, (69) [2024-11-14 03:35:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 508 transitions. [2024-11-14 03:35:56,302 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 508 transitions. Word has length 31 [2024-11-14 03:35:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:35:56,303 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 508 transitions. [2024-11-14 03:35:56,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 1.945945945945946) internal successors, (72), 35 states have internal predecessors, (72), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:35:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 508 transitions. [2024-11-14 03:35:56,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:35:56,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:35:56,304 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-14 03:35:56,328 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-14 03:35:56,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:56,504 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:35:56,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:35:56,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1406668885, now seen corresponding path program 2 times [2024-11-14 03:35:56,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:35:56,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298630895] [2024-11-14 03:35:56,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:35:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:35:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:35:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:35:57,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:35:57,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298630895] [2024-11-14 03:35:57,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298630895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:35:57,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326452908] [2024-11-14 03:35:57,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:35:57,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:35:57,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:35:57,656 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:35:57,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-14 03:35:57,855 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-14 03:35:57,855 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:35:57,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-14 03:35:57,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:35:57,962 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-14 03:35:57,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-14 03:35:58,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:35:58,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:35:58,093 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 33 treesize of output 21 [2024-11-14 03:35:58,105 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 33 treesize of output 21 [2024-11-14 03:35:58,639 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:35:58,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:35:59,201 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:59,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1679 treesize of output 1428 [2024-11-14 03:35:59,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:35:59,268 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 1338 treesize of output 1292 [2024-11-14 03:36:03,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:36:03,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:36:03,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:36:03,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:36:04,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:04,075 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 28 treesize of output 46 [2024-11-14 03:36:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:36:04,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326452908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:36:04,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [552917665] [2024-11-14 03:36:04,179 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2024-11-14 03:36:04,179 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:36:04,179 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:36:04,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:36:04,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 37 [2024-11-14 03:36:04,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961268397] [2024-11-14 03:36:04,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:36:04,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-14 03:36:04,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:36:04,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-14 03:36:04,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2024-11-14 03:36:04,181 INFO L87 Difference]: Start difference. First operand 380 states and 508 transitions. Second operand has 37 states, 34 states have (on average 2.264705882352941) internal successors, (77), 31 states have internal predecessors, (77), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:36:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:36:07,079 INFO L93 Difference]: Finished difference Result 387 states and 509 transitions. [2024-11-14 03:36:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-14 03:36:07,079 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 34 states have (on average 2.264705882352941) internal successors, (77), 31 states have internal predecessors, (77), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-14 03:36:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:36:07,081 INFO L225 Difference]: With dead ends: 387 [2024-11-14 03:36:07,082 INFO L226 Difference]: Without dead ends: 387 [2024-11-14 03:36:07,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=270, Invalid=2082, Unknown=0, NotChecked=0, Total=2352 [2024-11-14 03:36:07,083 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 290 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:36:07,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 1363 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-14 03:36:07,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2024-11-14 03:36:07,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 368. [2024-11-14 03:36:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 272 states have (on average 1.375) internal successors, (374), 303 states have internal predecessors, (374), 49 states have call successors, (49), 25 states have call predecessors, (49), 26 states have return successors, (67), 39 states have call predecessors, (67), 49 states have call successors, (67) [2024-11-14 03:36:07,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 490 transitions. [2024-11-14 03:36:07,096 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 490 transitions. Word has length 33 [2024-11-14 03:36:07,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:36:07,096 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 490 transitions. [2024-11-14 03:36:07,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 34 states have (on average 2.264705882352941) internal successors, (77), 31 states have internal predecessors, (77), 7 states have call successors, (7), 7 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:36:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 490 transitions. [2024-11-14 03:36:07,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:36:07,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:36:07,109 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:36:07,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-14 03:36:07,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:36:07,309 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:36:07,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:36:07,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1785630146, now seen corresponding path program 1 times [2024-11-14 03:36:07,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:36:07,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898809227] [2024-11-14 03:36:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:36:07,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:36:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:36:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:36:07,470 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:36:07,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898809227] [2024-11-14 03:36:07,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898809227] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:36:07,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915905342] [2024-11-14 03:36:07,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:36:07,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:36:07,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:36:07,473 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:36:07,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-14 03:36:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:36:07,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-14 03:36:07,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:36:07,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:36:07,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:36:07,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915905342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:36:07,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:36:07,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-14 03:36:07,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404536406] [2024-11-14 03:36:07,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:36:07,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 03:36:07,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:36:07,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 03:36:07,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-14 03:36:07,805 INFO L87 Difference]: Start difference. First operand 368 states and 490 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:36:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:36:08,157 INFO L93 Difference]: Finished difference Result 377 states and 493 transitions. [2024-11-14 03:36:08,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 03:36:08,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-14 03:36:08,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:36:08,160 INFO L225 Difference]: With dead ends: 377 [2024-11-14 03:36:08,160 INFO L226 Difference]: Without dead ends: 377 [2024-11-14 03:36:08,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-14 03:36:08,161 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 132 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:36:08,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 166 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:36:08,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-14 03:36:08,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 367. [2024-11-14 03:36:08,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 272 states have (on average 1.3345588235294117) internal successors, (363), 302 states have internal predecessors, (363), 49 states have call successors, (49), 25 states have call predecessors, (49), 26 states have return successors, (67), 39 states have call predecessors, (67), 49 states have call successors, (67) [2024-11-14 03:36:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 479 transitions. [2024-11-14 03:36:08,175 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 479 transitions. Word has length 33 [2024-11-14 03:36:08,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:36:08,175 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 479 transitions. [2024-11-14 03:36:08,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:36:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 479 transitions. [2024-11-14 03:36:08,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:36:08,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:36:08,176 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:36:08,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-14 03:36:08,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-14 03:36:08,381 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:36:08,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:36:08,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1785630147, now seen corresponding path program 1 times [2024-11-14 03:36:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:36:08,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569713993] [2024-11-14 03:36:08,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:36:08,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:36:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:36:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:36:08,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:36:08,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569713993] [2024-11-14 03:36:08,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569713993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:36:08,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540470112] [2024-11-14 03:36:08,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:36:08,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:36:08,719 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:36:08,721 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:36:08,723 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-14 03:36:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:36:08,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-14 03:36:08,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:36:09,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:36:09,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:36:09,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540470112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:36:09,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-14 03:36:09,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 17 [2024-11-14 03:36:09,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779085126] [2024-11-14 03:36:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:36:09,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 03:36:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:36:09,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 03:36:09,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-14 03:36:09,303 INFO L87 Difference]: Start difference. First operand 367 states and 479 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:36:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:36:10,121 INFO L93 Difference]: Finished difference Result 413 states and 525 transitions. [2024-11-14 03:36:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-14 03:36:10,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2024-11-14 03:36:10,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:36:10,124 INFO L225 Difference]: With dead ends: 413 [2024-11-14 03:36:10,124 INFO L226 Difference]: Without dead ends: 413 [2024-11-14 03:36:10,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2024-11-14 03:36:10,126 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 243 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:36:10,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 258 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-14 03:36:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-14 03:36:10,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 378. [2024-11-14 03:36:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 282 states have (on average 1.3297872340425532) internal successors, (375), 311 states have internal predecessors, (375), 50 states have call successors, (50), 25 states have call predecessors, (50), 26 states have return successors, (68), 41 states have call predecessors, (68), 50 states have call successors, (68) [2024-11-14 03:36:10,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 493 transitions. [2024-11-14 03:36:10,139 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 493 transitions. Word has length 33 [2024-11-14 03:36:10,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:36:10,139 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 493 transitions. [2024-11-14 03:36:10,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:36:10,139 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 493 transitions. [2024-11-14 03:36:10,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:36:10,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:36:10,140 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:36:10,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-14 03:36:10,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-14 03:36:10,342 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:36:10,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:36:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash 59013644, now seen corresponding path program 1 times [2024-11-14 03:36:10,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:36:10,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263633548] [2024-11-14 03:36:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:36:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:36:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:36:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:36:10,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:36:10,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263633548] [2024-11-14 03:36:10,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263633548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:36:10,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934145322] [2024-11-14 03:36:10,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:36:10,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:36:10,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:36:10,874 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:36:10,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-14 03:36:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:36:11,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-14 03:36:11,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:36:11,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:36:11,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:36:11,437 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-14 03:36:11,437 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 24 treesize of output 25 [2024-11-14 03:36:13,600 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34| Int)) (<= (+ 2 |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_BEFORE_CALL_34|) 0))) (exists ((|v_ULTIMATE.start_main_~n~0#1.base_80| Int)) (<= (+ |v_ULTIMATE.start_main_~n~0#1.base_80| 2) (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~n~0#1.base_80|) 0)))) is different from true [2024-11-14 03:36:22,297 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 7 treesize of output 3 [2024-11-14 03:36:22,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:22,809 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 56 treesize of output 55 [2024-11-14 03:36:22,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-14 03:36:22,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:36:23,118 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 10 treesize of output 4 [2024-11-14 03:36:23,129 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-11-14 03:36:23,129 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 15 [2024-11-14 03:36:23,746 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 10 treesize of output 4 [2024-11-14 03:36:23,761 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-11-14 03:36:23,761 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 15 [2024-11-14 03:36:24,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:24,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 51 [2024-11-14 03:36:24,592 INFO L349 Elim1Store]: treesize reduction 29, result has 61.8 percent of original size [2024-11-14 03:36:24,592 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 120 treesize of output 130 [2024-11-14 03:36:24,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:24,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 91 [2024-11-14 03:36:24,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:24,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 51 [2024-11-14 03:36:24,966 INFO L349 Elim1Store]: treesize reduction 4, result has 95.1 percent of original size [2024-11-14 03:36:24,966 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 120 treesize of output 161 [2024-11-14 03:36:24,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:24,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 98 [2024-11-14 03:36:25,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:25,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 63 [2024-11-14 03:36:25,842 INFO L349 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2024-11-14 03:36:25,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 154 [2024-11-14 03:36:25,867 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:36:25,868 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 114 treesize of output 86 [2024-11-14 03:36:26,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:36:26,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 63 [2024-11-14 03:36:26,230 INFO L349 Elim1Store]: treesize reduction 59, result has 22.4 percent of original size [2024-11-14 03:36:26,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 145 treesize of output 119 [2024-11-14 03:36:26,252 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2024-11-14 03:36:26,252 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 89 treesize of output 65 [2024-11-14 03:36:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:36:26,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934145322] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:36:26,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1109408629] [2024-11-14 03:36:26,941 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-14 03:36:26,941 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:36:26,942 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:36:26,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:36:26,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 18] total 44 [2024-11-14 03:36:26,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923872578] [2024-11-14 03:36:26,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:36:26,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-14 03:36:26,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:36:26,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-14 03:36:26,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1708, Unknown=9, NotChecked=84, Total=1980 [2024-11-14 03:36:26,946 INFO L87 Difference]: Start difference. First operand 378 states and 493 transitions. Second operand has 45 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 40 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:36:28,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:31,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:33,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:35,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:37,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:36:39,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:36:41,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:36:50,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:52,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:54,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:56,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:36:58,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:00,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:02,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:04,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:06,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:08,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:14,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:16,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:18,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:20,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:22,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:29,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:31,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:33,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:35,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:37,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:39,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:41,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:43,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:45,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:47,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:49,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:51,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:53,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:55,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:57,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:37:59,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:02,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:05,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:07,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:09,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:11,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:13,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:16,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:18,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:20,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:22,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:24,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:38:26,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:38:27,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:38:27,581 INFO L93 Difference]: Finished difference Result 415 states and 543 transitions. [2024-11-14 03:38:27,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-14 03:38:27,582 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 40 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2024-11-14 03:38:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:38:27,584 INFO L225 Difference]: With dead ends: 415 [2024-11-14 03:38:27,584 INFO L226 Difference]: Without dead ends: 415 [2024-11-14 03:38:27,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1206 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=470, Invalid=3808, Unknown=16, NotChecked=128, Total=4422 [2024-11-14 03:38:27,585 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 354 mSDsluCounter, 1864 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 97 mSolverCounterUnsat, 50 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 103.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 50 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 104.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:38:27,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1951 Invalid, 2738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2377 Invalid, 50 Unknown, 214 Unchecked, 104.3s Time] [2024-11-14 03:38:27,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-14 03:38:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 381. [2024-11-14 03:38:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 285 states have (on average 1.3298245614035087) internal successors, (379), 314 states have internal predecessors, (379), 50 states have call successors, (50), 25 states have call predecessors, (50), 26 states have return successors, (68), 41 states have call predecessors, (68), 50 states have call successors, (68) [2024-11-14 03:38:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 497 transitions. [2024-11-14 03:38:27,597 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 497 transitions. Word has length 33 [2024-11-14 03:38:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:38:27,598 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 497 transitions. [2024-11-14 03:38:27,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 40 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:38:27,598 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 497 transitions. [2024-11-14 03:38:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 03:38:27,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:38:27,599 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:38:27,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-14 03:38:27,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-14 03:38:27,803 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:38:27,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:38:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash 59013645, now seen corresponding path program 1 times [2024-11-14 03:38:27,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:38:27,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987765796] [2024-11-14 03:38:27,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:38:27,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:38:27,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:38:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:38:28,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:38:28,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987765796] [2024-11-14 03:38:28,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987765796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:38:28,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660821262] [2024-11-14 03:38:28,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:38:28,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:38:28,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:38:28,329 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:38:28,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-14 03:38:28,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:38:28,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-14 03:38:28,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:38:28,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:38:28,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:38:28,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:38:28,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:38:28,815 INFO L349 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2024-11-14 03:38:28,815 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 55 treesize of output 54 [2024-11-14 03:38:28,839 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-14 03:38:28,840 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 28 [2024-11-14 03:38:28,876 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 17 treesize of output 13 [2024-11-14 03:38:28,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2024-11-14 03:38:30,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:30,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 65 [2024-11-14 03:38:30,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:30,291 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 2 case distinctions, treesize of input 58 treesize of output 42 [2024-11-14 03:38:30,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:38:30,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:38:32,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:32,364 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 96 treesize of output 100 [2024-11-14 03:38:41,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:41,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 98 [2024-11-14 03:38:41,538 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:38:41,545 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:41,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 72 [2024-11-14 03:38:41,608 INFO L349 Elim1Store]: treesize reduction 97, result has 28.1 percent of original size [2024-11-14 03:38:41,608 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 217 treesize of output 180 [2024-11-14 03:38:41,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:41,624 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 142 treesize of output 115 [2024-11-14 03:38:41,631 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:38:41,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 03:38:41,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:41,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 57 [2024-11-14 03:38:41,745 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-14 03:38:41,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 1 [2024-11-14 03:38:41,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:41,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 110 [2024-11-14 03:38:41,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:41,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 60 [2024-11-14 03:38:41,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:41,867 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 158 treesize of output 221 [2024-11-14 03:38:41,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:41,896 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 290 treesize of output 251 [2024-11-14 03:38:41,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 188 [2024-11-14 03:38:41,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:41,953 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 174 treesize of output 174 [2024-11-14 03:38:42,937 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:42,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 100 [2024-11-14 03:38:42,988 INFO L349 Elim1Store]: treesize reduction 17, result has 60.5 percent of original size [2024-11-14 03:38:42,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 376 treesize of output 327 [2024-11-14 03:38:43,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:43,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 265 treesize of output 195 [2024-11-14 03:38:43,041 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 224 treesize of output 180 [2024-11-14 03:38:43,133 INFO L349 Elim1Store]: treesize reduction 88, result has 20.7 percent of original size [2024-11-14 03:38:43,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 1454 treesize of output 1386 [2024-11-14 03:38:43,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:43,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 275 treesize of output 365 [2024-11-14 03:38:43,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-14 03:38:43,722 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:43,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 98 [2024-11-14 03:38:43,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:43,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 72 [2024-11-14 03:38:43,826 INFO L349 Elim1Store]: treesize reduction 52, result has 55.9 percent of original size [2024-11-14 03:38:43,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 181 treesize of output 186 [2024-11-14 03:38:43,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:43,852 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 233 treesize of output 206 [2024-11-14 03:38:43,867 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 126 treesize of output 106 [2024-11-14 03:38:43,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:43,904 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 123 treesize of output 123 [2024-11-14 03:38:44,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:44,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 88 [2024-11-14 03:38:44,167 INFO L349 Elim1Store]: treesize reduction 31, result has 27.9 percent of original size [2024-11-14 03:38:44,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 430 treesize of output 362 [2024-11-14 03:38:44,195 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:44,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 332 treesize of output 228 [2024-11-14 03:38:44,214 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 240 treesize of output 196 [2024-11-14 03:38:44,319 INFO L349 Elim1Store]: treesize reduction 74, result has 33.3 percent of original size [2024-11-14 03:38:44,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 977 treesize of output 935 [2024-11-14 03:38:44,551 INFO L349 Elim1Store]: treesize reduction 5, result has 95.9 percent of original size [2024-11-14 03:38:44,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 298 treesize of output 375 [2024-11-14 03:38:47,435 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 291 treesize of output 243 [2024-11-14 03:38:47,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 6 treesize of output 4 [2024-11-14 03:38:47,597 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-14 03:38:47,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 1 [2024-11-14 03:38:47,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:47,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 88 [2024-11-14 03:38:47,656 INFO L349 Elim1Store]: treesize reduction 34, result has 20.9 percent of original size [2024-11-14 03:38:47,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 430 treesize of output 358 [2024-11-14 03:38:47,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:47,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 328 treesize of output 224 [2024-11-14 03:38:47,702 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 224 treesize of output 184 [2024-11-14 03:38:47,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:38:47,800 INFO L349 Elim1Store]: treesize reduction 102, result has 8.1 percent of original size [2024-11-14 03:38:47,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 783 treesize of output 719 [2024-11-14 03:38:47,960 INFO L349 Elim1Store]: treesize reduction 108, result has 10.7 percent of original size [2024-11-14 03:38:47,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 188 treesize of output 166 [2024-11-14 03:38:48,008 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 199 treesize of output 187 [2024-11-14 03:38:48,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2024-11-14 03:38:48,188 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-14 03:38:48,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 1 [2024-11-14 03:38:48,203 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-14 03:38:48,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 144 treesize of output 1 [2024-11-14 03:38:48,218 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-14 03:38:48,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 1 [2024-11-14 03:38:48,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:48,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 88 [2024-11-14 03:38:48,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:38:48,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 86 [2024-11-14 03:38:48,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:38:48,267 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 42 treesize of output 38 [2024-11-14 03:38:48,338 INFO L349 Elim1Store]: treesize reduction 68, result has 30.6 percent of original size [2024-11-14 03:38:48,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 171 [2024-11-14 03:38:48,380 INFO L349 Elim1Store]: treesize reduction 16, result has 44.8 percent of original size [2024-11-14 03:38:48,380 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 108 [2024-11-14 03:38:48,392 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 81 treesize of output 57 [2024-11-14 03:38:49,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:38:49,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660821262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:38:49,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1064319214] [2024-11-14 03:38:49,457 INFO L159 IcfgInterpreter]: Started Sifa with 28 locations of interest [2024-11-14 03:38:49,458 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:38:49,458 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:38:49,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:38:49,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 17] total 41 [2024-11-14 03:38:49,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364627385] [2024-11-14 03:38:49,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:38:49,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-14 03:38:49,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:38:49,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-14 03:38:49,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1547, Unknown=8, NotChecked=0, Total=1722 [2024-11-14 03:38:49,461 INFO L87 Difference]: Start difference. First operand 381 states and 497 transitions. Second operand has 42 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 38 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:39:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:39:22,771 INFO L93 Difference]: Finished difference Result 516 states and 687 transitions. [2024-11-14 03:39:22,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-14 03:39:22,771 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 38 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 33 [2024-11-14 03:39:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:39:22,773 INFO L225 Difference]: With dead ends: 516 [2024-11-14 03:39:22,774 INFO L226 Difference]: Without dead ends: 516 [2024-11-14 03:39:22,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=405, Invalid=3127, Unknown=8, NotChecked=0, Total=3540 [2024-11-14 03:39:22,774 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 580 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:39:22,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1144 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 25.1s Time] [2024-11-14 03:39:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-14 03:39:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 421. [2024-11-14 03:39:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 314 states have (on average 1.3312101910828025) internal successors, (418), 346 states have internal predecessors, (418), 57 states have call successors, (57), 27 states have call predecessors, (57), 30 states have return successors, (85), 47 states have call predecessors, (85), 57 states have call successors, (85) [2024-11-14 03:39:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 560 transitions. [2024-11-14 03:39:22,787 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 560 transitions. Word has length 33 [2024-11-14 03:39:22,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:39:22,787 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 560 transitions. [2024-11-14 03:39:22,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 38 states have internal predecessors, (84), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:39:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 560 transitions. [2024-11-14 03:39:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-14 03:39:22,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:39:22,789 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:39:22,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-14 03:39:22,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-14 03:39:22,989 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:39:22,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:39:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash -888900074, now seen corresponding path program 1 times [2024-11-14 03:39:22,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:39:22,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629984953] [2024-11-14 03:39:22,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:22,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:39:23,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:39:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-14 03:39:23,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:39:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629984953] [2024-11-14 03:39:23,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629984953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:39:23,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952307467] [2024-11-14 03:39:23,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:23,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:39:23,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:39:23,244 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:39:23,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-14 03:39:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:39:23,430 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-14 03:39:23,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:39:23,670 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 9 treesize of output 3 [2024-11-14 03:39:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 03:39:23,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:39:23,748 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 5 [2024-11-14 03:39:23,826 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 10 treesize of output 4 [2024-11-14 03:39:23,956 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-14 03:39:23,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952307467] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-14 03:39:23,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:39:23,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 11] total 20 [2024-11-14 03:39:23,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506569647] [2024-11-14 03:39:23,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:39:23,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:39:23,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:39:23,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:39:23,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-11-14 03:39:23,958 INFO L87 Difference]: Start difference. First operand 421 states and 560 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:39:24,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:39:24,133 INFO L93 Difference]: Finished difference Result 419 states and 557 transitions. [2024-11-14 03:39:24,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:39:24,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2024-11-14 03:39:24,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:39:24,136 INFO L225 Difference]: With dead ends: 419 [2024-11-14 03:39:24,136 INFO L226 Difference]: Without dead ends: 419 [2024-11-14 03:39:24,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2024-11-14 03:39:24,137 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 109 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:39:24,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 244 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:39:24,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-11-14 03:39:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2024-11-14 03:39:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 314 states have (on average 1.321656050955414) internal successors, (415), 344 states have internal predecessors, (415), 57 states have call successors, (57), 27 states have call predecessors, (57), 30 states have return successors, (85), 47 states have call predecessors, (85), 57 states have call successors, (85) [2024-11-14 03:39:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 557 transitions. [2024-11-14 03:39:24,148 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 557 transitions. Word has length 35 [2024-11-14 03:39:24,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:39:24,149 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 557 transitions. [2024-11-14 03:39:24,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:39:24,149 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 557 transitions. [2024-11-14 03:39:24,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-14 03:39:24,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:39:24,150 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:39:24,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-14 03:39:24,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2024-11-14 03:39:24,350 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:39:24,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:39:24,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1421172253, now seen corresponding path program 1 times [2024-11-14 03:39:24,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:39:24,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525194096] [2024-11-14 03:39:24,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:24,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:39:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:39:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:39:24,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:39:24,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525194096] [2024-11-14 03:39:24,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525194096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:39:24,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:39:24,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 03:39:24,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847671227] [2024-11-14 03:39:24,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:39:24,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:39:24,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:39:24,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:39:24,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:39:24,432 INFO L87 Difference]: Start difference. First operand 419 states and 557 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:39:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:39:24,497 INFO L93 Difference]: Finished difference Result 441 states and 577 transitions. [2024-11-14 03:39:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:39:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2024-11-14 03:39:24,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:39:24,499 INFO L225 Difference]: With dead ends: 441 [2024-11-14 03:39:24,499 INFO L226 Difference]: Without dead ends: 441 [2024-11-14 03:39:24,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:39:24,500 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-14 03:39:24,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 386 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-14 03:39:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-14 03:39:24,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 418. [2024-11-14 03:39:24,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 314 states have (on average 1.3184713375796178) internal successors, (414), 344 states have internal predecessors, (414), 56 states have call successors, (56), 27 states have call predecessors, (56), 30 states have return successors, (84), 46 states have call predecessors, (84), 56 states have call successors, (84) [2024-11-14 03:39:24,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 554 transitions. [2024-11-14 03:39:24,512 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 554 transitions. Word has length 38 [2024-11-14 03:39:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:39:24,512 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 554 transitions. [2024-11-14 03:39:24,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-14 03:39:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 554 transitions. [2024-11-14 03:39:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-14 03:39:24,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:39:24,513 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:39:24,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-14 03:39:24,513 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:39:24,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:39:24,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1757174260, now seen corresponding path program 1 times [2024-11-14 03:39:24,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:39:24,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165963476] [2024-11-14 03:39:24,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:24,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:39:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:39:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:39:25,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:39:25,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165963476] [2024-11-14 03:39:25,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165963476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:39:25,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747442565] [2024-11-14 03:39:25,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:25,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:39:25,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:39:25,197 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:39:25,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-14 03:39:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:39:25,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-14 03:39:25,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:39:25,401 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 6 treesize of output 5 [2024-11-14 03:39:25,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:39:25,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:39:25,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2024-11-14 03:39:25,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:39:25,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:39:25,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:39:25,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-14 03:39:25,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 3 [2024-11-14 03:39:26,523 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2024-11-14 03:39:26,523 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 5 case distinctions, treesize of input 65 treesize of output 69 [2024-11-14 03:39:26,541 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 11 [2024-11-14 03:39:27,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:39:27,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 36 [2024-11-14 03:39:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:39:27,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:39:28,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747442565] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:39:28,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [556681359] [2024-11-14 03:39:28,014 INFO L159 IcfgInterpreter]: Started Sifa with 35 locations of interest [2024-11-14 03:39:28,014 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:39:28,015 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-14 03:39:28,015 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-14 03:39:28,015 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-14 03:39:29,090 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 72 for LOIs [2024-11-14 03:39:29,117 INFO L197 IcfgInterpreter]: Interpreting procedure is_list_containing_x with input of size 19 for LOIs [2024-11-14 03:39:29,130 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-14 03:39:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [556681359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:39:35,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-14 03:39:35,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [18, 14] total 58 [2024-11-14 03:39:35,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905963173] [2024-11-14 03:39:35,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:39:35,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-14 03:39:35,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:39:35,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-14 03:39:35,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=4071, Unknown=18, NotChecked=0, Total=4422 [2024-11-14 03:39:35,043 INFO L87 Difference]: Start difference. First operand 418 states and 554 transitions. Second operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:39:38,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:40,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:43,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:39:43,153 INFO L93 Difference]: Finished difference Result 416 states and 548 transitions. [2024-11-14 03:39:43,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-14 03:39:43,153 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2024-11-14 03:39:43,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:39:43,155 INFO L225 Difference]: With dead ends: 416 [2024-11-14 03:39:43,155 INFO L226 Difference]: Without dead ends: 416 [2024-11-14 03:39:43,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=383, Invalid=4711, Unknown=18, NotChecked=0, Total=5112 [2024-11-14 03:39:43,157 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 100 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 16 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:39:43,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 556 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1321 Invalid, 7 Unknown, 0 Unchecked, 7.1s Time] [2024-11-14 03:39:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-14 03:39:43,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2024-11-14 03:39:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 309 states have (on average 1.307443365695793) internal successors, (404), 337 states have internal predecessors, (404), 52 states have call successors, (52), 26 states have call predecessors, (52), 29 states have return successors, (80), 44 states have call predecessors, (80), 52 states have call successors, (80) [2024-11-14 03:39:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 536 transitions. [2024-11-14 03:39:43,165 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 536 transitions. Word has length 36 [2024-11-14 03:39:43,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:39:43,165 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 536 transitions. [2024-11-14 03:39:43,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-14 03:39:43,165 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 536 transitions. [2024-11-14 03:39:43,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 03:39:43,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:39:43,166 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:39:43,190 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2024-11-14 03:39:43,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2024-11-14 03:39:43,368 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:39:43,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:39:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash -849892544, now seen corresponding path program 2 times [2024-11-14 03:39:43,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:39:43,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60969233] [2024-11-14 03:39:43,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:43,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:39:43,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:39:43,925 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 03:39:43,925 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:39:43,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60969233] [2024-11-14 03:39:43,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60969233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:39:43,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1866270878] [2024-11-14 03:39:43,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:39:43,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:39:43,926 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:39:43,928 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:39:43,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-14 03:39:44,160 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:39:44,161 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:39:44,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-14 03:39:44,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:39:44,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-14 03:39:44,297 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 19 treesize of output 1 [2024-11-14 03:39:44,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:39:44,575 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 32 treesize of output 26 [2024-11-14 03:39:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 03:39:44,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:39:44,938 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 34 treesize of output 28 [2024-11-14 03:39:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 03:39:45,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1866270878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:39:45,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [59096057] [2024-11-14 03:39:45,109 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 03:39:45,109 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:39:45,109 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:39:45,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:39:45,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 25 [2024-11-14 03:39:45,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917080300] [2024-11-14 03:39:45,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:39:45,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-14 03:39:45,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:39:45,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-14 03:39:45,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2024-11-14 03:39:45,112 INFO L87 Difference]: Start difference. First operand 408 states and 536 transitions. Second operand has 26 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 03:39:47,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:49,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:52,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:54,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:56,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:58,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 03:39:59,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:39:59,571 INFO L93 Difference]: Finished difference Result 446 states and 587 transitions. [2024-11-14 03:39:59,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-14 03:39:59,571 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 39 [2024-11-14 03:39:59,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:39:59,574 INFO L225 Difference]: With dead ends: 446 [2024-11-14 03:39:59,574 INFO L226 Difference]: Without dead ends: 446 [2024-11-14 03:39:59,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=348, Invalid=2304, Unknown=0, NotChecked=0, Total=2652 [2024-11-14 03:39:59,575 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 376 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 100 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-14 03:39:59,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 793 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1335 Invalid, 6 Unknown, 0 Unchecked, 13.6s Time] [2024-11-14 03:39:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-14 03:39:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 407. [2024-11-14 03:39:59,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 309 states have (on average 1.3042071197411003) internal successors, (403), 336 states have internal predecessors, (403), 52 states have call successors, (52), 26 states have call predecessors, (52), 29 states have return successors, (80), 44 states have call predecessors, (80), 52 states have call successors, (80) [2024-11-14 03:39:59,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 535 transitions. [2024-11-14 03:39:59,588 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 535 transitions. Word has length 39 [2024-11-14 03:39:59,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:39:59,588 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 535 transitions. [2024-11-14 03:39:59,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.9130434782608696) internal successors, (67), 24 states have internal predecessors, (67), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-14 03:39:59,588 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 535 transitions. [2024-11-14 03:39:59,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 03:39:59,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:39:59,589 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:39:59,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-14 03:39:59,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:39:59,794 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:39:59,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:39:59,794 INFO L85 PathProgramCache]: Analyzing trace with hash -849892543, now seen corresponding path program 2 times [2024-11-14 03:39:59,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:39:59,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891772722] [2024-11-14 03:39:59,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:39:59,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:39:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:40:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:40:00,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:40:00,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891772722] [2024-11-14 03:40:00,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891772722] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:40:00,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957607467] [2024-11-14 03:40:00,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:40:00,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:40:00,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:40:00,763 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:40:00,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-14 03:40:00,991 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:40:00,992 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:40:00,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-14 03:40:00,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:40:01,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-14 03:40:01,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-14 03:40:01,169 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 19 treesize of output 1 [2024-11-14 03:40:01,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:40:01,628 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 32 treesize of output 26 [2024-11-14 03:40:01,646 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-14 03:40:01,647 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 19 treesize of output 7 [2024-11-14 03:40:01,736 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-14 03:40:01,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:40:02,540 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 34 treesize of output 28 [2024-11-14 03:40:02,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:40:02,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:40:02,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:40:02,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 03:40:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-14 03:40:02,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957607467] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:40:02,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [66775300] [2024-11-14 03:40:02,694 INFO L159 IcfgInterpreter]: Started Sifa with 22 locations of interest [2024-11-14 03:40:02,694 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:40:02,695 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:40:02,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:40:02,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 33 [2024-11-14 03:40:02,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498590745] [2024-11-14 03:40:02,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:40:02,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-14 03:40:02,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:40:02,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-14 03:40:02,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1012, Unknown=0, NotChecked=0, Total=1122 [2024-11-14 03:40:02,697 INFO L87 Difference]: Start difference. First operand 407 states and 535 transitions. Second operand has 34 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:40:07,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:40:07,052 INFO L93 Difference]: Finished difference Result 475 states and 613 transitions. [2024-11-14 03:40:07,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-14 03:40:07,053 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2024-11-14 03:40:07,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:40:07,054 INFO L225 Difference]: With dead ends: 475 [2024-11-14 03:40:07,054 INFO L226 Difference]: Without dead ends: 475 [2024-11-14 03:40:07,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=505, Invalid=3785, Unknown=0, NotChecked=0, Total=4290 [2024-11-14 03:40:07,055 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 772 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 1926 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 2130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:40:07,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 857 Invalid, 2130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1926 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-14 03:40:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-14 03:40:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 406. [2024-11-14 03:40:07,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 309 states have (on average 1.3009708737864079) internal successors, (402), 335 states have internal predecessors, (402), 52 states have call successors, (52), 26 states have call predecessors, (52), 29 states have return successors, (80), 44 states have call predecessors, (80), 52 states have call successors, (80) [2024-11-14 03:40:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 534 transitions. [2024-11-14 03:40:07,066 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 534 transitions. Word has length 39 [2024-11-14 03:40:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:40:07,067 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 534 transitions. [2024-11-14 03:40:07,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 30 states have internal predecessors, (80), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:40:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 534 transitions. [2024-11-14 03:40:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-14 03:40:07,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:40:07,068 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:40:07,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-14 03:40:07,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:40:07,269 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:40:07,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:40:07,269 INFO L85 PathProgramCache]: Analyzing trace with hash 465181623, now seen corresponding path program 2 times [2024-11-14 03:40:07,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:40:07,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239951337] [2024-11-14 03:40:07,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:40:07,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:40:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:40:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:40:08,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:40:08,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239951337] [2024-11-14 03:40:08,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239951337] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:40:08,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645252141] [2024-11-14 03:40:08,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:40:08,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:40:08,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:40:08,821 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:40:08,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-14 03:40:09,061 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:40:09,061 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:40:09,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-14 03:40:09,066 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:40:09,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:40:09,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:40:09,284 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-14 03:40:09,284 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 27 treesize of output 23 [2024-11-14 03:40:09,302 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-14 03:40:09,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 23 treesize of output 22 [2024-11-14 03:40:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-14 03:40:10,561 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:40:28,152 INFO L349 Elim1Store]: treesize reduction 49, result has 71.2 percent of original size [2024-11-14 03:40:28,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 3005 treesize of output 2787 [2024-11-14 03:40:29,738 INFO L349 Elim1Store]: treesize reduction 263, result has 42.8 percent of original size [2024-11-14 03:40:29,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 7741 treesize of output 6933 [2024-11-14 03:40:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-14 03:40:47,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645252141] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:40:47,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732833222] [2024-11-14 03:40:47,015 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-14 03:40:47,015 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:40:47,015 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:40:47,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:40:47,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 14] total 44 [2024-11-14 03:40:47,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607518438] [2024-11-14 03:40:47,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:40:47,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-14 03:40:47,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:40:47,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-14 03:40:47,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1720, Unknown=7, NotChecked=0, Total=1892 [2024-11-14 03:40:47,017 INFO L87 Difference]: Start difference. First operand 406 states and 534 transitions. Second operand has 44 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:40:50,536 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_is_list_containing_x_#in~x.base| c_is_list_containing_x_~x.base)) (.cse1 (= |c_is_list_containing_x_#in~l.base| c_is_list_containing_x_~l.base)) (.cse11 (= |c_is_list_containing_x_#in~x.base| |c_is_list_containing_x_#in~l.base|))) (and .cse0 (or (not (= c_is_list_containing_x_~l.offset 0)) (and .cse0 .cse1 (= |c_is_list_containing_x_#in~x.offset| c_is_list_containing_x_~x.offset))) (or (let ((.cse5 (+ |c_is_list_containing_x_#in~l.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| |c_is_list_containing_x_#in~l.base|) .cse5)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_is_list_containing_x_#in~l.base|) .cse5))) (and (let ((.cse3 (+ .cse4 4))) (or (not (= (select (select |c_#memory_$Pointer$.offset| .cse2) .cse3) 0)) (not (= (select (select |c_#memory_$Pointer$.base| .cse2) .cse3) 0)))) (or (not (= .cse4 |c_is_list_containing_x_#in~l.offset|)) (not (= |c_is_list_containing_x_#in~l.base| .cse2)))))) (let ((.cse6 (+ |c_is_list_containing_x_#in~x.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_is_list_containing_x_#in~x.base|) .cse6) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_is_list_containing_x_#in~x.base|) .cse6))))) (or (not (= c_is_list_containing_x_~l.offset c_is_list_containing_x_~x.offset)) (not (= c_is_list_containing_x_~l.base c_is_list_containing_x_~x.base)) (and (forall ((|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14| Int) (|v_is_list_containing_x_#in~l.base_BEFORE_CALL_16| Int)) (let ((.cse7 (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14| 4))) (or (not (= (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|) .cse7) |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|) .cse7) |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14|))))) (forall ((|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14| Int) (|v_is_list_containing_x_#in~l.base_BEFORE_CALL_16| Int)) (let ((.cse10 (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14| 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|) .cse10)) (.cse9 (+ (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|) .cse10) 4))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) 0)) (not (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) 0))))))) (and (forall ((|v_is_list_containing_x_#in~x.offset_BEFORE_CALL_13| Int) (|v_is_list_containing_x_#in~x.base_BEFORE_CALL_16| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~x.base_BEFORE_CALL_16|) (+ |v_is_list_containing_x_#in~x.offset_BEFORE_CALL_13| 4)) 0)) (forall ((|v_is_list_containing_x_#in~x.offset_BEFORE_CALL_13| Int) (|v_is_list_containing_x_#in~x.base_BEFORE_CALL_16| Int)) (= (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~x.base_BEFORE_CALL_16|) (+ |v_is_list_containing_x_#in~x.offset_BEFORE_CALL_13| 4)) 0))) (and (= |c_is_list_containing_x_#in~l.offset| |c_is_list_containing_x_#in~x.offset|) .cse11)) .cse1 (= c_is_list_containing_x_~l.offset |c_is_list_containing_x_#in~l.offset|) .cse11)) is different from false [2024-11-14 03:41:24,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:41:27,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:29,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:41:32,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:41:34,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:36,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:39,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:41,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:41:43,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:46,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:48,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:50,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:53,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:41:55,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:41:57,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:00,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:02,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:05,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:07,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:10,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:12,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:42,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_is_list_containing_x_#in~x.base| c_is_list_containing_x_~x.base)) (.cse3 (= c_is_list_containing_x_~l.base c_is_list_containing_x_~x.base)) (.cse2 (= c_is_list_containing_x_~l.offset c_is_list_containing_x_~x.offset)) (.cse1 (= |c_is_list_containing_x_#in~l.base| c_is_list_containing_x_~l.base))) (and .cse0 (or (not (= c_is_list_containing_x_~l.offset 0)) (and .cse0 .cse1 (= |c_is_list_containing_x_#in~x.offset| c_is_list_containing_x_~x.offset))) (or (not .cse2) (not .cse3) (and (forall ((|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14| Int) (|v_is_list_containing_x_#in~l.base_BEFORE_CALL_16| Int)) (let ((.cse4 (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14| 4))) (or (not (= (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|) .cse4) |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|) .cse4) |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14|))))) (forall ((|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14| Int) (|v_is_list_containing_x_#in~l.base_BEFORE_CALL_16| Int)) (let ((.cse7 (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|) .cse7)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|) .cse7) 4))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) 0)) (not (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 0))))))) (and (forall ((|v_is_list_containing_x_#in~x.offset_BEFORE_CALL_13| Int) (|v_is_list_containing_x_#in~x.base_BEFORE_CALL_16| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~x.base_BEFORE_CALL_16|) (+ |v_is_list_containing_x_#in~x.offset_BEFORE_CALL_13| 4)) 0)) (forall ((|v_is_list_containing_x_#in~x.offset_BEFORE_CALL_13| Int) (|v_is_list_containing_x_#in~x.base_BEFORE_CALL_16| Int)) (= (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~x.base_BEFORE_CALL_16|) (+ |v_is_list_containing_x_#in~x.offset_BEFORE_CALL_13| 4)) 0))) (and (= |c_is_list_containing_x_#in~l.offset| |c_is_list_containing_x_#in~x.offset|) (= |c_is_list_containing_x_#in~x.base| |c_is_list_containing_x_#in~l.base|))) (let ((.cse12 (+ c_is_list_containing_x_~l.offset 4))) (or (let ((.cse11 (+ |c_is_list_containing_x_#in~l.offset| 4))) (let ((.cse10 (select (select |c_#memory_$Pointer$.offset| |c_is_list_containing_x_#in~l.base|) .cse11)) (.cse8 (select (select |c_#memory_$Pointer$.base| |c_is_list_containing_x_#in~l.base|) .cse11))) (and (let ((.cse9 (+ .cse10 4))) (or (not (= (select (select |c_#memory_$Pointer$.offset| .cse8) .cse9) 0)) (not (= (select (select |c_#memory_$Pointer$.base| .cse8) .cse9) 0)))) (or (not (= .cse10 |c_is_list_containing_x_#in~l.offset|)) (not (= |c_is_list_containing_x_#in~l.base| .cse8)))))) (not (= (select (select |c_#memory_$Pointer$.offset| c_is_list_containing_x_~l.base) .cse12) c_is_list_containing_x_~x.offset)) (and .cse3 .cse2) (not (= (select (select |c_#memory_$Pointer$.base| c_is_list_containing_x_~l.base) .cse12) c_is_list_containing_x_~x.base)) (let ((.cse13 (+ |c_is_list_containing_x_#in~x.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_is_list_containing_x_#in~x.base|) .cse13) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_is_list_containing_x_#in~x.base|) .cse13)))))) .cse1 (= c_is_list_containing_x_~l.offset |c_is_list_containing_x_#in~l.offset|))) is different from false [2024-11-14 03:42:47,125 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_is_list_containing_x_#in~x.base| c_is_list_containing_x_~x.base)) (.cse3 (= c_is_list_containing_x_~l.base c_is_list_containing_x_~x.base)) (.cse2 (= c_is_list_containing_x_~l.offset c_is_list_containing_x_~x.offset)) (.cse1 (= |c_is_list_containing_x_#in~l.base| c_is_list_containing_x_~l.base)) (.cse8 (= |c_is_list_containing_x_#in~x.base| |c_is_list_containing_x_#in~l.base|))) (and .cse0 (or (not (= c_is_list_containing_x_~l.offset 0)) (and .cse0 .cse1 (= |c_is_list_containing_x_#in~x.offset| c_is_list_containing_x_~x.offset))) (or (not .cse2) (not .cse3) (and (forall ((|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14| Int) (|v_is_list_containing_x_#in~l.base_BEFORE_CALL_16| Int)) (let ((.cse4 (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14| 4))) (or (not (= (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|) .cse4) |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|) .cse4) |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14|))))) (forall ((|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14| Int) (|v_is_list_containing_x_#in~l.base_BEFORE_CALL_16| Int)) (let ((.cse7 (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_14| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|) .cse7)) (.cse6 (+ (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_16|) .cse7) 4))) (or (not (= (select (select |c_#memory_$Pointer$.base| .cse5) .cse6) 0)) (not (= (select (select |c_#memory_$Pointer$.offset| .cse5) .cse6) 0))))))) (and (forall ((|v_is_list_containing_x_#in~x.offset_BEFORE_CALL_13| Int) (|v_is_list_containing_x_#in~x.base_BEFORE_CALL_16| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~x.base_BEFORE_CALL_16|) (+ |v_is_list_containing_x_#in~x.offset_BEFORE_CALL_13| 4)) 0)) (forall ((|v_is_list_containing_x_#in~x.offset_BEFORE_CALL_13| Int) (|v_is_list_containing_x_#in~x.base_BEFORE_CALL_16| Int)) (= (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~x.base_BEFORE_CALL_16|) (+ |v_is_list_containing_x_#in~x.offset_BEFORE_CALL_13| 4)) 0))) (and (= |c_is_list_containing_x_#in~l.offset| |c_is_list_containing_x_#in~x.offset|) .cse8)) (let ((.cse13 (+ c_is_list_containing_x_~l.offset 4))) (or (let ((.cse12 (+ |c_is_list_containing_x_#in~l.offset| 4))) (let ((.cse11 (select (select |c_#memory_$Pointer$.offset| |c_is_list_containing_x_#in~l.base|) .cse12)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_is_list_containing_x_#in~l.base|) .cse12))) (and (let ((.cse10 (+ .cse11 4))) (or (not (= (select (select |c_#memory_$Pointer$.offset| .cse9) .cse10) 0)) (not (= (select (select |c_#memory_$Pointer$.base| .cse9) .cse10) 0)))) (or (not (= .cse11 |c_is_list_containing_x_#in~l.offset|)) (not (= |c_is_list_containing_x_#in~l.base| .cse9)))))) (not (= (select (select |c_#memory_$Pointer$.offset| c_is_list_containing_x_~l.base) .cse13) c_is_list_containing_x_~x.offset)) (and .cse3 .cse2) (not (= (select (select |c_#memory_$Pointer$.base| c_is_list_containing_x_~l.base) .cse13) c_is_list_containing_x_~x.base)) (let ((.cse14 (+ |c_is_list_containing_x_#in~x.offset| 4))) (and (= (select (select |c_#memory_$Pointer$.base| |c_is_list_containing_x_#in~x.base|) .cse14) 0) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_is_list_containing_x_#in~x.base|) .cse14)))))) .cse1 (= c_is_list_containing_x_~l.offset |c_is_list_containing_x_#in~l.offset|) .cse8)) is different from false [2024-11-14 03:42:51,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:53,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:42:55,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:42:57,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:00,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:04,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:06,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:08,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:10,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:13,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:43:15,017 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:17,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:19,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:21,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:23,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:25,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:28,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:43:30,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:32,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:34,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:36,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:38,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:41,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:43,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:45,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:43:50,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:43:53,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:43:55,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:44:04,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:44:06,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:44:09,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:44:12,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:44:14,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:44:16,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-14 03:44:19,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:44:21,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:44:23,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:44:26,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:44:28,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:44:30,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:44:32,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:44:35,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-14 03:44:42,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:42,287 INFO L93 Difference]: Finished difference Result 626 states and 796 transitions. [2024-11-14 03:44:42,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-14 03:44:42,287 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2024-11-14 03:44:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:42,290 INFO L225 Difference]: With dead ends: 626 [2024-11-14 03:44:42,290 INFO L226 Difference]: Without dead ends: 626 [2024-11-14 03:44:42,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1898 ImplicationChecksByTransitivity, 79.4s TimeCoverageRelationStatistics Valid=685, Invalid=5945, Unknown=24, NotChecked=486, Total=7140 [2024-11-14 03:44:42,292 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 726 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 2842 mSolverCounterSat, 231 mSolverCounterUnsat, 63 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 158.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 3300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 2842 IncrementalHoareTripleChecker+Invalid, 63 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 173.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:42,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 1963 Invalid, 3300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 2842 Invalid, 63 Unknown, 164 Unchecked, 173.5s Time] [2024-11-14 03:44:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2024-11-14 03:44:42,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 451. [2024-11-14 03:44:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 343 states have (on average 1.3002915451895043) internal successors, (446), 371 states have internal predecessors, (446), 59 states have call successors, (59), 28 states have call predecessors, (59), 33 states have return successors, (99), 51 states have call predecessors, (99), 59 states have call successors, (99) [2024-11-14 03:44:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 604 transitions. [2024-11-14 03:44:42,307 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 604 transitions. Word has length 37 [2024-11-14 03:44:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:42,308 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 604 transitions. [2024-11-14 03:44:42,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-14 03:44:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 604 transitions. [2024-11-14 03:44:42,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-14 03:44:42,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:42,311 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:44:42,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-14 03:44:42,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:44:42,513 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:44:42,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:42,513 INFO L85 PathProgramCache]: Analyzing trace with hash -70352971, now seen corresponding path program 1 times [2024-11-14 03:44:42,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:42,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571210138] [2024-11-14 03:44:42,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:42,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-14 03:44:42,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:42,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571210138] [2024-11-14 03:44:42,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571210138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:44:42,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:44:42,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:44:42,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366668372] [2024-11-14 03:44:42,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:44:42,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:44:42,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:42,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:44:42,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:44:42,833 INFO L87 Difference]: Start difference. First operand 451 states and 604 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-14 03:44:44,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:44,247 INFO L93 Difference]: Finished difference Result 454 states and 607 transitions. [2024-11-14 03:44:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:44:44,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2024-11-14 03:44:44,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:44,250 INFO L225 Difference]: With dead ends: 454 [2024-11-14 03:44:44,250 INFO L226 Difference]: Without dead ends: 427 [2024-11-14 03:44:44,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:44:44,251 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:44,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-14 03:44:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-11-14 03:44:44,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2024-11-14 03:44:44,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 324 states have (on average 1.3148148148148149) internal successors, (426), 351 states have internal predecessors, (426), 56 states have call successors, (56), 26 states have call predecessors, (56), 31 states have return successors, (96), 49 states have call predecessors, (96), 56 states have call successors, (96) [2024-11-14 03:44:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 578 transitions. [2024-11-14 03:44:44,265 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 578 transitions. Word has length 40 [2024-11-14 03:44:44,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:44,265 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 578 transitions. [2024-11-14 03:44:44,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-14 03:44:44,266 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 578 transitions. [2024-11-14 03:44:44,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 03:44:44,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:44,267 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:44:44,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-14 03:44:44,267 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:44:44,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:44,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1981514439, now seen corresponding path program 1 times [2024-11-14 03:44:44,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:44,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53900443] [2024-11-14 03:44:44,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:44,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:44:45,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53900443] [2024-11-14 03:44:45,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53900443] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:44:45,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509947826] [2024-11-14 03:44:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:45,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:44:45,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:44:45,019 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:44:45,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-14 03:44:45,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:45,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-14 03:44:45,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:44:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:44:46,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:44:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-14 03:44:47,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509947826] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-14 03:44:47,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [187911619] [2024-11-14 03:44:47,924 INFO L159 IcfgInterpreter]: Started Sifa with 34 locations of interest [2024-11-14 03:44:47,924 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 03:44:47,924 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-14 03:44:47,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-14 03:44:47,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2024-11-14 03:44:47,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675829666] [2024-11-14 03:44:47,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-14 03:44:47,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 03:44:47,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:44:47,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 03:44:47,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:44:47,925 INFO L87 Difference]: Start difference. First operand 427 states and 578 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:44:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:44:49,693 INFO L93 Difference]: Finished difference Result 342 states and 433 transitions. [2024-11-14 03:44:49,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:44:49,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2024-11-14 03:44:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:44:49,695 INFO L225 Difference]: With dead ends: 342 [2024-11-14 03:44:49,695 INFO L226 Difference]: Without dead ends: 342 [2024-11-14 03:44:49,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:44:49,696 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 44 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:44:49,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 491 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-14 03:44:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-14 03:44:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 279. [2024-11-14 03:44:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 210 states have (on average 1.2666666666666666) internal successors, (266), 232 states have internal predecessors, (266), 31 states have call successors, (31), 16 states have call predecessors, (31), 22 states have return successors, (52), 30 states have call predecessors, (52), 31 states have call successors, (52) [2024-11-14 03:44:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 349 transitions. [2024-11-14 03:44:49,706 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 349 transitions. Word has length 39 [2024-11-14 03:44:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:44:49,706 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 349 transitions. [2024-11-14 03:44:49,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-14 03:44:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 349 transitions. [2024-11-14 03:44:49,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-14 03:44:49,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:44:49,707 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:44:49,734 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-11-14 03:44:49,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2024-11-14 03:44:49,912 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-14 03:44:49,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:44:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash 689374041, now seen corresponding path program 2 times [2024-11-14 03:44:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:44:49,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701777885] [2024-11-14 03:44:49,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:44:49,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:44:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:44:54,558 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-14 03:44:54,558 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:44:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701777885] [2024-11-14 03:44:54,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701777885] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 03:44:54,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019095801] [2024-11-14 03:44:54,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-14 03:44:54,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 03:44:54,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:44:54,561 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 03:44:54,562 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1fdae8a9-55b4-47d7-9192-139301903d98/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-14 03:44:54,820 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-14 03:44:54,820 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-14 03:44:54,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-14 03:44:54,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:44:56,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:44:56,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-14 03:44:56,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-14 03:44:57,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-14 03:45:03,600 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 03:45:03,600 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 15 treesize of output 7 [2024-11-14 03:45:05,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 03:45:05,746 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 36 [2024-11-14 03:45:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-14 03:45:05,987 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 03:45:07,916 INFO L349 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2024-11-14 03:45:07,916 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 28 treesize of output 27 [2024-11-14 03:45:12,552 WARN L851 $PredicateComparison]: unable to prove that (or (and (forall ((|v_is_list_containing_x_#in~l.base_BEFORE_CALL_20| Int) (|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_18| Int)) (let ((.cse0 (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_18| 4))) (or (not (= (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_20|) .cse0) |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_18|)) (not (= (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_20|) .cse0) |v_is_list_containing_x_#in~l.base_BEFORE_CALL_20|))))) (forall ((|v_is_list_containing_x_#in~l.base_BEFORE_CALL_20| Int) (|v_is_list_containing_x_#in~l.offset_BEFORE_CALL_18| Int)) (not (= (let ((.cse1 (+ |v_is_list_containing_x_#in~l.offset_BEFORE_CALL_18| 4))) (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_20|) .cse1)) (select (select |c_#memory_$Pointer$.offset| |v_is_list_containing_x_#in~l.base_BEFORE_CALL_20|) .cse1))) |v_is_list_containing_x_#in~l.base_BEFORE_CALL_20|)))) (forall ((|v_is_list_containing_x_#in~x.base_BEFORE_CALL_20| Int) (|v_is_list_containing_x_#in~x.offset_BEFORE_CALL_17| Int)) (= 1 (select |c_#valid| (select (select |c_#memory_$Pointer$.base| |v_is_list_containing_x_#in~x.base_BEFORE_CALL_20|) |v_is_list_containing_x_#in~x.offset_BEFORE_CALL_17|)))) (and (= |c_is_list_containing_x_#in~l.offset| |c_is_list_containing_x_#in~x.offset|) (= |c_is_list_containing_x_#in~x.base| |c_is_list_containing_x_#in~l.base|))) is different from false [2024-11-14 03:45:14,651 INFO L349 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2024-11-14 03:45:14,652 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 15 [2024-11-14 03:45:16,293 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 140 treesize of output 128