./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_nla-digbench/recursified_divbin2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_nla-digbench/recursified_divbin2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 07d2bb25a1c8c4ef92611e8b25e211f661495bf054d1380ec62ffea892b45c2f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:34:20,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:34:20,115 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Default.epf [2024-11-09 05:34:20,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:34:20,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:34:20,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:34:20,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:34:20,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:34:20,156 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:34:20,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:34:20,157 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:34:20,158 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:34:20,158 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:34:20,159 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:34:20,159 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:34:20,160 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:34:20,161 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:34:20,161 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:34:20,162 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:34:20,162 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:34:20,163 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:34:20,164 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:34:20,165 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:34:20,165 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:34:20,166 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:34:20,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:34:20,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:34:20,168 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:34:20,168 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:34:20,169 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:34:20,169 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:34:20,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:34:20,170 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:34:20,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:34:20,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:34:20,172 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:34:20,172 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:34:20,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:34:20,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:34:20,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:34:20,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:34:20,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:34:20,179 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:34:20,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:34:20,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:34:20,180 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:34:20,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:34:20,181 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 07d2bb25a1c8c4ef92611e8b25e211f661495bf054d1380ec62ffea892b45c2f [2024-11-09 05:34:20,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:34:20,579 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:34:20,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:34:20,585 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:34:20,586 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:34:20,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/recursified_nla-digbench/recursified_divbin2.i Unable to find full path for "g++" [2024-11-09 05:34:22,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:34:23,281 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:34:23,282 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/sv-benchmarks/c/recursified_nla-digbench/recursified_divbin2.i [2024-11-09 05:34:23,291 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/data/86c857bf8/67d19151364f42ada9e4ba4373060d8e/FLAG285cee1e8 [2024-11-09 05:34:23,558 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/data/86c857bf8/67d19151364f42ada9e4ba4373060d8e [2024-11-09 05:34:23,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:34:23,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:34:23,564 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:34:23,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:34:23,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:34:23,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6547a046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23, skipping insertion in model container [2024-11-09 05:34:23,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:34:23,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/sv-benchmarks/c/recursified_nla-digbench/recursified_divbin2.i[1567,1580] [2024-11-09 05:34:23,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:34:23,853 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:34:23,870 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/sv-benchmarks/c/recursified_nla-digbench/recursified_divbin2.i[1567,1580] [2024-11-09 05:34:23,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:34:23,904 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:34:23,904 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23 WrapperNode [2024-11-09 05:34:23,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:34:23,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:34:23,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:34:23,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:34:23,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,947 INFO L138 Inliner]: procedures = 19, calls = 59, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2024-11-09 05:34:23,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:34:23,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:34:23,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:34:23,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:34:23,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,970 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:34:23,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:34:23,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:34:23,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:34:23,981 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23" (1/1) ... [2024-11-09 05:34:23,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:34:24,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:34:24,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:34:24,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:34:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:34:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_33_to_35_0 [2024-11-09 05:34:24,071 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_33_to_35_0 [2024-11-09 05:34:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:34:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:34:24,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:34:24,072 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_37_to_44_0 [2024-11-09 05:34:24,072 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_37_to_44_0 [2024-11-09 05:34:24,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:34:24,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:34:24,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:34:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 05:34:24,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 05:34:24,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:34:24,172 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:34:24,175 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:34:24,439 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 05:34:24,439 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:34:24,530 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:34:24,531 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 05:34:24,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:34:24 BoogieIcfgContainer [2024-11-09 05:34:24,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:34:24,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:34:24,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:34:24,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:34:24,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:34:23" (1/3) ... [2024-11-09 05:34:24,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5834d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:34:24, skipping insertion in model container [2024-11-09 05:34:24,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:34:23" (2/3) ... [2024-11-09 05:34:24,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5834d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:34:24, skipping insertion in model container [2024-11-09 05:34:24,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:34:24" (3/3) ... [2024-11-09 05:34:24,582 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_divbin2.i [2024-11-09 05:34:24,629 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:34:24,629 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:34:24,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:34:24,744 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=LoopHeads, 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;@71ea33a9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:34:24,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:34:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:34:24,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 05:34:24,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:24,762 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:34:24,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:34:24,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:24,770 INFO L85 PathProgramCache]: Analyzing trace with hash -949832028, now seen corresponding path program 1 times [2024-11-09 05:34:24,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:34:24,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158773806] [2024-11-09 05:34:24,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:24,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:34:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:34:25,121 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:34:25,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158773806] [2024-11-09 05:34:25,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158773806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:34:25,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:34:25,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:34:25,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166252142] [2024-11-09 05:34:25,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:34:25,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 05:34:25,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:34:25,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 05:34:25,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 05:34:25,179 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.375) internal successors, (22), 19 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:34:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:25,260 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2024-11-09 05:34:25,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 05:34:25,264 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-09 05:34:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:25,276 INFO L225 Difference]: With dead ends: 48 [2024-11-09 05:34:25,276 INFO L226 Difference]: Without dead ends: 25 [2024-11-09 05:34:25,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 05:34:25,289 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:25,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:34:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-09 05:34:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-09 05:34:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2) internal successors, (18), 18 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 05:34:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-09 05:34:25,343 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 13 [2024-11-09 05:34:25,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:25,343 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-09 05:34:25,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:34:25,344 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-09 05:34:25,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:34:25,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:25,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:34:25,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 05:34:25,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:34:25,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:25,348 INFO L85 PathProgramCache]: Analyzing trace with hash -531894563, now seen corresponding path program 1 times [2024-11-09 05:34:25,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:34:25,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818252984] [2024-11-09 05:34:25,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:25,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:34:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:34:25,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142287369] [2024-11-09 05:34:25,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:25,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:34:25,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:34:25,556 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:34:25,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:34:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:25,934 WARN L253 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-09 05:34:25,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:26,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2024-11-09 05:34:26,222 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 7 [2024-11-09 05:34:26,237 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 12 treesize of output 11 [2024-11-09 05:34:26,268 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 7 [2024-11-09 05:34:26,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:26,364 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-09 05:34:26,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 49 [2024-11-09 05:34:26,417 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 7 [2024-11-09 05:34:27,720 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:34:27,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 28 [2024-11-09 05:34:27,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:34:27,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:34:27,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:34:27,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818252984] [2024-11-09 05:34:27,850 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:34:27,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142287369] [2024-11-09 05:34:27,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2142287369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:34:27,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:34:27,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 05:34:27,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259620982] [2024-11-09 05:34:27,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:34:27,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:34:27,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:34:27,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:34:27,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:34:27,855 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 13 states, 10 states have (on average 1.0) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:34:29,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:29,550 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2024-11-09 05:34:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:34:29,551 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.0) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-09 05:34:29,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:29,555 INFO L225 Difference]: With dead ends: 44 [2024-11-09 05:34:29,555 INFO L226 Difference]: Without dead ends: 42 [2024-11-09 05:34:29,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-11-09 05:34:29,558 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:29,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 79 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 05:34:29,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-09 05:34:29,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-09 05:34:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.16) internal successors, (29), 28 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-09 05:34:29,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-09 05:34:29,581 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 14 [2024-11-09 05:34:29,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:29,581 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-09 05:34:29,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.0) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:34:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-09 05:34:29,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:34:29,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:29,584 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:34:29,612 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 05:34:29,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:34:29,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:34:29,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:29,785 INFO L85 PathProgramCache]: Analyzing trace with hash 2009014500, now seen corresponding path program 1 times [2024-11-09 05:34:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:34:29,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760823660] [2024-11-09 05:34:29,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:29,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:34:29,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:34:29,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058018529] [2024-11-09 05:34:29,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:29,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:34:29,880 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:34:29,886 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:34:29,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:34:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:30,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-09 05:34:30,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:30,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:30,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:30,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:30,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:30,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:30,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:30,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:30,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:30,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 37 [2024-11-09 05:34:30,306 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-09 05:34:30,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 53 [2024-11-09 05:34:30,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2024-11-09 05:34:30,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 38 [2024-11-09 05:34:31,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 21 [2024-11-09 05:34:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 05:34:31,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:34:33,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:34:33,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760823660] [2024-11-09 05:34:33,299 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:34:33,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058018529] [2024-11-09 05:34:33,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058018529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:34:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [241975837] [2024-11-09 05:34:33,325 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:34:33,325 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:34:33,330 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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) 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-09 05:34:33,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:34:33,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-11-09 05:34:33,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491828144] [2024-11-09 05:34:33,334 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 05:34:33,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 05:34:33,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:34:33,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 05:34:33,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=440, Unknown=7, NotChecked=0, Total=506 [2024-11-09 05:34:33,336 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:34:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:35,119 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2024-11-09 05:34:35,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 05:34:35,120 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-09 05:34:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:35,124 INFO L225 Difference]: With dead ends: 58 [2024-11-09 05:34:35,124 INFO L226 Difference]: Without dead ends: 56 [2024-11-09 05:34:35,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=122, Invalid=863, Unknown=7, NotChecked=0, Total=992 [2024-11-09 05:34:35,131 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 35 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:35,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 78 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 05:34:35,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-09 05:34:35,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2024-11-09 05:34:35,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 8 states have call successors, (8), 5 states have call predecessors, (8), 8 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2024-11-09 05:34:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-11-09 05:34:35,161 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 20 [2024-11-09 05:34:35,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:35,162 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-11-09 05:34:35,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:34:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-11-09 05:34:35,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 05:34:35,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:35,165 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:34:35,194 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:34:35,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:34:35,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:34:35,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:35,367 INFO L85 PathProgramCache]: Analyzing trace with hash 2094270123, now seen corresponding path program 2 times [2024-11-09 05:34:35,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:34:35,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154853455] [2024-11-09 05:34:35,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:34:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:34:35,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048627587] [2024-11-09 05:34:35,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:34:35,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:34:35,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:34:35,453 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:34:35,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:34:36,001 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 05:34:36,001 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:34:36,006 WARN L253 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 146 conjuncts are in the unsatisfiable core [2024-11-09 05:34:36,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:36,060 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:36,061 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:36,062 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:36,067 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:34:36,077 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:36,078 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:36,079 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:36,084 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:34:36,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 33 [2024-11-09 05:34:36,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:36,185 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-09 05:34:36,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 37 [2024-11-09 05:34:36,232 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:36,233 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:36,234 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:36,239 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:34:36,750 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 05:34:36,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 48 [2024-11-09 05:34:37,316 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:34:37,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2024-11-09 05:34:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 05:34:37,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:34:40,367 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:34:40,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154853455] [2024-11-09 05:34:40,367 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:34:40,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048627587] [2024-11-09 05:34:40,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048627587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:34:40,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [611559216] [2024-11-09 05:34:40,370 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:34:40,371 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:34:40,371 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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) 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-09 05:34:40,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:34:40,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-09 05:34:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557640690] [2024-11-09 05:34:40,372 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 05:34:40,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 05:34:40,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:34:40,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 05:34:40,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-11-09 05:34:40,375 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:34:41,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:41,898 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2024-11-09 05:34:41,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:34:41,902 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-11-09 05:34:41,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:41,904 INFO L225 Difference]: With dead ends: 62 [2024-11-09 05:34:41,904 INFO L226 Difference]: Without dead ends: 60 [2024-11-09 05:34:41,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2024-11-09 05:34:41,906 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:41,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 152 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 05:34:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-09 05:34:41,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 45. [2024-11-09 05:34:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2024-11-09 05:34:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2024-11-09 05:34:41,928 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 26 [2024-11-09 05:34:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:41,929 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2024-11-09 05:34:41,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 05:34:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2024-11-09 05:34:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 05:34:41,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:41,931 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] [2024-11-09 05:34:41,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 05:34:42,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:34:42,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:34:42,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:42,133 INFO L85 PathProgramCache]: Analyzing trace with hash -225753131, now seen corresponding path program 1 times [2024-11-09 05:34:42,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:34:42,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829488238] [2024-11-09 05:34:42,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:42,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:34:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:34:43,924 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:34:43,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829488238] [2024-11-09 05:34:43,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829488238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:34:43,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:34:43,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 05:34:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469983093] [2024-11-09 05:34:43,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:34:43,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:34:43,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:34:43,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:34:43,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:34:43,927 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:34:44,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:34:44,296 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2024-11-09 05:34:44,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:34:44,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-09 05:34:44,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:34:44,299 INFO L225 Difference]: With dead ends: 72 [2024-11-09 05:34:44,301 INFO L226 Difference]: Without dead ends: 54 [2024-11-09 05:34:44,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:34:44,302 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:34:44,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 45 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:34:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-09 05:34:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-11-09 05:34:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.125) internal successors, (36), 35 states have internal predecessors, (36), 10 states have call successors, (10), 6 states have call predecessors, (10), 10 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-09 05:34:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2024-11-09 05:34:44,349 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 24 [2024-11-09 05:34:44,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:34:44,350 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2024-11-09 05:34:44,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:34:44,350 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2024-11-09 05:34:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 05:34:44,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:34:44,351 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-09 05:34:44,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:34:44,352 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:34:44,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:34:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1931717857, now seen corresponding path program 1 times [2024-11-09 05:34:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:34:44,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974959183] [2024-11-09 05:34:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:44,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:34:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:34:44,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732985269] [2024-11-09 05:34:44,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:34:44,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:34:44,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:34:44,432 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:34:44,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:34:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:34:44,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-09 05:34:44,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:34:44,760 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:44,762 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:44,763 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:44,764 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:44,769 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:34:44,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:44,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:44,783 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:44,793 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:34:44,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:34:44,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 33 [2024-11-09 05:34:44,892 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-09 05:34:44,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 53 [2024-11-09 05:34:44,956 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:44,957 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:44,958 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:34:44,967 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:34:45,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 24 [2024-11-09 05:34:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:34:45,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:34:46,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:34:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974959183] [2024-11-09 05:34:46,528 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:34:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732985269] [2024-11-09 05:34:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732985269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:34:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [19539179] [2024-11-09 05:34:46,533 INFO L159 IcfgInterpreter]: Started Sifa with 23 locations of interest [2024-11-09 05:34:46,533 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:34:46,534 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-09 05:34:46,541 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-09 05:34:46,542 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-09 05:34:47,605 INFO L197 IcfgInterpreter]: Interpreting procedure func_to_recursive_line_33_to_35_0 with input of size 102 for LOIs [2024-11-09 05:34:47,744 INFO L197 IcfgInterpreter]: Interpreting procedure func_to_recursive_line_37_to_44_0 with input of size 95 for LOIs [2024-11-09 05:34:48,476 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 183 for LOIs [2024-11-09 05:34:49,140 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-09 05:35:14,553 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1198#(and (<= 1 |#StackHeapBarrier|) (= |__VERIFIER_assert_#in~cond| 0) (exists ((v_func_to_recursive_line_37_to_44_0_~B.base_BEFORE_CALL_5 Int) (v_func_to_recursive_line_37_to_44_0_~A.base_BEFORE_CALL_5 Int) (v_func_to_recursive_line_37_to_44_0_~b.base_BEFORE_CALL_6 Int) (|v_#length_13| (Array Int Int)) (v_func_to_recursive_line_37_to_44_0_~r.base_BEFORE_CALL_5 Int) (v_func_to_recursive_line_37_to_44_0_~q.base_BEFORE_CALL_5 Int) (|v_#valid_26| (Array Int Int))) (and (<= (+ |#StackHeapBarrier| 1) v_func_to_recursive_line_37_to_44_0_~r.base_BEFORE_CALL_5) (not (= (mod (+ (select (select |#memory_int| v_func_to_recursive_line_37_to_44_0_~r.base_BEFORE_CALL_5) 0) (* (select (select |#memory_int| v_func_to_recursive_line_37_to_44_0_~q.base_BEFORE_CALL_5) 0) (select (select |#memory_int| v_func_to_recursive_line_37_to_44_0_~b.base_BEFORE_CALL_6) 0))) 4294967296) (mod (select (select |#memory_int| v_func_to_recursive_line_37_to_44_0_~A.base_BEFORE_CALL_5) 0) 4294967296))) (<= (+ |#StackHeapBarrier| 1) v_func_to_recursive_line_37_to_44_0_~q.base_BEFORE_CALL_5) (= (store (store (store (store (store |v_#valid_26| v_func_to_recursive_line_37_to_44_0_~A.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~B.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~q.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~r.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~b.base_BEFORE_CALL_6 1) |#valid|) (<= (+ |#StackHeapBarrier| 1) v_func_to_recursive_line_37_to_44_0_~A.base_BEFORE_CALL_5) (= (select |v_#valid_26| 0) 0) (= (select (store (store |v_#valid_26| v_func_to_recursive_line_37_to_44_0_~A.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~B.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~q.base_BEFORE_CALL_5) 0) (= |#length| (store (store (store (store (store |v_#length_13| v_func_to_recursive_line_37_to_44_0_~A.base_BEFORE_CALL_5 4) v_func_to_recursive_line_37_to_44_0_~B.base_BEFORE_CALL_5 4) v_func_to_recursive_line_37_to_44_0_~q.base_BEFORE_CALL_5 4) v_func_to_recursive_line_37_to_44_0_~r.base_BEFORE_CALL_5 4) v_func_to_recursive_line_37_to_44_0_~b.base_BEFORE_CALL_6 4)) (= 2 (select |v_#length_13| 1)) (<= (+ (mod (select (select |#memory_int| v_func_to_recursive_line_37_to_44_0_~r.base_BEFORE_CALL_5) 0) 4294967296) 1) (mod (select (select |#memory_int| v_func_to_recursive_line_37_to_44_0_~b.base_BEFORE_CALL_6) 0) 4294967296)) (= (select (store |v_#valid_26| v_func_to_recursive_line_37_to_44_0_~A.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~B.base_BEFORE_CALL_5) 0) (= (select (store (store (store (store |v_#valid_26| v_func_to_recursive_line_37_to_44_0_~A.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~B.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~q.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~r.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~b.base_BEFORE_CALL_6) 0) (= (select |v_#length_13| 2) 10) (= (select (store (store (store |v_#valid_26| v_func_to_recursive_line_37_to_44_0_~A.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~B.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~q.base_BEFORE_CALL_5 1) v_func_to_recursive_line_37_to_44_0_~r.base_BEFORE_CALL_5) 0) (= (select |v_#valid_26| v_func_to_recursive_line_37_to_44_0_~A.base_BEFORE_CALL_5) 0) (= (select |v_#valid_26| 1) 1) (<= (+ |#StackHeapBarrier| 1) v_func_to_recursive_line_37_to_44_0_~B.base_BEFORE_CALL_5) (<= (+ |#StackHeapBarrier| 1) v_func_to_recursive_line_37_to_44_0_~b.base_BEFORE_CALL_6) (= (select |v_#valid_26| 2) 1))) (exists ((|v_#memory_int_75| (Array Int (Array Int Int)))) (and (= 48 (select (select |v_#memory_int_75| 1) 0)) (= (select (select |v_#memory_int_75| 1) 1) 0))))' at error location [2024-11-09 05:35:14,553 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-09 05:35:14,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:35:14,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-11-09 05:35:14,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729329062] [2024-11-09 05:35:14,554 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 05:35:14,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 05:35:14,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:14,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 05:35:14,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1132, Unknown=4, NotChecked=0, Total=1260 [2024-11-09 05:35:14,556 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:35:15,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:15,576 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2024-11-09 05:35:15,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:35:15,577 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2024-11-09 05:35:15,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:15,578 INFO L225 Difference]: With dead ends: 61 [2024-11-09 05:35:15,578 INFO L226 Difference]: Without dead ends: 45 [2024-11-09 05:35:15,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=161, Invalid=1557, Unknown=4, NotChecked=0, Total=1722 [2024-11-09 05:35:15,581 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:15,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 93 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:35:15,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-09 05:35:15,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-09 05:35:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 30 states have internal predecessors, (31), 8 states have call successors, (8), 5 states have call predecessors, (8), 9 states have return successors, (15), 9 states have call predecessors, (15), 7 states have call successors, (15) [2024-11-09 05:35:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2024-11-09 05:35:15,602 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 24 [2024-11-09 05:35:15,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:15,604 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-09 05:35:15,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:35:15,604 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2024-11-09 05:35:15,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 05:35:15,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:15,605 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:15,617 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 05:35:15,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 05:35:15,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:35:15,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:15,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1470918606, now seen corresponding path program 3 times [2024-11-09 05:35:15,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:15,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859388209] [2024-11-09 05:35:15,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:15,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:35:15,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900841059] [2024-11-09 05:35:15,869 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 05:35:15,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:15,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:35:15,872 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:35:15,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:35:16,087 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 05:35:16,087 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:35:16,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 124 conjuncts are in the unsatisfiable core [2024-11-09 05:35:16,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:16,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:16,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:16,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:16,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:16,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:16,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:16,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:16,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:16,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:16,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:16,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:16,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:17,393 INFO L349 Elim1Store]: treesize reduction 168, result has 44.6 percent of original size [2024-11-09 05:35:17,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 19 case distinctions, treesize of input 742 treesize of output 903 [2024-11-09 05:35:17,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:17,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:17,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:17,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:17,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:17,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:17,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:17,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:17,763 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:17,990 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:18,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:18,272 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:18,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:18,422 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:18,461 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:18,471 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:18,507 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:18,599 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:18,666 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:18,741 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:18,742 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:18,774 INFO L224 Elim1Store]: Index analysis took 1257 ms [2024-11-09 05:35:18,965 INFO L349 Elim1Store]: treesize reduction 120, result has 12.4 percent of original size [2024-11-09 05:35:18,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 22 case distinctions, treesize of input 191 treesize of output 337 [2024-11-09 05:35:19,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 62 treesize of output 120 [2024-11-09 05:35:19,248 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 05:35:19,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 42 [2024-11-09 05:35:19,453 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 34 treesize of output 49 [2024-11-09 05:35:19,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2024-11-09 05:35:24,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:24,694 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:24,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:24,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:24,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:24,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:24,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:24,715 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:24,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:24,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:24,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:24,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:24,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:24,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:24,759 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:24,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 742 treesize of output 672 [2024-11-09 05:35:25,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,174 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:25,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:25,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:25,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 106 [2024-11-09 05:35:25,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 3 [2024-11-09 05:35:25,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:25,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,306 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:25,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:25,339 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:25,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 116 [2024-11-09 05:35:25,366 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:35:25,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1796 treesize of output 1705 [2024-11-09 05:35:27,468 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:27,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-09 05:35:31,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:31,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:31,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:31,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:31,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:31,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:31,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:31,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:31,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:31,550 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:31,566 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:31,767 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:31,781 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:31,845 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:31,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:31,943 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:31,978 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:32,099 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:32,200 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:32,220 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:32,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:32,278 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:32,281 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:32,292 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:32,293 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:32,347 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:32,347 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:32,350 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:32,351 INFO L224 Elim1Store]: Index analysis took 927 ms [2024-11-09 05:35:32,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 317 [2024-11-09 05:35:32,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 62 treesize of output 69 [2024-11-09 05:35:32,647 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 05:35:32,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 42 [2024-11-09 05:35:32,792 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 34 treesize of output 49 [2024-11-09 05:35:32,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2024-11-09 05:35:33,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,596 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:33,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,627 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:33,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:33,647 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:35:33,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 123 [2024-11-09 05:35:33,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 105 treesize of output 155 [2024-11-09 05:35:37,925 INFO L349 Elim1Store]: treesize reduction 356, result has 22.1 percent of original size [2024-11-09 05:35:37,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 69510 treesize of output 63570 [2024-11-09 05:35:42,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:35:42,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 21 [2024-11-09 05:35:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 05:35:42,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:44,013 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_357 (Array Int Int)) (|func_to_recursive_line_37_to_44_0_#t~mem2| Int)) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#b~0#1.base| v_ArrVal_357))) (= (mod (select (select .cse0 |c_ULTIMATE.start_main_~#A~0#1.base|) |c_ULTIMATE.start_main_~#A~0#1.offset|) 4294967296) (mod (+ (select (select .cse0 |c_ULTIMATE.start_main_~#r~0#1.base|) |c_ULTIMATE.start_main_~#r~0#1.offset|) (* |func_to_recursive_line_37_to_44_0_#t~mem2| (select (select .cse0 |c_ULTIMATE.start_main_~#q~0#1.base|) |c_ULTIMATE.start_main_~#q~0#1.offset|))) 4294967296)))) is different from false [2024-11-09 05:35:44,049 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:44,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859388209] [2024-11-09 05:35:44,050 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:35:44,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900841059] [2024-11-09 05:35:44,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900841059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:35:44,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1430752989] [2024-11-09 05:35:44,053 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2024-11-09 05:35:44,053 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:35:44,054 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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) 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-09 05:35:44,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:35:44,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2024-11-09 05:35:44,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107394886] [2024-11-09 05:35:44,054 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 05:35:44,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 05:35:44,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:44,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 05:35:44,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=361, Unknown=2, NotChecked=38, Total=462 [2024-11-09 05:35:44,056 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 15 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:35:46,312 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-09 05:35:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:35:47,660 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-11-09 05:35:47,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:35:47,661 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2024-11-09 05:35:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:35:47,662 INFO L225 Difference]: With dead ends: 59 [2024-11-09 05:35:47,663 INFO L226 Difference]: Without dead ends: 57 [2024-11-09 05:35:47,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=103, Invalid=549, Unknown=2, NotChecked=48, Total=702 [2024-11-09 05:35:47,664 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:35:47,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 80 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 235 Invalid, 3 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 05:35:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-09 05:35:47,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2024-11-09 05:35:47,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 25 states have (on average 1.16) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 05:35:47,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-09 05:35:47,693 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 32 [2024-11-09 05:35:47,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:35:47,694 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-09 05:35:47,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 1.5) internal successors, (15), 11 states have internal predecessors, (15), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:35:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-09 05:35:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 05:35:47,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:35:47,698 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:35:47,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 05:35:47,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:47,898 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:35:47,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:35:47,900 INFO L85 PathProgramCache]: Analyzing trace with hash -748102372, now seen corresponding path program 1 times [2024-11-09 05:35:47,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:35:47,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234118926] [2024-11-09 05:35:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:47,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:35:48,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:35:48,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1145412481] [2024-11-09 05:35:48,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:35:48,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:35:48,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:35:48,140 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:35:48,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 05:35:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:35:48,650 WARN L253 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 180 conjuncts are in the unsatisfiable core [2024-11-09 05:35:48,658 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:35:48,684 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-09 05:35:48,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 53 [2024-11-09 05:35:48,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:48,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:48,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:48,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:48,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 33 [2024-11-09 05:35:49,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2024-11-09 05:35:51,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:51,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:51,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:51,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 198 [2024-11-09 05:35:51,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 3 [2024-11-09 05:35:52,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:52,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:35:52,331 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2024-11-09 05:35:52,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 265 treesize of output 251 [2024-11-09 05:35:52,358 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 22 treesize of output 16 [2024-11-09 05:35:52,364 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 20 treesize of output 14 [2024-11-09 05:35:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:35:52,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:35:57,038 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse13 (select |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~q.base))) (and (forall ((v_ArrVal_442 Int) (v_ArrVal_439 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~q.base (store .cse13 c_func_to_recursive_line_37_to_44_0_~q.offset v_ArrVal_442)))) (let ((.cse5 (select .cse14 c_func_to_recursive_line_37_to_44_0_~b.base))) (let ((.cse1 (div (mod (select .cse5 c_func_to_recursive_line_37_to_44_0_~b.offset) 4294967296) 2)) (.cse0 (store .cse14 c_func_to_recursive_line_37_to_44_0_~b.base v_ArrVal_439))) (or (< (mod (select (select .cse0 c_func_to_recursive_line_37_to_44_0_~r.base) c_func_to_recursive_line_37_to_44_0_~r.offset) 4294967296) .cse1) (let ((.cse11 (store |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~q.base (store .cse13 c_func_to_recursive_line_37_to_44_0_~q.offset (* 2 (select .cse13 c_func_to_recursive_line_37_to_44_0_~q.offset)))))) (let ((.cse9 (let ((.cse12 (select .cse11 c_func_to_recursive_line_37_to_44_0_~b.base))) (store .cse12 c_func_to_recursive_line_37_to_44_0_~b.offset (div (mod (select .cse12 c_func_to_recursive_line_37_to_44_0_~b.offset) 4294967296) 2))))) (let ((.cse10 (select (store .cse11 c_func_to_recursive_line_37_to_44_0_~b.base .cse9) c_func_to_recursive_line_37_to_44_0_~q.base))) (let ((.cse6 (+ (select .cse10 c_func_to_recursive_line_37_to_44_0_~q.offset) 1))) (let ((.cse8 (store (store |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~b.base .cse9) c_func_to_recursive_line_37_to_44_0_~q.base (store .cse10 c_func_to_recursive_line_37_to_44_0_~q.offset .cse6)))) (let ((.cse7 (select .cse8 c_func_to_recursive_line_37_to_44_0_~r.base))) (let ((.cse4 (select (select .cse8 c_func_to_recursive_line_37_to_44_0_~b.base) c_func_to_recursive_line_37_to_44_0_~b.offset)) (.cse3 (select .cse7 c_func_to_recursive_line_37_to_44_0_~r.offset))) (let ((.cse2 (store (store (store |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~b.base (store .cse5 c_func_to_recursive_line_37_to_44_0_~b.offset .cse1)) c_func_to_recursive_line_37_to_44_0_~q.base (store (select .cse0 c_func_to_recursive_line_37_to_44_0_~q.base) c_func_to_recursive_line_37_to_44_0_~q.offset .cse6)) c_func_to_recursive_line_37_to_44_0_~r.base (store .cse7 c_func_to_recursive_line_37_to_44_0_~r.offset (+ (* (- 1) .cse4) .cse3))))) (= (mod (select (select .cse2 c_func_to_recursive_line_37_to_44_0_~A.base) c_func_to_recursive_line_37_to_44_0_~A.offset) 4294967296) (mod (+ (* (select (select .cse2 c_func_to_recursive_line_37_to_44_0_~q.base) c_func_to_recursive_line_37_to_44_0_~q.offset) (select (select .cse2 c_func_to_recursive_line_37_to_44_0_~b.base) c_func_to_recursive_line_37_to_44_0_~b.offset)) .cse3 (* .cse4 4294967295)) 4294967296))))))))))))))) (forall ((v_ArrVal_442 Int) (v_DerPreprocessor_93 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~q.base (store .cse13 c_func_to_recursive_line_37_to_44_0_~q.offset v_ArrVal_442)))) (let ((.cse17 (store .cse15 c_func_to_recursive_line_37_to_44_0_~b.base v_DerPreprocessor_93))) (let ((.cse16 (select (select .cse17 c_func_to_recursive_line_37_to_44_0_~r.base) c_func_to_recursive_line_37_to_44_0_~r.offset))) (or (< (div (mod (select (select .cse15 c_func_to_recursive_line_37_to_44_0_~b.base) c_func_to_recursive_line_37_to_44_0_~b.offset) 4294967296) 2) (+ (mod .cse16 4294967296) 1)) (= (mod (+ (* (select v_DerPreprocessor_93 c_func_to_recursive_line_37_to_44_0_~b.offset) (select (select .cse17 c_func_to_recursive_line_37_to_44_0_~q.base) c_func_to_recursive_line_37_to_44_0_~q.offset)) .cse16) 4294967296) (mod (select (select .cse17 c_func_to_recursive_line_37_to_44_0_~A.base) c_func_to_recursive_line_37_to_44_0_~A.offset) 4294967296))))))))) (= (mod |c_func_to_recursive_line_37_to_44_0_#t~mem5| 4294967296) (mod |c_func_to_recursive_line_37_to_44_0_#t~mem6| 4294967296))) is different from false [2024-11-09 05:35:57,844 WARN L851 $PredicateComparison]: unable to prove that (or (let ((.cse13 (select |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~q.base))) (and (forall ((v_ArrVal_442 Int) (v_ArrVal_439 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~q.base (store .cse13 c_func_to_recursive_line_37_to_44_0_~q.offset v_ArrVal_442)))) (let ((.cse5 (select .cse14 c_func_to_recursive_line_37_to_44_0_~b.base))) (let ((.cse1 (div (mod (select .cse5 c_func_to_recursive_line_37_to_44_0_~b.offset) 4294967296) 2)) (.cse0 (store .cse14 c_func_to_recursive_line_37_to_44_0_~b.base v_ArrVal_439))) (or (< (mod (select (select .cse0 c_func_to_recursive_line_37_to_44_0_~r.base) c_func_to_recursive_line_37_to_44_0_~r.offset) 4294967296) .cse1) (let ((.cse11 (store |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~q.base (store .cse13 c_func_to_recursive_line_37_to_44_0_~q.offset (* 2 (select .cse13 c_func_to_recursive_line_37_to_44_0_~q.offset)))))) (let ((.cse9 (let ((.cse12 (select .cse11 c_func_to_recursive_line_37_to_44_0_~b.base))) (store .cse12 c_func_to_recursive_line_37_to_44_0_~b.offset (div (mod (select .cse12 c_func_to_recursive_line_37_to_44_0_~b.offset) 4294967296) 2))))) (let ((.cse10 (select (store .cse11 c_func_to_recursive_line_37_to_44_0_~b.base .cse9) c_func_to_recursive_line_37_to_44_0_~q.base))) (let ((.cse6 (+ (select .cse10 c_func_to_recursive_line_37_to_44_0_~q.offset) 1))) (let ((.cse8 (store (store |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~b.base .cse9) c_func_to_recursive_line_37_to_44_0_~q.base (store .cse10 c_func_to_recursive_line_37_to_44_0_~q.offset .cse6)))) (let ((.cse7 (select .cse8 c_func_to_recursive_line_37_to_44_0_~r.base))) (let ((.cse4 (select (select .cse8 c_func_to_recursive_line_37_to_44_0_~b.base) c_func_to_recursive_line_37_to_44_0_~b.offset)) (.cse3 (select .cse7 c_func_to_recursive_line_37_to_44_0_~r.offset))) (let ((.cse2 (store (store (store |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~b.base (store .cse5 c_func_to_recursive_line_37_to_44_0_~b.offset .cse1)) c_func_to_recursive_line_37_to_44_0_~q.base (store (select .cse0 c_func_to_recursive_line_37_to_44_0_~q.base) c_func_to_recursive_line_37_to_44_0_~q.offset .cse6)) c_func_to_recursive_line_37_to_44_0_~r.base (store .cse7 c_func_to_recursive_line_37_to_44_0_~r.offset (+ (* (- 1) .cse4) .cse3))))) (= (mod (select (select .cse2 c_func_to_recursive_line_37_to_44_0_~A.base) c_func_to_recursive_line_37_to_44_0_~A.offset) 4294967296) (mod (+ (* (select (select .cse2 c_func_to_recursive_line_37_to_44_0_~q.base) c_func_to_recursive_line_37_to_44_0_~q.offset) (select (select .cse2 c_func_to_recursive_line_37_to_44_0_~b.base) c_func_to_recursive_line_37_to_44_0_~b.offset)) .cse3 (* .cse4 4294967295)) 4294967296))))))))))))))) (forall ((v_ArrVal_442 Int) (v_DerPreprocessor_93 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~q.base (store .cse13 c_func_to_recursive_line_37_to_44_0_~q.offset v_ArrVal_442)))) (let ((.cse17 (store .cse15 c_func_to_recursive_line_37_to_44_0_~b.base v_DerPreprocessor_93))) (let ((.cse16 (select (select .cse17 c_func_to_recursive_line_37_to_44_0_~r.base) c_func_to_recursive_line_37_to_44_0_~r.offset))) (or (< (div (mod (select (select .cse15 c_func_to_recursive_line_37_to_44_0_~b.base) c_func_to_recursive_line_37_to_44_0_~b.offset) 4294967296) 2) (+ (mod .cse16 4294967296) 1)) (= (mod (+ (* (select v_DerPreprocessor_93 c_func_to_recursive_line_37_to_44_0_~b.offset) (select (select .cse17 c_func_to_recursive_line_37_to_44_0_~q.base) c_func_to_recursive_line_37_to_44_0_~q.offset)) .cse16) 4294967296) (mod (select (select .cse17 c_func_to_recursive_line_37_to_44_0_~A.base) c_func_to_recursive_line_37_to_44_0_~A.offset) 4294967296))))))))) (= (mod (select (select |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~b.base) c_func_to_recursive_line_37_to_44_0_~b.offset) 4294967296) (mod (select (select |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~B.base) c_func_to_recursive_line_37_to_44_0_~B.offset) 4294967296))) is different from false [2024-11-09 05:35:58,920 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:35:58,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234118926] [2024-11-09 05:35:58,920 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:35:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145412481] [2024-11-09 05:35:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145412481] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:35:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [379643826] [2024-11-09 05:35:58,924 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 05:35:58,924 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:35:58,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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) 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-09 05:35:58,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:35:58,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2024-11-09 05:35:58,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839779806] [2024-11-09 05:35:58,926 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 05:35:58,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 05:35:58,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:35:58,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 05:35:58,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=449, Unknown=2, NotChecked=86, Total=600 [2024-11-09 05:35:58,928 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 14 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:36:03,350 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-09 05:36:09,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:36:11,874 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-09 05:36:20,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 05:36:24,003 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 [0] [2024-11-09 05:36:26,429 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-09 05:36:29,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 [0] [2024-11-09 05:36:31,942 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 [0] [2024-11-09 05:36:34,894 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-09 05:36:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:36:34,895 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2024-11-09 05:36:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 05:36:35,474 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.25) internal successors, (20), 14 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2024-11-09 05:36:35,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:36:35,476 INFO L225 Difference]: With dead ends: 71 [2024-11-09 05:36:35,476 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 05:36:35,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=142, Invalid=1037, Unknown=19, NotChecked=134, Total=1332 [2024-11-09 05:36:35,478 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 12 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:36:35,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 133 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 532 Invalid, 20 Unknown, 0 Unchecked, 22.4s Time] [2024-11-09 05:36:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 05:36:35,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2024-11-09 05:36:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.105263157894737) internal successors, (42), 41 states have internal predecessors, (42), 11 states have call successors, (11), 9 states have call predecessors, (11), 10 states have return successors, (16), 9 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-09 05:36:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 69 transitions. [2024-11-09 05:36:35,507 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 69 transitions. Word has length 30 [2024-11-09 05:36:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:36:35,508 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 69 transitions. [2024-11-09 05:36:35,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.25) internal successors, (20), 14 states have internal predecessors, (20), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 05:36:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 69 transitions. [2024-11-09 05:36:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 05:36:35,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:36:35,510 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:36:35,522 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 05:36:35,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:36:35,711 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:36:35,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:36:35,711 INFO L85 PathProgramCache]: Analyzing trace with hash -517310941, now seen corresponding path program 2 times [2024-11-09 05:36:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:36:35,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438914354] [2024-11-09 05:36:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:36:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:36:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:36:36,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [734259198] [2024-11-09 05:36:36,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 05:36:36,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:36:36,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:36:36,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:36:36,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 05:36:41,611 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 05:36:41,612 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:36:41,618 WARN L253 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 221 conjuncts are in the unsatisfiable core [2024-11-09 05:36:41,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:36:41,740 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-09 05:36:41,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 53 [2024-11-09 05:36:41,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:36:41,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:36:42,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:36:42,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:36:42,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 33 [2024-11-09 05:36:46,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:36:46,649 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-09 05:36:46,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 53 [2024-11-09 05:38:55,194 WARN L286 SmtUtils]: Spent 2.03m on a formula simplification. DAG size of input: 627 DAG size of output: 126 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 05:38:55,195 INFO L349 Elim1Store]: treesize reduction 4075, result has 12.1 percent of original size [2024-11-09 05:38:55,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 21 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 26 new quantified variables, introduced 121 case distinctions, treesize of input 4244 treesize of output 4673 [2024-11-09 05:38:57,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 2618 treesize of output 2255 [2024-11-09 05:38:59,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:38:59,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:00,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:00,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:00,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:00,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:00,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:00,632 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:00,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:00,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:01,004 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:01,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:01,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:01,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:01,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:01,314 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:01,315 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:01,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:01,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:01,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:01,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:02,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:02,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:02,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:02,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:02,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:02,566 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:02,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:02,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:02,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:02,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:03,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:03,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:03,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:03,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:03,249 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:03,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:03,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:03,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:03,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:03,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:03,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:04,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:04,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:04,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:04,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:04,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:04,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:04,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:04,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:04,983 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:05,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:05,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:05,197 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:05,202 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:05,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:05,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:05,398 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:05,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:05,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:05,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:06,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:06,052 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:06,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:06,198 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:06,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:06,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:06,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:06,482 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:06,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:06,553 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:06,739 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:07,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:07,033 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:07,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:07,407 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:07,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:07,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:07,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:08,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:08,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:08,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:08,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:08,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:08,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:08,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:08,816 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:08,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:09,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:09,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:09,261 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:09,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:09,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:09,396 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:09,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:09,478 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:09,962 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:10,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:10,033 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:10,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:10,142 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:10,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:10,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:10,367 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:10,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:10,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:10,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:10,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:10,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:11,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:11,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:11,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:11,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:11,404 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:11,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:11,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:11,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:11,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:11,738 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:11,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:11,848 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:11,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:12,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:12,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:12,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:13,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:13,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:13,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:13,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:13,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:13,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:13,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:13,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:14,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:14,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:14,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:14,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:14,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:14,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:14,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:14,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:14,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:14,862 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:14,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:15,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:15,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:15,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:15,252 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:15,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:15,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:15,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:15,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:16,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:16,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:16,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:16,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:16,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:16,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:16,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:17,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:17,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:17,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:17,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:17,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:17,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:18,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:18,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:18,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:18,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:18,298 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:18,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:18,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:18,542 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:39:18,542 INFO L224 Elim1Store]: Index analysis took 18312 ms [2024-11-09 05:39:18,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 16 stores, 3 select indices, 3 select index equivalence classes, 67 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 1153 treesize of output 5177 [2024-11-09 05:39:53,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:53,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:54,184 INFO L349 Elim1Store]: treesize reduction 61, result has 6.2 percent of original size [2024-11-09 05:39:54,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 13168 treesize of output 13132 [2024-11-09 05:39:54,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 963 treesize of output 932 [2024-11-09 05:39:54,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 5 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 1489 treesize of output 1405 [2024-11-09 05:39:55,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 913 treesize of output 1049 [2024-11-09 05:39:55,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:55,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:55,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:55,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:55,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:39:55,655 INFO L224 Elim1Store]: Index analysis took 166 ms [2024-11-09 05:39:55,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2024-11-09 05:39:55,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-09 05:39:55,775 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 56 treesize of output 52 [2024-11-09 05:39:57,353 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-09 05:39:57,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:40:20,900 WARN L851 $PredicateComparison]: unable to prove that (or (= (mod (select (select |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~b.base) c_func_to_recursive_line_37_to_44_0_~b.offset) 4294967296) (mod (select (select |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~B.base) c_func_to_recursive_line_37_to_44_0_~B.offset) 4294967296)) (let ((.cse3 (store |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~q.base (let ((.cse15 (select |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~q.base))) (store .cse15 c_func_to_recursive_line_37_to_44_0_~q.offset (* 2 (select .cse15 c_func_to_recursive_line_37_to_44_0_~q.offset))))))) (let ((.cse14 (select .cse3 c_func_to_recursive_line_37_to_44_0_~b.base))) (let ((.cse2 (div (mod (select .cse14 c_func_to_recursive_line_37_to_44_0_~b.offset) 4294967296) 2))) (and (forall ((v_DerPreprocessor_148 (Array Int Int))) (let ((.cse0 (store .cse3 c_func_to_recursive_line_37_to_44_0_~b.base v_DerPreprocessor_148))) (let ((.cse1 (select (select .cse0 c_func_to_recursive_line_37_to_44_0_~r.base) c_func_to_recursive_line_37_to_44_0_~r.offset))) (or (= (mod (+ (* (select v_DerPreprocessor_148 c_func_to_recursive_line_37_to_44_0_~b.offset) (select (select .cse0 c_func_to_recursive_line_37_to_44_0_~q.base) c_func_to_recursive_line_37_to_44_0_~q.offset)) .cse1) 4294967296) (mod (select (select .cse0 c_func_to_recursive_line_37_to_44_0_~A.base) c_func_to_recursive_line_37_to_44_0_~A.offset) 4294967296)) (< .cse2 (+ (mod .cse1 4294967296) 1)))))) (forall ((v_ArrVal_525 (Array Int Int))) (let ((.cse8 (store .cse3 c_func_to_recursive_line_37_to_44_0_~b.base v_ArrVal_525))) (or (let ((.cse13 (store .cse14 c_func_to_recursive_line_37_to_44_0_~b.offset .cse2))) (let ((.cse12 (select (store .cse3 c_func_to_recursive_line_37_to_44_0_~b.base .cse13) c_func_to_recursive_line_37_to_44_0_~q.base))) (let ((.cse7 (store |c_#memory_int| c_func_to_recursive_line_37_to_44_0_~b.base .cse13)) (.cse9 (+ (select .cse12 c_func_to_recursive_line_37_to_44_0_~q.offset) 1))) (let ((.cse11 (store .cse7 c_func_to_recursive_line_37_to_44_0_~q.base (store .cse12 c_func_to_recursive_line_37_to_44_0_~q.offset .cse9)))) (let ((.cse10 (select .cse11 c_func_to_recursive_line_37_to_44_0_~r.base))) (let ((.cse6 (select (select .cse11 c_func_to_recursive_line_37_to_44_0_~b.base) c_func_to_recursive_line_37_to_44_0_~b.offset)) (.cse5 (select .cse10 c_func_to_recursive_line_37_to_44_0_~r.offset))) (let ((.cse4 (store (store .cse7 c_func_to_recursive_line_37_to_44_0_~q.base (store (select .cse8 c_func_to_recursive_line_37_to_44_0_~q.base) c_func_to_recursive_line_37_to_44_0_~q.offset .cse9)) c_func_to_recursive_line_37_to_44_0_~r.base (store .cse10 c_func_to_recursive_line_37_to_44_0_~r.offset (+ (* (- 1) .cse6) .cse5))))) (= (mod (+ (* (select (select .cse4 c_func_to_recursive_line_37_to_44_0_~b.base) c_func_to_recursive_line_37_to_44_0_~b.offset) (select (select .cse4 c_func_to_recursive_line_37_to_44_0_~q.base) c_func_to_recursive_line_37_to_44_0_~q.offset)) .cse5 (* .cse6 4294967295)) 4294967296) (mod (select (select .cse4 c_func_to_recursive_line_37_to_44_0_~A.base) c_func_to_recursive_line_37_to_44_0_~A.offset) 4294967296))))))))) (< (mod (select (select .cse8 c_func_to_recursive_line_37_to_44_0_~r.base) c_func_to_recursive_line_37_to_44_0_~r.offset) 4294967296) .cse2))))))))) is different from false [2024-11-09 05:40:22,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:40:22,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438914354] [2024-11-09 05:40:22,252 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:40:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734259198] [2024-11-09 05:40:22,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734259198] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:40:22,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [158465453] [2024-11-09 05:40:22,255 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 05:40:22,255 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:40:22,256 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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) 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-09 05:40:22,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:40:22,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2024-11-09 05:40:22,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108071709] [2024-11-09 05:40:22,256 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 05:40:22,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 05:40:22,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:40:22,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 05:40:22,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=785, Unknown=6, NotChecked=56, Total=930 [2024-11-09 05:40:22,259 INFO L87 Difference]: Start difference. First operand 60 states and 69 transitions. Second operand has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:41:36,813 WARN L286 SmtUtils]: Spent 51.74s on a formula simplification that was a NOOP. DAG size: 376 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:41:47,588 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 387 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:41:53,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:41:53,950 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2024-11-09 05:41:53,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 05:41:53,953 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2024-11-09 05:41:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:41:53,954 INFO L225 Difference]: With dead ends: 91 [2024-11-09 05:41:53,954 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 05:41:53,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 117.0s TimeCoverageRelationStatistics Valid=180, Invalid=1705, Unknown=11, NotChecked=84, Total=1980 [2024-11-09 05:41:53,957 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 8 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:41:53,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 212 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 839 Invalid, 17 Unknown, 0 Unchecked, 14.4s Time] [2024-11-09 05:41:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 05:41:53,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 62. [2024-11-09 05:41:53,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 42 states have internal predecessors, (43), 11 states have call successors, (11), 9 states have call predecessors, (11), 11 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2024-11-09 05:41:54,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2024-11-09 05:41:54,001 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 36 [2024-11-09 05:41:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:41:54,001 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2024-11-09 05:41:54,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.105263157894737) internal successors, (21), 17 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 05:41:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2024-11-09 05:41:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 05:41:54,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:41:54,007 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:41:54,023 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 05:41:54,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 05:41:54,208 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:41:54,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:41:54,208 INFO L85 PathProgramCache]: Analyzing trace with hash -500366614, now seen corresponding path program 3 times [2024-11-09 05:41:54,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:41:54,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5325218] [2024-11-09 05:41:54,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:41:54,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:41:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:41:54,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [182665886] [2024-11-09 05:41:54,532 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 05:41:54,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:41:54,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:41:54,534 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:41:54,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 05:41:55,173 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 05:41:55,173 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 05:41:55,184 WARN L253 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 224 conjuncts are in the unsatisfiable core [2024-11-09 05:41:55,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:41:55,291 INFO L349 Elim1Store]: treesize reduction 48, result has 2.0 percent of original size [2024-11-09 05:41:55,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 53 [2024-11-09 05:41:55,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:41:55,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:41:55,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:41:55,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:41:55,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 33 [2024-11-09 05:42:00,589 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 05:42:00,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2024-11-09 05:42:07,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:42:07,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:42:08,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:42:08,293 INFO L349 Elim1Store]: treesize reduction 59, result has 14.5 percent of original size [2024-11-09 05:42:08,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 220 treesize of output 209 [2024-11-09 05:42:08,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 134 [2024-11-09 05:42:08,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-09 05:42:08,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2024-11-09 05:42:09,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 43 [2024-11-09 05:42:14,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:42:14,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:42:14,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:42:14,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:42:14,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:42:14,956 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:42:15,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:42:15,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 159 treesize of output 201 [2024-11-09 05:42:15,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 103 [2024-11-09 05:42:15,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 108 [2024-11-09 05:42:21,145 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 91 treesize of output 77 [2024-11-09 05:42:21,170 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 79 treesize of output 71 [2024-11-09 05:42:21,198 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 73 treesize of output 65 [2024-11-09 05:42:21,223 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 67 treesize of output 59 [2024-11-09 05:42:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 05:42:22,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:43:52,196 WARN L286 SmtUtils]: Spent 7.24s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 05:44:12,465 WARN L286 SmtUtils]: Spent 8.60s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 05:44:32,885 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 05:44:56,684 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse136 (select |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse55 (select .cse136 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse16 (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse136 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| (* 8 .cse55))))) (and (forall ((|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse12 (let ((.cse18 (select .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse18 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse18 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))) (.cse14 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse17 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse17 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse17 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))))) (let ((.cse15 (select .cse14 |c_func_to_recursive_line_33_to_35_0_#in~b.base|)) (.cse13 (select (store .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse12) |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse3 (div (mod (select .cse13 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse0 (div (mod (select .cse15 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse11 (store .cse14 |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse15 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse0))) (.cse9 (store .cse13 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse3))) (let ((.cse2 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse12) |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse9)) (.cse1 (select (select .cse11 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (or (< .cse0 (+ (mod .cse1 4294967296) 1)) (< (mod (select (select .cse2 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse3) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (or (not (let ((.cse7 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse9) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse10 (select .cse2 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse10 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse10 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse8 (select .cse7 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse5 (select .cse8 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse6 (select (select .cse7 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse4 (store .cse7 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse8 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ .cse5 (* (- 1) .cse6)))))) (= (mod (select (select .cse4 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse5 (* .cse6 4294967295) (* .cse6 (select (select .cse4 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296))))))) (= (mod (+ .cse1 (* .cse0 (select (select .cse11 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296) (mod (select (select .cse11 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296))))))))))) (forall ((|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse31 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse36 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse36 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse36 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse33 (let ((.cse35 (select .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse35 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse35 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse34 (select (store .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse33) |c_func_to_recursive_line_33_to_35_0_#in~b.base|)) (.cse32 (select .cse31 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse30 (div (mod (select .cse32 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse29 (div (mod (select .cse34 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse27 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse33) |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse34 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse29))) (.cse24 (store .cse32 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse30))) (let ((.cse26 (store .cse31 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse24)) (.cse28 (select (select .cse27 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (or (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (or (let ((.cse22 (store (store |c_#memory_int| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse24) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse25 (select .cse26 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse25 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse25 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse23 (select .cse22 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse20 (select (select .cse22 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|)) (.cse21 (select .cse23 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (let ((.cse19 (store .cse22 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse23 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ (* (- 1) .cse20) .cse21))))) (= (mod (select (select .cse19 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (* 4294967295 .cse20) (* (select (select .cse19 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) .cse20) .cse21) 4294967296)))))) (not (= (mod (select (select .cse27 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse28 (* (select (select .cse27 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) .cse29)) 4294967296))))) (< (mod (select (select .cse26 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse30) (< .cse29 (+ (mod .cse28 4294967296) 1))))))))) (or (and (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse46 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse48 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse48 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse48 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))))) (let ((.cse47 (select .cse46 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse38 (div (mod (select .cse47 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse44 (store .cse47 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse38))) (let ((.cse37 (store .cse46 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse44))) (or (< (mod (select (select .cse37 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse38) (let ((.cse42 (store (store |c_#memory_int| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse44) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse45 (select .cse37 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse45 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse45 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse43 (select .cse42 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse40 (select (select .cse42 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|)) (.cse41 (select .cse43 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (let ((.cse39 (store .cse42 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse43 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ (* (- 1) .cse40) .cse41))))) (= (mod (select (select .cse39 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (* 4294967295 .cse40) (* (select (select .cse39 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) (select (select .cse39 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)) .cse41) 4294967296))))))))))))) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse52 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse54 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse54 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse54 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))))) (let ((.cse53 (select .cse52 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse49 (div (mod (select .cse53 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse51 (store .cse52 |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse53 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse49)))) (let ((.cse50 (select (select .cse51 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (or (< .cse49 (+ (mod .cse50 4294967296) 1)) (= (mod (+ .cse50 (* .cse49 (select (select .cse51 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296) (mod (select (select .cse51 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296)))))))))) (< (mod (select (select .cse16 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) (* 8 (mod .cse55 536870912)))) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse77 (let ((.cse80 (select .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse80 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse80 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse78 (select (store .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse77) |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse75 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse79 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse79 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse79 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse74 (div (mod (select .cse78 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse61 (store .cse78 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse74)) (.cse76 (select .cse75 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse65 (div (mod (select .cse76 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse73 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse77) |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse61))) (let ((.cse62 (select .cse73 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|)) (.cse71 (store .cse76 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse65))) (let ((.cse64 (store .cse75 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse71)) (.cse63 (select .cse62 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) (or (not (let ((.cse59 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse61) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (store .cse62 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ .cse63 1))))) (let ((.cse60 (select .cse59 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse57 (select .cse60 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse58 (select (select .cse59 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse56 (store .cse59 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse60 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ .cse57 (* (- 1) .cse58)))))) (= (mod (select (select .cse56 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse57 (* .cse58 4294967295) (* .cse58 (select (select .cse56 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296))))))) (< (mod (select (select .cse64 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse65) (let ((.cse69 (store (store |c_#memory_int| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse71) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse72 (select .cse64 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse72 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse72 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse70 (select .cse69 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse67 (select (select .cse69 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|)) (.cse68 (select .cse70 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (let ((.cse66 (store .cse69 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse70 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ (* (- 1) .cse67) .cse68))))) (= (mod (select (select .cse66 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (* 4294967295 .cse67) (* (select (select .cse66 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) (select (select .cse66 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)) .cse68) 4294967296)))))) (not (= (mod (select (select .cse73 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (select (select .cse73 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) (* .cse63 .cse74)) 4294967296)))))))))))) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse96 (let ((.cse99 (select .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse99 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse99 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse97 (select (store .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse96) |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse94 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse98 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse98 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse98 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse93 (div (mod (select .cse97 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse86 (store .cse97 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse93)) (.cse95 (select .cse94 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse89 (div (mod (select .cse95 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse92 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse96) |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse86))) (let ((.cse87 (select .cse92 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|)) (.cse91 (store .cse94 |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse95 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse89)))) (let ((.cse90 (select (select .cse91 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse88 (select .cse87 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) (or (not (let ((.cse84 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse86) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (store .cse87 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ .cse88 1))))) (let ((.cse85 (select .cse84 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse82 (select .cse85 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse83 (select (select .cse84 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse81 (store .cse84 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse85 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ .cse82 (* (- 1) .cse83)))))) (= (mod (select (select .cse81 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse82 (* .cse83 4294967295) (* .cse83 (select (select .cse81 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296))))))) (< .cse89 (+ (mod .cse90 4294967296) 1)) (= (mod (+ .cse90 (* .cse89 (select (select .cse91 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296) (mod (select (select .cse91 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296)) (not (= (mod (select (select .cse92 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (select (select .cse92 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) (* .cse88 .cse93)) 4294967296)))))))))))) (forall ((|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse119 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse123 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse123 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse123 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse118 (let ((.cse122 (select .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse122 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse122 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse121 (select (store .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse118) |c_func_to_recursive_line_33_to_35_0_#in~b.base|)) (.cse120 (select .cse119 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse116 (div (mod (select .cse120 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse117 (div (mod (select .cse121 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse105 (store .cse121 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse117)) (.cse113 (store .cse120 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse116))) (let ((.cse115 (store .cse119 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse113)) (.cse107 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse118) |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse105))) (or (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (or (not (let ((.cse103 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse105) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse106 (select .cse107 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse106 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse106 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse104 (select .cse103 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse101 (select .cse104 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse102 (select (select .cse103 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse100 (store .cse103 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse104 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ .cse101 (* (- 1) .cse102)))))) (= (mod (select (select .cse100 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse101 (* .cse102 4294967295) (* .cse102 (select (select .cse100 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296))))))) (let ((.cse111 (store (store |c_#memory_int| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse113) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse114 (select .cse115 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse114 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse114 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse112 (select .cse111 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse109 (select (select .cse111 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|)) (.cse110 (select .cse112 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (let ((.cse108 (store .cse111 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse112 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ (* (- 1) .cse109) .cse110))))) (= (mod (select (select .cse108 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (* 4294967295 .cse109) (* (select (select .cse108 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) (select (select .cse108 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)) .cse110) 4294967296)))))))) (< (mod (select (select .cse115 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse116) (< (mod (select (select .cse107 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse117)))))))) (forall ((|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse130 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse135 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse135 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse135 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse132 (let ((.cse134 (select .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse134 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse134 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse133 (select (store .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse132) |c_func_to_recursive_line_33_to_35_0_#in~b.base|)) (.cse131 (select .cse130 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse125 (div (mod (select .cse131 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse129 (div (mod (select .cse133 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse127 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse132) |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse133 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse129))) (.cse126 (store .cse130 |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse131 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse125)))) (let ((.cse124 (select (select .cse126 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse128 (select (select .cse127 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (or (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (or (= (mod (+ .cse124 (* .cse125 (select (select .cse126 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296) (mod (select (select .cse126 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296)) (not (= (mod (select (select .cse127 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse128 (* (select (select .cse127 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) .cse129)) 4294967296))))) (< .cse125 (+ (mod .cse124 4294967296) 1)) (< .cse129 (+ (mod .cse128 4294967296) 1))))))))))))) is different from false [2024-11-09 05:44:58,707 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse136 (select |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse55 (select .cse136 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse16 (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse136 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| (* 8 .cse55))))) (and (forall ((|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse12 (let ((.cse18 (select .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse18 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse18 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))) (.cse14 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse17 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse17 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse17 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))))) (let ((.cse15 (select .cse14 |c_func_to_recursive_line_33_to_35_0_#in~b.base|)) (.cse13 (select (store .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse12) |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse3 (div (mod (select .cse13 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse0 (div (mod (select .cse15 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse11 (store .cse14 |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse15 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse0))) (.cse9 (store .cse13 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse3))) (let ((.cse2 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse12) |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse9)) (.cse1 (select (select .cse11 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (or (< .cse0 (+ (mod .cse1 4294967296) 1)) (< (mod (select (select .cse2 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse3) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (or (not (let ((.cse7 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse9) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse10 (select .cse2 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse10 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse10 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse8 (select .cse7 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse5 (select .cse8 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse6 (select (select .cse7 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse4 (store .cse7 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse8 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ .cse5 (* (- 1) .cse6)))))) (= (mod (select (select .cse4 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse5 (* .cse6 4294967295) (* .cse6 (select (select .cse4 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296))))))) (= (mod (+ .cse1 (* .cse0 (select (select .cse11 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296) (mod (select (select .cse11 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296))))))))))) (forall ((|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse31 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse36 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse36 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse36 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse33 (let ((.cse35 (select .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse35 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse35 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse34 (select (store .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse33) |c_func_to_recursive_line_33_to_35_0_#in~b.base|)) (.cse32 (select .cse31 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse30 (div (mod (select .cse32 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse29 (div (mod (select .cse34 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse27 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse33) |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse34 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse29))) (.cse24 (store .cse32 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse30))) (let ((.cse26 (store .cse31 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse24)) (.cse28 (select (select .cse27 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (or (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (or (let ((.cse22 (store (store |c_#memory_int| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse24) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse25 (select .cse26 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse25 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse25 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse23 (select .cse22 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse20 (select (select .cse22 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|)) (.cse21 (select .cse23 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (let ((.cse19 (store .cse22 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse23 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ (* (- 1) .cse20) .cse21))))) (= (mod (select (select .cse19 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (* 4294967295 .cse20) (* (select (select .cse19 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) .cse20) .cse21) 4294967296)))))) (not (= (mod (select (select .cse27 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse28 (* (select (select .cse27 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) .cse29)) 4294967296))))) (< (mod (select (select .cse26 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse30) (< .cse29 (+ (mod .cse28 4294967296) 1))))))))) (or (and (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse46 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse48 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse48 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse48 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))))) (let ((.cse47 (select .cse46 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse38 (div (mod (select .cse47 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse44 (store .cse47 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse38))) (let ((.cse37 (store .cse46 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse44))) (or (< (mod (select (select .cse37 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse38) (let ((.cse42 (store (store |c_#memory_int| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse44) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse45 (select .cse37 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse45 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse45 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse43 (select .cse42 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse40 (select (select .cse42 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|)) (.cse41 (select .cse43 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (let ((.cse39 (store .cse42 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse43 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ (* (- 1) .cse40) .cse41))))) (= (mod (select (select .cse39 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (* 4294967295 .cse40) (* (select (select .cse39 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) (select (select .cse39 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)) .cse41) 4294967296))))))))))))) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse52 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse54 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse54 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse54 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))))) (let ((.cse53 (select .cse52 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse49 (div (mod (select .cse53 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse51 (store .cse52 |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse53 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse49)))) (let ((.cse50 (select (select .cse51 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (or (< .cse49 (+ (mod .cse50 4294967296) 1)) (= (mod (+ .cse50 (* .cse49 (select (select .cse51 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296) (mod (select (select .cse51 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296)))))))))) (< (mod (select (select .cse16 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) (* 8 (mod .cse55 536870912)))) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse77 (let ((.cse80 (select .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse80 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse80 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse78 (select (store .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse77) |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse75 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse79 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse79 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse79 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse74 (div (mod (select .cse78 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse61 (store .cse78 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse74)) (.cse76 (select .cse75 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse65 (div (mod (select .cse76 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse73 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse77) |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse61))) (let ((.cse62 (select .cse73 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|)) (.cse71 (store .cse76 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse65))) (let ((.cse64 (store .cse75 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse71)) (.cse63 (select .cse62 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) (or (not (let ((.cse59 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse61) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (store .cse62 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ .cse63 1))))) (let ((.cse60 (select .cse59 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse57 (select .cse60 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse58 (select (select .cse59 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse56 (store .cse59 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse60 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ .cse57 (* (- 1) .cse58)))))) (= (mod (select (select .cse56 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse57 (* .cse58 4294967295) (* .cse58 (select (select .cse56 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296))))))) (< (mod (select (select .cse64 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse65) (let ((.cse69 (store (store |c_#memory_int| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse71) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse72 (select .cse64 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse72 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse72 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse70 (select .cse69 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse67 (select (select .cse69 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|)) (.cse68 (select .cse70 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (let ((.cse66 (store .cse69 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse70 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ (* (- 1) .cse67) .cse68))))) (= (mod (select (select .cse66 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (* 4294967295 .cse67) (* (select (select .cse66 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) (select (select .cse66 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)) .cse68) 4294967296)))))) (not (= (mod (select (select .cse73 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (select (select .cse73 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) (* .cse63 .cse74)) 4294967296)))))))))))) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse96 (let ((.cse99 (select .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse99 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse99 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse97 (select (store .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse96) |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse94 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse98 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse98 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse98 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse93 (div (mod (select .cse97 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse86 (store .cse97 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse93)) (.cse95 (select .cse94 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse89 (div (mod (select .cse95 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse92 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse96) |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse86))) (let ((.cse87 (select .cse92 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|)) (.cse91 (store .cse94 |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse95 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse89)))) (let ((.cse90 (select (select .cse91 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse88 (select .cse87 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) (or (not (let ((.cse84 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse86) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (store .cse87 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ .cse88 1))))) (let ((.cse85 (select .cse84 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse82 (select .cse85 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse83 (select (select .cse84 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse81 (store .cse84 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse85 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ .cse82 (* (- 1) .cse83)))))) (= (mod (select (select .cse81 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse82 (* .cse83 4294967295) (* .cse83 (select (select .cse81 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296))))))) (< .cse89 (+ (mod .cse90 4294967296) 1)) (= (mod (+ .cse90 (* .cse89 (select (select .cse91 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296) (mod (select (select .cse91 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296)) (not (= (mod (select (select .cse92 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (select (select .cse92 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) (* .cse88 .cse93)) 4294967296)))))))))))) (forall ((|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse119 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse123 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse123 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse123 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse118 (let ((.cse122 (select .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse122 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse122 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse121 (select (store .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse118) |c_func_to_recursive_line_33_to_35_0_#in~b.base|)) (.cse120 (select .cse119 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse116 (div (mod (select .cse120 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse117 (div (mod (select .cse121 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse105 (store .cse121 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse117)) (.cse113 (store .cse120 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse116))) (let ((.cse115 (store .cse119 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse113)) (.cse107 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse118) |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse105))) (or (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (or (not (let ((.cse103 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse105) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse106 (select .cse107 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse106 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse106 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse104 (select .cse103 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse101 (select .cse104 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse102 (select (select .cse103 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse100 (store .cse103 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse104 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ .cse101 (* (- 1) .cse102)))))) (= (mod (select (select .cse100 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse101 (* .cse102 4294967295) (* .cse102 (select (select .cse100 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296))))))) (let ((.cse111 (store (store |c_#memory_int| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse113) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse114 (select .cse115 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse114 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse114 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse112 (select .cse111 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse109 (select (select .cse111 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|)) (.cse110 (select .cse112 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (let ((.cse108 (store .cse111 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse112 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ (* (- 1) .cse109) .cse110))))) (= (mod (select (select .cse108 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (* 4294967295 .cse109) (* (select (select .cse108 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) (select (select .cse108 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)) .cse110) 4294967296)))))))) (< (mod (select (select .cse115 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse116) (< (mod (select (select .cse107 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse117)))))))) (forall ((|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse130 (store |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse135 (select |c_#memory_int| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse135 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse135 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse132 (let ((.cse134 (select .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse134 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse134 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse133 (select (store .cse16 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse132) |c_func_to_recursive_line_33_to_35_0_#in~b.base|)) (.cse131 (select .cse130 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse125 (div (mod (select .cse131 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse129 (div (mod (select .cse133 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse127 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse132) |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse133 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse129))) (.cse126 (store .cse130 |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse131 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse125)))) (let ((.cse124 (select (select .cse126 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse128 (select (select .cse127 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (or (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (or (= (mod (+ .cse124 (* .cse125 (select (select .cse126 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296) (mod (select (select .cse126 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296)) (not (= (mod (select (select .cse127 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse128 (* (select (select .cse127 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) .cse129)) 4294967296))))) (< .cse125 (+ (mod .cse124 4294967296) 1)) (< .cse129 (+ (mod .cse128 4294967296) 1))))))))))))) is different from true [2024-11-09 05:45:24,311 WARN L286 SmtUtils]: Spent 11.72s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 05:45:34,642 WARN L286 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 05:45:47,874 WARN L286 SmtUtils]: Spent 7.75s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 05:46:01,062 WARN L286 SmtUtils]: Spent 7.54s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 05:46:10,373 WARN L286 SmtUtils]: Spent 9.31s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 05:46:17,083 WARN L286 SmtUtils]: Spent 6.71s on a formula simplification that was a NOOP. DAG size: 32 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 05:46:30,054 WARN L286 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 05:46:35,295 WARN L286 SmtUtils]: Spent 5.24s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 05:46:57,814 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse139 (select |c_#memory_int| c_func_to_recursive_line_33_to_35_0_~b.base))) (let ((.cse0 (select .cse139 c_func_to_recursive_line_33_to_35_0_~b.offset))) (let ((.cse1 (store |c_#memory_int| c_func_to_recursive_line_33_to_35_0_~b.base (store .cse139 c_func_to_recursive_line_33_to_35_0_~b.offset (* .cse0 4))))) (or (< (* (mod .cse0 1073741824) 4) (+ (mod (select (select .cse1 c_func_to_recursive_line_33_to_35_0_~r.base) c_func_to_recursive_line_33_to_35_0_~r.offset) 4294967296) 1)) (let ((.cse138 (select |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse89 (select .cse138 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse18 (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse138 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| (* 8 .cse89))))) (and (forall ((|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse14 (let ((.cse20 (select .cse18 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse20 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse20 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))) (.cse16 (store .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse19 (select .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse19 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse19 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))))) (let ((.cse17 (select .cse16 |c_func_to_recursive_line_33_to_35_0_#in~b.base|)) (.cse15 (select (store .cse18 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse14) |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse5 (div (mod (select .cse15 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse2 (div (mod (select .cse17 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse13 (store .cse16 |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse17 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse2))) (.cse11 (store .cse15 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse5))) (let ((.cse4 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse14) |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse11)) (.cse3 (select (select .cse13 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (or (< .cse2 (+ (mod .cse3 4294967296) 1)) (< (mod (select (select .cse4 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse5) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (or (not (let ((.cse9 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse11) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse12 (select .cse4 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse12 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse12 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse10 (select .cse9 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse7 (select .cse10 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse8 (select (select .cse9 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse6 (store .cse9 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse10 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ .cse7 (* (- 1) .cse8)))))) (= (mod (select (select .cse6 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse7 (* .cse8 4294967295) (* .cse8 (select (select .cse6 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296))))))) (= (mod (+ .cse3 (* .cse2 (select (select .cse13 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296) (mod (select (select .cse13 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296))))))))))) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse36 (let ((.cse39 (select .cse18 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse39 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse39 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse37 (select (store .cse18 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse36) |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse34 (store .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse38 (select .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse38 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse38 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse33 (div (mod (select .cse37 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse26 (store .cse37 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse33)) (.cse35 (select .cse34 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse29 (div (mod (select .cse35 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse32 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse36) |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse26))) (let ((.cse27 (select .cse32 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|)) (.cse31 (store .cse34 |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse35 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse29)))) (let ((.cse30 (select (select .cse31 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse28 (select .cse27 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) (or (not (let ((.cse24 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse26) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (store .cse27 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ .cse28 1))))) (let ((.cse25 (select .cse24 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse22 (select .cse25 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse23 (select (select .cse24 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse21 (store .cse24 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse25 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ .cse22 (* (- 1) .cse23)))))) (= (mod (select (select .cse21 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse22 (* .cse23 4294967295) (* .cse23 (select (select .cse21 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296))))))) (< .cse29 (+ (mod .cse30 4294967296) 1)) (= (mod (+ .cse30 (* .cse29 (select (select .cse31 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296) (mod (select (select .cse31 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296)) (not (= (mod (select (select .cse32 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (select (select .cse32 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) (* .cse28 .cse33)) 4294967296)))))))))))) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse61 (let ((.cse64 (select .cse18 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse64 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse64 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse62 (select (store .cse18 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse61) |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse59 (store .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse63 (select .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse63 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse63 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse58 (div (mod (select .cse62 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse45 (store .cse62 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse58)) (.cse60 (select .cse59 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse49 (div (mod (select .cse60 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse57 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse61) |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse45))) (let ((.cse46 (select .cse57 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|)) (.cse55 (store .cse60 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse49))) (let ((.cse48 (store .cse59 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse55)) (.cse47 (select .cse46 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) (or (not (let ((.cse43 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse45) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (store .cse46 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ .cse47 1))))) (let ((.cse44 (select .cse43 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse41 (select .cse44 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse42 (select (select .cse43 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse40 (store .cse43 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse44 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ .cse41 (* (- 1) .cse42)))))) (= (mod (select (select .cse40 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse41 (* .cse42 4294967295) (* .cse42 (select (select .cse40 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296))))))) (< (mod (select (select .cse48 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse49) (let ((.cse53 (store (store .cse1 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse55) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse56 (select .cse48 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse56 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse56 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse54 (select .cse53 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse51 (select (select .cse53 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|)) (.cse52 (select .cse54 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (let ((.cse50 (store .cse53 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse54 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ (* (- 1) .cse51) .cse52))))) (= (mod (select (select .cse50 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (* (select (select .cse50 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) (select (select .cse50 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)) (* 4294967295 .cse51) .cse52) 4294967296)))))) (not (= (mod (select (select .cse57 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (select (select .cse57 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) (* .cse47 .cse58)) 4294967296)))))))))))) (forall ((|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse84 (let ((.cse88 (select .cse18 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse88 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse88 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))) (.cse83 (store .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse87 (select .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse87 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse87 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))))) (let ((.cse86 (select .cse83 |c_func_to_recursive_line_33_to_35_0_#in~b.base|)) (.cse85 (select (store .cse18 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse84) |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse68 (div (mod (select .cse85 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse66 (div (mod (select .cse86 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse81 (store .cse86 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse66)) (.cse74 (store .cse85 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse68))) (let ((.cse67 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse84) |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse74)) (.cse65 (store .cse83 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse81))) (or (< (mod (select (select .cse65 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse66) (< (mod (select (select .cse67 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse68) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (or (not (let ((.cse72 (store (store |c_old(#memory_int)| |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse74) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse75 (select .cse67 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse75 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse75 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse73 (select .cse72 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse70 (select .cse73 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse71 (select (select .cse72 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|))) (let ((.cse69 (store .cse72 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse73 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ .cse70 (* (- 1) .cse71)))))) (= (mod (select (select .cse69 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse70 (* .cse71 4294967295) (* .cse71 (select (select .cse69 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296))))))) (let ((.cse79 (store (store .cse1 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse81) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse82 (select .cse65 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse82 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse82 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse80 (select .cse79 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse77 (select (select .cse79 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|)) (.cse78 (select .cse80 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (let ((.cse76 (store .cse79 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse80 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ (* (- 1) .cse77) .cse78))))) (= (mod (select (select .cse76 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (* (select (select .cse76 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) (select (select .cse76 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)) (* 4294967295 .cse77) .cse78) 4294967296))))))))))))))) (or (< (mod (select (select .cse18 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) (* 8 (mod .cse89 536870912))) (and (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse99 (store .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse101 (select .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse101 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse101 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))))) (let ((.cse100 (select .cse99 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse91 (div (mod (select .cse100 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse97 (store .cse100 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse91))) (let ((.cse90 (store .cse99 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse97))) (or (< (mod (select (select .cse90 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse91) (let ((.cse95 (store (store .cse1 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse97) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse98 (select .cse90 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse98 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse98 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse96 (select .cse95 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse93 (select (select .cse95 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|)) (.cse94 (select .cse96 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (let ((.cse92 (store .cse95 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse96 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ (* (- 1) .cse93) .cse94))))) (= (mod (select (select .cse92 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ (* (select (select .cse92 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) (select (select .cse92 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)) (* 4294967295 .cse93) .cse94) 4294967296))))))))))))) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse105 (store .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse107 (select .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse107 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse107 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))))))) (let ((.cse106 (select .cse105 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse102 (div (mod (select .cse106 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse104 (store .cse105 |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse106 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse102)))) (let ((.cse103 (select (select .cse104 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (or (< .cse102 (+ (mod .cse103 4294967296) 1)) (= (mod (+ .cse103 (* .cse102 (select (select .cse104 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296) (mod (select (select .cse104 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296))))))))))) (forall ((|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse120 (store .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse125 (select .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse125 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse125 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse122 (let ((.cse124 (select .cse18 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse124 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse124 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse123 (select (store .cse18 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse122) |c_func_to_recursive_line_33_to_35_0_#in~b.base|)) (.cse121 (select .cse120 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse109 (div (mod (select .cse121 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse119 (div (mod (select .cse123 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse117 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse122) |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse123 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse119))) (.cse115 (store .cse121 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse109))) (let ((.cse108 (store .cse120 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse115)) (.cse118 (select (select .cse117 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (or (< (mod (select (select .cse108 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|) 4294967296) .cse109) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (or (let ((.cse113 (store (store .cse1 |c_func_to_recursive_line_33_to_35_0_#in~b.base| .cse115) |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse116 (select .cse108 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse116 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (+ (select .cse116 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) 1)))))) (let ((.cse114 (select .cse113 |c_func_to_recursive_line_33_to_35_0_#in~r.base|))) (let ((.cse110 (select (select .cse113 |c_func_to_recursive_line_33_to_35_0_#in~b.base|) |c_func_to_recursive_line_33_to_35_0_#in~b.offset|)) (.cse112 (select .cse114 |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (let ((.cse111 (store .cse113 |c_func_to_recursive_line_33_to_35_0_#in~r.base| (store .cse114 |c_func_to_recursive_line_33_to_35_0_#in~r.offset| (+ (* (- 1) .cse110) .cse112))))) (= (mod (+ (* .cse110 (select (select .cse111 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)) (* 4294967295 .cse110) .cse112) 4294967296) (mod (select (select .cse111 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296)))))) (not (= (mod (select (select .cse117 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse118 (* (select (select .cse117 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) .cse119)) 4294967296))))) (< .cse119 (+ (mod .cse118 4294967296) 1))))))))) (forall ((|v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| Int)) (let ((.cse132 (store .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| (let ((.cse137 (select .cse1 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse137 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse137 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (.cse134 (let ((.cse136 (select .cse18 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|))) (store .cse136 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23| (* 2 (select .cse136 |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|)))))) (let ((.cse135 (select (store .cse18 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse134) |c_func_to_recursive_line_33_to_35_0_#in~b.base|)) (.cse133 (select .cse132 |c_func_to_recursive_line_33_to_35_0_#in~b.base|))) (let ((.cse126 (div (mod (select .cse133 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2)) (.cse131 (div (mod (select .cse135 |c_func_to_recursive_line_33_to_35_0_#in~b.offset|) 4294967296) 2))) (let ((.cse129 (store (store |c_old(#memory_int)| |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24| .cse134) |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse135 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse131))) (.cse128 (store .cse132 |c_func_to_recursive_line_33_to_35_0_#in~b.base| (store .cse133 |c_func_to_recursive_line_33_to_35_0_#in~b.offset| .cse126)))) (let ((.cse127 (select (select .cse128 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|)) (.cse130 (select (select .cse129 |c_func_to_recursive_line_33_to_35_0_#in~r.base|) |c_func_to_recursive_line_33_to_35_0_#in~r.offset|))) (or (< .cse126 (+ (mod .cse127 4294967296) 1)) (forall ((|v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23| Int) (|v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24| Int)) (or (= (mod (+ .cse127 (* .cse126 (select (select .cse128 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|))) 4294967296) (mod (select (select .cse128 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296)) (not (= (mod (select (select .cse129 |v_ULTIMATE.start_main_~#A~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#A~0#1.offset_BEFORE_CALL_23|) 4294967296) (mod (+ .cse130 (* (select (select .cse129 |v_ULTIMATE.start_main_~#q~0#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_main_~#q~0#1.offset_BEFORE_CALL_23|) .cse131)) 4294967296))))) (< .cse131 (+ (mod .cse130 4294967296) 1))))))))))))))))) is different from true [2024-11-09 05:46:57,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:46:57,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5325218] [2024-11-09 05:46:57,819 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:46:57,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182665886] [2024-11-09 05:46:57,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182665886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:46:57,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1291826813] [2024-11-09 05:46:57,821 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2024-11-09 05:46:57,821 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:46:57,821 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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) 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-09 05:46:57,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:46:57,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2024-11-09 05:46:57,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76882057] [2024-11-09 05:46:57,822 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 05:46:57,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 05:46:57,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:46:57,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 05:46:57,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=730, Unknown=10, NotChecked=110, Total=930 [2024-11-09 05:46:57,824 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 20 states, 16 states have (on average 1.375) internal successors, (22), 14 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 05:47:14,302 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-09 05:47:25,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-09 05:47:29,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:47:32,815 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-09 05:47:35,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:47:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:47:35,436 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2024-11-09 05:47:35,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 05:47:35,437 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.375) internal successors, (22), 14 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2024-11-09 05:47:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:47:35,438 INFO L225 Difference]: With dead ends: 100 [2024-11-09 05:47:35,438 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 05:47:35,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 88.2s TimeCoverageRelationStatistics Valid=159, Invalid=1398, Unknown=11, NotChecked=154, Total=1722 [2024-11-09 05:47:35,440 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 41 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 12 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:47:35,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 217 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 841 Invalid, 5 Unknown, 0 Unchecked, 20.3s Time] [2024-11-09 05:47:35,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 05:47:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-09 05:47:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 60 states have (on average 1.1) internal successors, (66), 63 states have internal predecessors, (66), 16 states have call successors, (16), 14 states have call predecessors, (16), 17 states have return successors, (27), 16 states have call predecessors, (27), 14 states have call successors, (27) [2024-11-09 05:47:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2024-11-09 05:47:35,497 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 42 [2024-11-09 05:47:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:47:35,498 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2024-11-09 05:47:35,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.375) internal successors, (22), 14 states have internal predecessors, (22), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 05:47:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2024-11-09 05:47:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 05:47:35,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:47:35,499 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:47:35,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 05:47:35,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:47:35,704 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:47:35,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:47:35,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2088635956, now seen corresponding path program 1 times [2024-11-09 05:47:35,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:47:35,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407303536] [2024-11-09 05:47:35,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:47:35,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:47:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:47:43,186 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 05:47:43,186 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:47:43,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407303536] [2024-11-09 05:47:43,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407303536] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:47:43,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171767967] [2024-11-09 05:47:43,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:47:43,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:47:43,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:47:43,189 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:47:43,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 05:47:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:47:43,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 84 conjuncts are in the unsatisfiable core [2024-11-09 05:47:43,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:47:43,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:47:43,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:47:43,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:47:43,925 INFO L349 Elim1Store]: treesize reduction 40, result has 35.5 percent of original size [2024-11-09 05:47:43,925 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 1 case distinctions, treesize of input 129 treesize of output 54 [2024-11-09 05:47:43,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:47:43,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:47:43,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:47:44,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:47:44,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:47:44,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:47:44,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:47:44,176 INFO L224 Elim1Store]: Index analysis took 213 ms [2024-11-09 05:47:44,587 INFO L349 Elim1Store]: treesize reduction 42, result has 33.3 percent of original size [2024-11-09 05:47:44,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 74 [2024-11-09 05:47:44,856 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2024-11-09 05:47:44,856 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 137 treesize of output 127 [2024-11-09 05:47:45,509 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 7 [2024-11-09 05:47:47,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-09 05:47:49,556 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 05:47:49,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:47:58,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171767967] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:47:58,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1356014375] [2024-11-09 05:47:58,522 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 05:47:58,522 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:47:58,523 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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) 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-09 05:47:58,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:47:58,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 26 [2024-11-09 05:47:58,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011598796] [2024-11-09 05:47:58,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:47:58,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 05:47:58,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:47:58,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 05:47:58,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 05:47:58,526 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand has 26 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 24 states have internal predecessors, (37), 11 states have call successors, (11), 3 states have call predecessors, (11), 10 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-09 05:48:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:10,354 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2024-11-09 05:48:10,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 05:48:10,355 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 24 states have internal predecessors, (37), 11 states have call successors, (11), 3 states have call predecessors, (11), 10 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) Word has length 42 [2024-11-09 05:48:10,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:10,357 INFO L225 Difference]: With dead ends: 110 [2024-11-09 05:48:10,357 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 05:48:10,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=215, Invalid=1855, Unknown=0, NotChecked=0, Total=2070 [2024-11-09 05:48:10,358 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:10,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 235 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-09 05:48:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 05:48:10,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2024-11-09 05:48:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 64 states have internal predecessors, (66), 16 states have call successors, (16), 14 states have call predecessors, (16), 18 states have return successors, (28), 17 states have call predecessors, (28), 15 states have call successors, (28) [2024-11-09 05:48:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 110 transitions. [2024-11-09 05:48:10,406 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 110 transitions. Word has length 42 [2024-11-09 05:48:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:10,407 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 110 transitions. [2024-11-09 05:48:10,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 24 states have internal predecessors, (37), 11 states have call successors, (11), 3 states have call predecessors, (11), 10 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-09 05:48:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 110 transitions. [2024-11-09 05:48:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 05:48:10,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:10,408 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:10,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 05:48:10,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 05:48:10,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:48:10,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash -182537388, now seen corresponding path program 4 times [2024-11-09 05:48:10,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:48:10,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20571807] [2024-11-09 05:48:10,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:10,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:48:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:12,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:48:12,280 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:395) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:871) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:795) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:343) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:207) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:225) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) 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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) 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-09 05:48:12,282 INFO L158 Benchmark]: Toolchain (without parser) took 828719.72ms. Allocated memory was 132.1MB in the beginning and 371.2MB in the end (delta: 239.1MB). Free memory was 99.9MB in the beginning and 196.5MB in the end (delta: -96.7MB). Peak memory consumption was 233.0MB. Max. memory is 16.1GB. [2024-11-09 05:48:12,282 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 132.1MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:48:12,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.68ms. Allocated memory is still 132.1MB. Free memory was 99.5MB in the beginning and 86.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-09 05:48:12,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.51ms. Allocated memory is still 132.1MB. Free memory was 86.4MB in the beginning and 84.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 05:48:12,284 INFO L158 Benchmark]: Boogie Preprocessor took 30.79ms. Allocated memory is still 132.1MB. Free memory was 84.9MB in the beginning and 83.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 05:48:12,284 INFO L158 Benchmark]: RCFGBuilder took 553.06ms. Allocated memory is still 132.1MB. Free memory was 83.3MB in the beginning and 65.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 05:48:12,284 INFO L158 Benchmark]: TraceAbstraction took 827712.29ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 146.6MB in the beginning and 196.5MB in the end (delta: -49.9MB). Peak memory consumption was 232.6MB. Max. memory is 16.1GB. [2024-11-09 05:48:12,289 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36ms. Allocated memory is still 132.1MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.68ms. Allocated memory is still 132.1MB. Free memory was 99.5MB in the beginning and 86.7MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.51ms. Allocated memory is still 132.1MB. Free memory was 86.4MB in the beginning and 84.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.79ms. Allocated memory is still 132.1MB. Free memory was 84.9MB in the beginning and 83.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 553.06ms. Allocated memory is still 132.1MB. Free memory was 83.3MB in the beginning and 65.9MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 827712.29ms. Allocated memory was 176.2MB in the beginning and 371.2MB in the end (delta: 195.0MB). Free memory was 146.6MB in the beginning and 196.5MB in the end (delta: -49.9MB). Peak memory consumption was 232.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.InterpolantChecker.checkInductivity(InterpolantChecker.java:409) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-11-09 05:48:12,503 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-11-09 05:48:12,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_nla-digbench/recursified_divbin2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 07d2bb25a1c8c4ef92611e8b25e211f661495bf054d1380ec62ffea892b45c2f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:48:14,829 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:48:14,924 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2024-11-09 05:48:14,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:48:14,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:48:14,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:48:14,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:48:14,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:48:14,982 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:48:14,984 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:48:14,984 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:48:14,985 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:48:14,985 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:48:14,985 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:48:14,988 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:48:14,988 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:48:14,989 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:48:14,989 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:48:14,990 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:48:14,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:48:14,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:48:14,994 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:48:14,994 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:48:14,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:48:14,995 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 05:48:14,996 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 05:48:14,996 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:48:14,996 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 05:48:14,997 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:48:14,997 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:48:14,997 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:48:14,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:48:14,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 05:48:14,998 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:48:14,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:48:15,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:48:15,000 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:48:15,000 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:48:15,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:48:15,002 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 05:48:15,002 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 05:48:15,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:48:15,004 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:48:15,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 07d2bb25a1c8c4ef92611e8b25e211f661495bf054d1380ec62ffea892b45c2f [2024-11-09 05:48:15,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:48:15,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:48:15,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:48:15,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:48:15,435 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:48:15,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/recursified_nla-digbench/recursified_divbin2.i Unable to find full path for "g++" [2024-11-09 05:48:17,596 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:48:17,824 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:48:17,825 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/sv-benchmarks/c/recursified_nla-digbench/recursified_divbin2.i [2024-11-09 05:48:17,836 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/data/86f1d90a7/23d2f155a1b44bcdb505ef137bab44d3/FLAG611b3d58c [2024-11-09 05:48:17,850 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/data/86f1d90a7/23d2f155a1b44bcdb505ef137bab44d3 [2024-11-09 05:48:17,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:48:17,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:48:17,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:48:17,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:48:17,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:48:17,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,863 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fbd43e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:17, skipping insertion in model container [2024-11-09 05:48:17,863 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:48:17" (1/1) ... [2024-11-09 05:48:17,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:48:18,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/sv-benchmarks/c/recursified_nla-digbench/recursified_divbin2.i[1567,1580] [2024-11-09 05:48:18,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:48:18,138 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:48:18,153 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/sv-benchmarks/c/recursified_nla-digbench/recursified_divbin2.i[1567,1580] [2024-11-09 05:48:18,163 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:48:18,183 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:48:18,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18 WrapperNode [2024-11-09 05:48:18,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:48:18,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:48:18,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:48:18,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:48:18,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18" (1/1) ... [2024-11-09 05:48:18,204 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18" (1/1) ... [2024-11-09 05:48:18,224 INFO L138 Inliner]: procedures = 21, calls = 59, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2024-11-09 05:48:18,226 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:48:18,227 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:48:18,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:48:18,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:48:18,238 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18" (1/1) ... [2024-11-09 05:48:18,238 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18" (1/1) ... [2024-11-09 05:48:18,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18" (1/1) ... [2024-11-09 05:48:18,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18" (1/1) ... [2024-11-09 05:48:18,255 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18" (1/1) ... [2024-11-09 05:48:18,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18" (1/1) ... [2024-11-09 05:48:18,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18" (1/1) ... [2024-11-09 05:48:18,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18" (1/1) ... [2024-11-09 05:48:18,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:48:18,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:48:18,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:48:18,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:48:18,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18" (1/1) ... [2024-11-09 05:48:18,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:48:18,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:48:18,311 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:48:18,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:48:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:48:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 05:48:18,347 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_33_to_35_0 [2024-11-09 05:48:18,348 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_33_to_35_0 [2024-11-09 05:48:18,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:48:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 05:48:18,349 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_37_to_44_0 [2024-11-09 05:48:18,349 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_37_to_44_0 [2024-11-09 05:48:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:48:18,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:48:18,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 05:48:18,351 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 05:48:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:48:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 05:48:18,465 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:48:18,468 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:48:18,819 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-09 05:48:18,819 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:48:18,834 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:48:18,835 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 05:48:18,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:48:18 BoogieIcfgContainer [2024-11-09 05:48:18,837 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:48:18,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:48:18,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:48:18,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:48:18,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:48:17" (1/3) ... [2024-11-09 05:48:18,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dca06ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:48:18, skipping insertion in model container [2024-11-09 05:48:18,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:48:18" (2/3) ... [2024-11-09 05:48:18,851 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dca06ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:48:18, skipping insertion in model container [2024-11-09 05:48:18,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:48:18" (3/3) ... [2024-11-09 05:48:18,853 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_divbin2.i [2024-11-09 05:48:18,874 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:48:18,874 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 05:48:18,964 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:48:18,973 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=LoopHeads, 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;@491dbfa4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:48:18,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 05:48:18,979 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 05:48:18,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 05:48:18,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:18,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:18,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:48:18,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:18,997 INFO L85 PathProgramCache]: Analyzing trace with hash -645284700, now seen corresponding path program 1 times [2024-11-09 05:48:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:48:19,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1774730983] [2024-11-09 05:48:19,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:19,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:48:19,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:48:19,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:48:19,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 05:48:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:19,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 05:48:19,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:19,210 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:48:19,210 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:48:19,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1774730983] [2024-11-09 05:48:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1774730983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:19,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:48:19,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 05:48:19,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693697176] [2024-11-09 05:48:19,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:19,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 05:48:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:48:19,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 05:48:19,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 05:48:19,245 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:48:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:19,269 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2024-11-09 05:48:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 05:48:19,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-09 05:48:19,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:19,282 INFO L225 Difference]: With dead ends: 55 [2024-11-09 05:48:19,282 INFO L226 Difference]: Without dead ends: 27 [2024-11-09 05:48:19,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 05:48:19,292 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:19,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 05:48:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-09 05:48:19,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-09 05:48:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 05:48:19,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-09 05:48:19,338 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 14 [2024-11-09 05:48:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:19,340 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-09 05:48:19,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:48:19,341 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-09 05:48:19,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 05:48:19,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:19,344 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:48:19,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 05:48:19,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:48:19,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:48:19,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:19,546 INFO L85 PathProgramCache]: Analyzing trace with hash 319138013, now seen corresponding path program 1 times [2024-11-09 05:48:19,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:48:19,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307981392] [2024-11-09 05:48:19,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:19,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:48:19,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:48:19,551 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:48:19,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 05:48:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:19,780 WARN L253 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 05:48:19,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:20,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:20,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 33 [2024-11-09 05:48:20,230 INFO L349 Elim1Store]: treesize reduction 60, result has 1.6 percent of original size [2024-11-09 05:48:20,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 53 [2024-11-09 05:48:20,399 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:20,400 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:20,401 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:20,402 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:20,403 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:20,412 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:48:20,441 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:20,444 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:20,445 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:20,448 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:20,456 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:48:20,474 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:20,475 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:20,476 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:20,485 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:48:22,117 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 05:48:22,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 27 [2024-11-09 05:48:22,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:48:22,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:48:22,279 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:48:22,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307981392] [2024-11-09 05:48:22,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307981392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:48:22,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:48:22,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 05:48:22,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677031356] [2024-11-09 05:48:22,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:48:22,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 05:48:22,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 05:48:22,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 05:48:22,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-11-09 05:48:22,284 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 13 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:48:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:48:25,779 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2024-11-09 05:48:25,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 05:48:25,781 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2024-11-09 05:48:25,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:48:25,784 INFO L225 Difference]: With dead ends: 46 [2024-11-09 05:48:25,784 INFO L226 Difference]: Without dead ends: 44 [2024-11-09 05:48:25,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2024-11-09 05:48:25,787 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 05:48:25,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 103 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 05:48:25,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-09 05:48:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-11-09 05:48:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (12), 7 states have call predecessors, (12), 7 states have call successors, (12) [2024-11-09 05:48:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-11-09 05:48:25,807 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 15 [2024-11-09 05:48:25,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:48:25,807 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-11-09 05:48:25,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:48:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-11-09 05:48:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:48:25,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:48:25,809 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-09 05:48:25,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-09 05:48:26,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:48:26,010 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 05:48:26,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:48:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1120230116, now seen corresponding path program 1 times [2024-11-09 05:48:26,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 05:48:26,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452765788] [2024-11-09 05:48:26,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:26,012 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 05:48:26,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 05:48:26,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 05:48:26,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 05:48:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:26,243 WARN L253 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-09 05:48:26,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:26,311 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:26,313 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:26,315 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:26,322 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:48:26,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 33 [2024-11-09 05:48:26,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:26,504 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-11-09 05:48:26,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 41 [2024-11-09 05:48:26,600 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:26,601 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:26,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:26,607 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:48:26,615 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:26,615 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:26,616 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:26,620 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:48:27,560 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 05:48:27,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 51 [2024-11-09 05:48:28,634 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-09 05:48:28,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 38 [2024-11-09 05:48:28,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:48:28,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:48:31,686 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 05:48:31,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452765788] [2024-11-09 05:48:31,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452765788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:48:31,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1638576948] [2024-11-09 05:48:31,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:48:31,687 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 05:48:31,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 05:48:31,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 05:48:31,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1839b83a-a133-4caf-86f0-c166f5ee8cf7/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-09 05:48:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:48:31,980 WARN L253 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 05:48:31,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:48:32,033 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:32,034 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:32,035 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:32,041 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:48:32,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:32,052 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:32,053 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:32,061 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:48:32,071 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:32,071 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:32,072 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:48:32,078 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:48:32,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 323 treesize of output 33 [2024-11-09 05:48:32,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:32,244 INFO L349 Elim1Store]: treesize reduction 50, result has 2.0 percent of original size [2024-11-09 05:48:32,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 37 [2024-11-09 05:48:33,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:48:33,065 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 05:48:33,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 51 [2024-11-09 05:48:34,213 INFO L349 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2024-11-09 05:48:34,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 46 [2024-11-09 05:48:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 05:48:34,380 INFO L311 TraceCheckSpWp]: Computing backward predicates...