./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff 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_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3d10641017a78060218b50f4d70d792898ed2d8ba6a3470f582f96f045a08878 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:35:30,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:35:31,047 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:35:31,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:35:31,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:35:31,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:35:31,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:35:31,085 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:35:31,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:35:31,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:35:31,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:35:31,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:35:31,089 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:35:31,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:35:31,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:35:31,090 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:35:31,091 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:35:31,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:35:31,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:35:31,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:35:31,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:35:31,094 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:35:31,094 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:35:31,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:35:31,095 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:35:31,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:35:31,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:35:31,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:35:31,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:35:31,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:35:31,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:35:31,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:35:31,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:35:31,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:35:31,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:35:31,100 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:35:31,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:35:31,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:35:31,100 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:35:31,101 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/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_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu 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 -> Automizer 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 -> 3d10641017a78060218b50f4d70d792898ed2d8ba6a3470f582f96f045a08878 [2023-11-19 07:35:31,402 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:35:31,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:35:31,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:35:31,438 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:35:31,438 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:35:31,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c [2023-11-19 07:35:34,661 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:35:34,879 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:35:34,880 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c [2023-11-19 07:35:34,888 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/data/026bafdd2/5bdceeffe1fb48a48a9bef7715c03a82/FLAG907f9292b [2023-11-19 07:35:34,903 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/data/026bafdd2/5bdceeffe1fb48a48a9bef7715c03a82 [2023-11-19 07:35:34,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:35:34,907 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:35:34,908 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:35:34,909 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:35:34,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:35:34,924 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:34" (1/1) ... [2023-11-19 07:35:34,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f48366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:34, skipping insertion in model container [2023-11-19 07:35:34,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:34" (1/1) ... [2023-11-19 07:35:34,945 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:35:35,115 WARN L240 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_334e2f94-c995-46be-ba02-484f61c71c26/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c[1113,1126] [2023-11-19 07:35:35,141 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:35:35,154 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:35:35,168 WARN L240 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_334e2f94-c995-46be-ba02-484f61c71c26/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_1.c[1113,1126] [2023-11-19 07:35:35,178 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:35:35,194 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:35:35,195 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35 WrapperNode [2023-11-19 07:35:35,195 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:35:35,196 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:35:35,197 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:35:35,197 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:35:35,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35" (1/1) ... [2023-11-19 07:35:35,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35" (1/1) ... [2023-11-19 07:35:35,237 INFO L138 Inliner]: procedures = 14, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2023-11-19 07:35:35,238 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:35:35,239 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:35:35,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:35:35,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:35:35,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35" (1/1) ... [2023-11-19 07:35:35,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35" (1/1) ... [2023-11-19 07:35:35,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35" (1/1) ... [2023-11-19 07:35:35,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35" (1/1) ... [2023-11-19 07:35:35,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35" (1/1) ... [2023-11-19 07:35:35,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35" (1/1) ... [2023-11-19 07:35:35,277 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35" (1/1) ... [2023-11-19 07:35:35,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35" (1/1) ... [2023-11-19 07:35:35,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:35:35,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:35:35,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:35:35,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:35:35,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35" (1/1) ... [2023-11-19 07:35:35,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:35:35,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:35,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:35:35,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:35:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:35:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:35:35,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:35:35,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:35:35,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:35:35,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:35:35,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:35:35,376 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_25_0 [2023-11-19 07:35:35,376 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_25_0 [2023-11-19 07:35:35,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:35:35,466 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:35:35,469 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:35:35,630 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:35:35,637 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:35:35,638 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:35:35,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:35 BoogieIcfgContainer [2023-11-19 07:35:35,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:35:35,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:35:35,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:35:35,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:35:35,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:35:34" (1/3) ... [2023-11-19 07:35:35,656 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f6f96f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:35, skipping insertion in model container [2023-11-19 07:35:35,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:35" (2/3) ... [2023-11-19 07:35:35,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f6f96f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:35, skipping insertion in model container [2023-11-19 07:35:35,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:35" (3/3) ... [2023-11-19 07:35:35,660 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_vardep_1.c [2023-11-19 07:35:35,680 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:35:35,681 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:35:35,729 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:35:35,737 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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;@6ec40050, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:35:35,737 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:35:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:35:35,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-19 07:35:35,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:35,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:35,750 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:35,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:35,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1826176574, now seen corresponding path program 1 times [2023-11-19 07:35:35,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:35,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425119500] [2023-11-19 07:35:35,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:35,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:35,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:37,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:37,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:37,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425119500] [2023-11-19 07:35:37,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425119500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:37,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:37,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:35:37,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181394221] [2023-11-19 07:35:37,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:37,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:35:37,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:37,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:35:37,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:35:37,392 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:37,603 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2023-11-19 07:35:37,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:35:37,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-19 07:35:37,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:37,613 INFO L225 Difference]: With dead ends: 35 [2023-11-19 07:35:37,614 INFO L226 Difference]: Without dead ends: 13 [2023-11-19 07:35:37,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:35:37,622 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:37,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 47 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:35:37,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-11-19 07:35:37,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-11-19 07:35:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:37,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2023-11-19 07:35:37,662 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2023-11-19 07:35:37,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:37,662 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2023-11-19 07:35:37,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:37,663 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2023-11-19 07:35:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 07:35:37,664 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:37,664 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:37,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:35:37,665 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:37,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:37,666 INFO L85 PathProgramCache]: Analyzing trace with hash -42941532, now seen corresponding path program 1 times [2023-11-19 07:35:37,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:37,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096145637] [2023-11-19 07:35:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:37,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:39,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:39,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096145637] [2023-11-19 07:35:39,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096145637] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:39,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679714048] [2023-11-19 07:35:39,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:39,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:39,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:39,552 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:35:39,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:35:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,172 WARN L260 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-19 07:35:40,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:40,296 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:35:40,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-19 07:35:40,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:40,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:40,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:40,740 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 99 treesize of output 35 [2023-11-19 07:35:41,131 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-19 07:35:41,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 4418 treesize of output 3370 [2023-11-19 07:35:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:41,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:35:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:42,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679714048] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:35:42,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:35:42,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 21 [2023-11-19 07:35:42,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322679020] [2023-11-19 07:35:42,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:35:42,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-19 07:35:42,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:42,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-19 07:35:42,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2023-11-19 07:35:42,507 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 21 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 15 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:44,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:44,992 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2023-11-19 07:35:44,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-19 07:35:44,993 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 15 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-19 07:35:44,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:44,994 INFO L225 Difference]: With dead ends: 26 [2023-11-19 07:35:44,994 INFO L226 Difference]: Without dead ends: 24 [2023-11-19 07:35:44,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2023-11-19 07:35:44,997 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:44,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 54 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-19 07:35:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-19 07:35:45,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-11-19 07:35:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2023-11-19 07:35:45,010 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2023-11-19 07:35:45,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:45,010 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2023-11-19 07:35:45,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 15 states have internal predecessors, (25), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:45,011 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2023-11-19 07:35:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 07:35:45,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:45,012 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2023-11-19 07:35:45,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:35:45,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:45,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_25_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:35:45,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash -106484764, now seen corresponding path program 2 times [2023-11-19 07:35:45,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:45,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807318564] [2023-11-19 07:35:45,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-19 07:35:48,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807318564] [2023-11-19 07:35:48,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807318564] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:48,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456456755] [2023-11-19 07:35:48,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:35:48,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:48,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:48,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:35:48,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_334e2f94-c995-46be-ba02-484f61c71c26/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:35:48,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:35:48,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:35:48,889 WARN L260 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 163 conjunts are in the unsatisfiable core [2023-11-19 07:35:48,898 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:48,924 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:35:48,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-19 07:35:49,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:49,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 31 [2023-11-19 07:35:49,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-19 07:35:49,365 INFO L349 Elim1Store]: treesize reduction 42, result has 26.3 percent of original size [2023-11-19 07:35:49,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 95 treesize of output 76 [2023-11-19 07:35:49,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:49,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:49,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 67 [2023-11-19 07:35:49,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:49,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:49,400 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:35:49,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 62 [2023-11-19 07:35:49,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:49,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:49,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2023-11-19 07:35:49,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:49,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:49,746 INFO L349 Elim1Store]: treesize reduction 42, result has 26.3 percent of original size [2023-11-19 07:35:49,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 167 treesize of output 89 [2023-11-19 07:35:49,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:49,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:49,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2023-11-19 07:35:49,816 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 9 treesize of output 7 [2023-11-19 07:35:50,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:50,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:35:50,176 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:35:50,177 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 220 treesize of output 164 [2023-11-19 07:35:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:50,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:36:12,005 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_127 (Array Int Int)) (v_ArrVal_131 (Array Int Int)) (|func_to_recursive_line_20_to_25_0_~k#1.offset| Int)) (let ((.cse21 (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_~i#1.base| (let ((.cse23 (select |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_~i#1.base|))) (store .cse23 |c_func_to_recursive_line_20_to_25_0_~i#1.offset| (+ (select .cse23 |c_func_to_recursive_line_20_to_25_0_~i#1.offset|) 1)))))) (let ((.cse19 (let ((.cse22 (select .cse21 |c_func_to_recursive_line_20_to_25_0_~j#1.base|))) (store .cse22 |c_func_to_recursive_line_20_to_25_0_~j#1.offset| (+ 2 (select .cse22 |c_func_to_recursive_line_20_to_25_0_~j#1.offset|)))))) (let ((.cse17 (let ((.cse20 (select (store (store .cse21 |c_func_to_recursive_line_20_to_25_0_~j#1.base| .cse19) |c_func_to_recursive_line_20_to_25_0_~k#1.base| v_ArrVal_127) |c_func_to_recursive_line_20_to_25_0_~i#1.base|))) (store .cse20 |c_func_to_recursive_line_20_to_25_0_~i#1.offset| (+ (select .cse20 |c_func_to_recursive_line_20_to_25_0_~i#1.offset|) 1))))) (let ((.cse15 (let ((.cse18 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_~j#1.base| .cse19) |c_func_to_recursive_line_20_to_25_0_~k#1.base| v_ArrVal_127) |c_func_to_recursive_line_20_to_25_0_~i#1.base| .cse17) |c_func_to_recursive_line_20_to_25_0_~j#1.base|))) (store .cse18 |c_func_to_recursive_line_20_to_25_0_~j#1.offset| (+ 2 (select .cse18 |c_func_to_recursive_line_20_to_25_0_~j#1.offset|)))))) (let ((.cse12 (let ((.cse16 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_~i#1.base| .cse17) |c_func_to_recursive_line_20_to_25_0_~j#1.base| .cse15) |c_func_to_recursive_line_20_to_25_0_~k#1.base| v_ArrVal_131) |c_func_to_recursive_line_20_to_25_0_~i#1.base|))) (store .cse16 |c_func_to_recursive_line_20_to_25_0_~i#1.offset| (+ (select .cse16 |c_func_to_recursive_line_20_to_25_0_~i#1.offset|) 1))))) (let ((.cse10 (let ((.cse14 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_~j#1.base| .cse15) |c_func_to_recursive_line_20_to_25_0_~k#1.base| v_ArrVal_131) |c_func_to_recursive_line_20_to_25_0_~i#1.base| .cse12) |c_func_to_recursive_line_20_to_25_0_~j#1.base|))) (store .cse14 |c_func_to_recursive_line_20_to_25_0_~j#1.offset| (+ 2 (select .cse14 |c_func_to_recursive_line_20_to_25_0_~j#1.offset|)))))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_~k#1.base| v_ArrVal_131) |c_func_to_recursive_line_20_to_25_0_~i#1.base| .cse12) |c_func_to_recursive_line_20_to_25_0_~j#1.base| .cse10) |c_func_to_recursive_line_20_to_25_0_~k#1.base|))) (let ((.cse2 (+ 3 (select .cse13 |func_to_recursive_line_20_to_25_0_~k#1.offset|)))) (let ((.cse8 (store .cse13 |func_to_recursive_line_20_to_25_0_~k#1.offset| .cse2))) (let ((.cse0 (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_~i#1.base| .cse12) |c_func_to_recursive_line_20_to_25_0_~j#1.base| .cse10) |c_func_to_recursive_line_20_to_25_0_~k#1.base| .cse8))) (let ((.cse11 (select .cse0 |c_func_to_recursive_line_20_to_25_0_~i#1.base|))) (let ((.cse1 (select .cse11 |c_func_to_recursive_line_20_to_25_0_~i#1.offset|))) (or (not (= (mod (+ (select (select .cse0 |c_func_to_recursive_line_20_to_25_0_~j#1.base|) |c_func_to_recursive_line_20_to_25_0_~j#1.offset|) .cse1) 4294967296) (mod .cse2 4294967296))) (let ((.cse5 (store .cse11 |c_func_to_recursive_line_20_to_25_0_~i#1.offset| (+ .cse1 1)))) (let ((.cse6 (let ((.cse9 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_~j#1.base| .cse10) |c_func_to_recursive_line_20_to_25_0_~k#1.base| .cse8) |c_func_to_recursive_line_20_to_25_0_~i#1.base| .cse5) |c_func_to_recursive_line_20_to_25_0_~j#1.base|))) (store .cse9 |c_func_to_recursive_line_20_to_25_0_~j#1.offset| (+ (select .cse9 |c_func_to_recursive_line_20_to_25_0_~j#1.offset|) 2))))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_~k#1.base| .cse8) |c_func_to_recursive_line_20_to_25_0_~i#1.base| .cse5) |c_func_to_recursive_line_20_to_25_0_~j#1.base| .cse6) |c_func_to_recursive_line_20_to_25_0_~k#1.base|))) (let ((.cse3 (+ (select .cse7 |func_to_recursive_line_20_to_25_0_~k#1.offset|) 3))) (= (mod .cse3 4294967296) (mod (let ((.cse4 (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_~i#1.base| .cse5) |c_func_to_recursive_line_20_to_25_0_~j#1.base| .cse6) |c_func_to_recursive_line_20_to_25_0_~k#1.base| (store .cse7 |func_to_recursive_line_20_to_25_0_~k#1.offset| .cse3)))) (+ (select (select .cse4 |c_func_to_recursive_line_20_to_25_0_~i#1.base|) |c_func_to_recursive_line_20_to_25_0_~i#1.offset|) (select (select .cse4 |c_func_to_recursive_line_20_to_25_0_~j#1.base|) |c_func_to_recursive_line_20_to_25_0_~j#1.offset|))) 4294967296)))))))))))))))))))) is different from false [2023-11-19 07:36:12,227 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_127 (Array Int Int)) (v_ArrVal_131 (Array Int Int)) (|func_to_recursive_line_20_to_25_0_~k#1.offset| Int)) (let ((.cse21 (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_#in~i#1.base| (let ((.cse23 (select |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_#in~i#1.base|))) (store .cse23 |c_func_to_recursive_line_20_to_25_0_#in~i#1.offset| (+ (select .cse23 |c_func_to_recursive_line_20_to_25_0_#in~i#1.offset|) 1)))))) (let ((.cse19 (let ((.cse22 (select .cse21 |c_func_to_recursive_line_20_to_25_0_#in~j#1.base|))) (store .cse22 |c_func_to_recursive_line_20_to_25_0_#in~j#1.offset| (+ (select .cse22 |c_func_to_recursive_line_20_to_25_0_#in~j#1.offset|) 2))))) (let ((.cse17 (let ((.cse20 (select (store (store .cse21 |c_func_to_recursive_line_20_to_25_0_#in~j#1.base| .cse19) |c_func_to_recursive_line_20_to_25_0_#in~k#1.base| v_ArrVal_127) |c_func_to_recursive_line_20_to_25_0_#in~i#1.base|))) (store .cse20 |c_func_to_recursive_line_20_to_25_0_#in~i#1.offset| (+ (select .cse20 |c_func_to_recursive_line_20_to_25_0_#in~i#1.offset|) 1))))) (let ((.cse15 (let ((.cse18 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_#in~j#1.base| .cse19) |c_func_to_recursive_line_20_to_25_0_#in~k#1.base| v_ArrVal_127) |c_func_to_recursive_line_20_to_25_0_#in~i#1.base| .cse17) |c_func_to_recursive_line_20_to_25_0_#in~j#1.base|))) (store .cse18 |c_func_to_recursive_line_20_to_25_0_#in~j#1.offset| (+ (select .cse18 |c_func_to_recursive_line_20_to_25_0_#in~j#1.offset|) 2))))) (let ((.cse12 (let ((.cse16 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_#in~i#1.base| .cse17) |c_func_to_recursive_line_20_to_25_0_#in~j#1.base| .cse15) |c_func_to_recursive_line_20_to_25_0_#in~k#1.base| v_ArrVal_131) |c_func_to_recursive_line_20_to_25_0_#in~i#1.base|))) (store .cse16 |c_func_to_recursive_line_20_to_25_0_#in~i#1.offset| (+ (select .cse16 |c_func_to_recursive_line_20_to_25_0_#in~i#1.offset|) 1))))) (let ((.cse10 (let ((.cse14 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_#in~j#1.base| .cse15) |c_func_to_recursive_line_20_to_25_0_#in~k#1.base| v_ArrVal_131) |c_func_to_recursive_line_20_to_25_0_#in~i#1.base| .cse12) |c_func_to_recursive_line_20_to_25_0_#in~j#1.base|))) (store .cse14 |c_func_to_recursive_line_20_to_25_0_#in~j#1.offset| (+ 2 (select .cse14 |c_func_to_recursive_line_20_to_25_0_#in~j#1.offset|)))))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_#in~k#1.base| v_ArrVal_131) |c_func_to_recursive_line_20_to_25_0_#in~i#1.base| .cse12) |c_func_to_recursive_line_20_to_25_0_#in~j#1.base| .cse10) |c_func_to_recursive_line_20_to_25_0_#in~k#1.base|))) (let ((.cse0 (+ (select .cse13 |func_to_recursive_line_20_to_25_0_~k#1.offset|) 3))) (let ((.cse8 (store .cse13 |func_to_recursive_line_20_to_25_0_~k#1.offset| .cse0))) (let ((.cse1 (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_#in~i#1.base| .cse12) |c_func_to_recursive_line_20_to_25_0_#in~j#1.base| .cse10) |c_func_to_recursive_line_20_to_25_0_#in~k#1.base| .cse8))) (let ((.cse11 (select .cse1 |c_func_to_recursive_line_20_to_25_0_#in~i#1.base|))) (let ((.cse2 (select .cse11 |c_func_to_recursive_line_20_to_25_0_#in~i#1.offset|))) (or (not (= (mod .cse0 4294967296) (mod (+ (select (select .cse1 |c_func_to_recursive_line_20_to_25_0_#in~j#1.base|) |c_func_to_recursive_line_20_to_25_0_#in~j#1.offset|) .cse2) 4294967296))) (let ((.cse4 (store .cse11 |c_func_to_recursive_line_20_to_25_0_#in~i#1.offset| (+ .cse2 1)))) (let ((.cse5 (let ((.cse9 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_#in~j#1.base| .cse10) |c_func_to_recursive_line_20_to_25_0_#in~k#1.base| .cse8) |c_func_to_recursive_line_20_to_25_0_#in~i#1.base| .cse4) |c_func_to_recursive_line_20_to_25_0_#in~j#1.base|))) (store .cse9 |c_func_to_recursive_line_20_to_25_0_#in~j#1.offset| (+ 2 (select .cse9 |c_func_to_recursive_line_20_to_25_0_#in~j#1.offset|)))))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_#in~k#1.base| .cse8) |c_func_to_recursive_line_20_to_25_0_#in~i#1.base| .cse4) |c_func_to_recursive_line_20_to_25_0_#in~j#1.base| .cse5) |c_func_to_recursive_line_20_to_25_0_#in~k#1.base|))) (let ((.cse7 (+ (select .cse6 |func_to_recursive_line_20_to_25_0_~k#1.offset|) 3))) (= (mod (let ((.cse3 (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_25_0_#in~i#1.base| .cse4) |c_func_to_recursive_line_20_to_25_0_#in~j#1.base| .cse5) |c_func_to_recursive_line_20_to_25_0_#in~k#1.base| (store .cse6 |func_to_recursive_line_20_to_25_0_~k#1.offset| .cse7)))) (+ (select (select .cse3 |c_func_to_recursive_line_20_to_25_0_#in~i#1.base|) |c_func_to_recursive_line_20_to_25_0_#in~i#1.offset|) (select (select .cse3 |c_func_to_recursive_line_20_to_25_0_#in~j#1.base|) |c_func_to_recursive_line_20_to_25_0_#in~j#1.offset|))) 4294967296) (mod .cse7 4294967296)))))))))))))))))))) is different from false [2023-11-19 07:36:12,462 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_127 (Array Int Int)) (v_ArrVal_131 (Array Int Int)) (|func_to_recursive_line_20_to_25_0_~k#1.offset| Int)) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base| (let ((.cse23 (select |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base|))) (store .cse23 |c_ULTIMATE.start_main_~#i~0#1.offset| (+ (select .cse23 |c_ULTIMATE.start_main_~#i~0#1.offset|) 1)))))) (let ((.cse19 (let ((.cse22 (select .cse21 |c_ULTIMATE.start_main_~#j~0#1.base|))) (store .cse22 |c_ULTIMATE.start_main_~#j~0#1.offset| (+ (select .cse22 |c_ULTIMATE.start_main_~#j~0#1.offset|) 2))))) (let ((.cse17 (let ((.cse20 (select (store (store .cse21 |c_ULTIMATE.start_main_~#j~0#1.base| .cse19) |c_ULTIMATE.start_main_~#k~0#1.base| v_ArrVal_127) |c_ULTIMATE.start_main_~#i~0#1.base|))) (store .cse20 |c_ULTIMATE.start_main_~#i~0#1.offset| (+ (select .cse20 |c_ULTIMATE.start_main_~#i~0#1.offset|) 1))))) (let ((.cse15 (let ((.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#j~0#1.base| .cse19) |c_ULTIMATE.start_main_~#k~0#1.base| v_ArrVal_127) |c_ULTIMATE.start_main_~#i~0#1.base| .cse17) |c_ULTIMATE.start_main_~#j~0#1.base|))) (store .cse18 |c_ULTIMATE.start_main_~#j~0#1.offset| (+ (select .cse18 |c_ULTIMATE.start_main_~#j~0#1.offset|) 2))))) (let ((.cse12 (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base| .cse17) |c_ULTIMATE.start_main_~#j~0#1.base| .cse15) |c_ULTIMATE.start_main_~#k~0#1.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#i~0#1.base|))) (store .cse16 |c_ULTIMATE.start_main_~#i~0#1.offset| (+ (select .cse16 |c_ULTIMATE.start_main_~#i~0#1.offset|) 1))))) (let ((.cse10 (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#j~0#1.base| .cse15) |c_ULTIMATE.start_main_~#k~0#1.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#i~0#1.base| .cse12) |c_ULTIMATE.start_main_~#j~0#1.base|))) (store .cse14 |c_ULTIMATE.start_main_~#j~0#1.offset| (+ (select .cse14 |c_ULTIMATE.start_main_~#j~0#1.offset|) 2))))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#k~0#1.base| v_ArrVal_131) |c_ULTIMATE.start_main_~#i~0#1.base| .cse12) |c_ULTIMATE.start_main_~#j~0#1.base| .cse10) |c_ULTIMATE.start_main_~#k~0#1.base|))) (let ((.cse0 (+ (select .cse13 |func_to_recursive_line_20_to_25_0_~k#1.offset|) 3))) (let ((.cse8 (store .cse13 |func_to_recursive_line_20_to_25_0_~k#1.offset| .cse0))) (let ((.cse1 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base| .cse12) |c_ULTIMATE.start_main_~#j~0#1.base| .cse10) |c_ULTIMATE.start_main_~#k~0#1.base| .cse8))) (let ((.cse11 (select .cse1 |c_ULTIMATE.start_main_~#i~0#1.base|))) (let ((.cse2 (select .cse11 |c_ULTIMATE.start_main_~#i~0#1.offset|))) (or (not (= (mod .cse0 4294967296) (mod (+ (select (select .cse1 |c_ULTIMATE.start_main_~#j~0#1.base|) |c_ULTIMATE.start_main_~#j~0#1.offset|) .cse2) 4294967296))) (let ((.cse5 (store .cse11 |c_ULTIMATE.start_main_~#i~0#1.offset| (+ .cse2 1)))) (let ((.cse6 (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#j~0#1.base| .cse10) |c_ULTIMATE.start_main_~#k~0#1.base| .cse8) |c_ULTIMATE.start_main_~#i~0#1.base| .cse5) |c_ULTIMATE.start_main_~#j~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#j~0#1.offset| (+ 2 (select .cse9 |c_ULTIMATE.start_main_~#j~0#1.offset|)))))) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#k~0#1.base| .cse8) |c_ULTIMATE.start_main_~#i~0#1.base| .cse5) |c_ULTIMATE.start_main_~#j~0#1.base| .cse6) |c_ULTIMATE.start_main_~#k~0#1.base|))) (let ((.cse3 (+ (select .cse7 |func_to_recursive_line_20_to_25_0_~k#1.offset|) 3))) (= (mod .cse3 4294967296) (mod (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base| .cse5) |c_ULTIMATE.start_main_~#j~0#1.base| .cse6) |c_ULTIMATE.start_main_~#k~0#1.base| (store .cse7 |func_to_recursive_line_20_to_25_0_~k#1.offset| .cse3)))) (+ (select (select .cse4 |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) (select (select .cse4 |c_ULTIMATE.start_main_~#j~0#1.base|) |c_ULTIMATE.start_main_~#j~0#1.offset|))) 4294967296)))))))))))))))))))) is different from false [2023-11-19 07:36:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 5 times theorem prover too weak. 0 trivial. 6 not checked. [2023-11-19 07:36:12,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456456755] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:36:12,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:36:12,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 29 [2023-11-19 07:36:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833127584] [2023-11-19 07:36:12,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:36:12,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-19 07:36:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:36:12,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-19 07:36:12,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=526, Unknown=39, NotChecked=150, Total=812 [2023-11-19 07:36:12,561 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 29 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 19 states have internal predecessors, (42), 10 states have call successors, (10), 10 states have call predecessors, (10), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:36:24,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:36:26,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:36:28,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:36:30,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:36:32,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]