./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/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_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/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_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/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 53d776429169be2026863283cb18a34602ad7ee3b29f4a2a38a6e26dad3008de --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:00:15,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:00:15,591 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:00:15,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:00:15,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:00:15,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:00:15,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:00:15,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:00:15,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:00:15,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:00:15,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:00:15,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:00:15,630 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:00:15,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:00:15,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:00:15,632 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:00:15,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:00:15,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:00:15,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:00:15,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:00:15,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:00:15,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:00:15,637 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:00:15,637 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:00:15,638 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:00:15,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:00:15,639 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:00:15,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:00:15,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:00:15,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:00:15,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:00:15,642 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:00:15,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:00:15,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:00:15,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:00:15,644 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:00:15,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:00:15,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:00:15,645 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:00:15,646 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_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/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_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/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 -> 53d776429169be2026863283cb18a34602ad7ee3b29f4a2a38a6e26dad3008de [2023-11-19 08:00:15,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:00:15,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:00:15,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:00:15,966 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:00:15,968 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:00:15,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c [2023-11-19 08:00:19,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:00:19,542 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:00:19,542 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c [2023-11-19 08:00:19,549 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/data/2cd987f93/4ed934fd3eda4cf89e6a580f91dfd3c6/FLAG9da3061ef [2023-11-19 08:00:19,563 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/data/2cd987f93/4ed934fd3eda4cf89e6a580f91dfd3c6 [2023-11-19 08:00:19,566 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:00:19,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:00:19,570 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:00:19,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:00:19,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:00:19,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44beb56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19, skipping insertion in model container [2023-11-19 08:00:19,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,601 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:00:19,745 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_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c[1113,1126] [2023-11-19 08:00:19,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:00:19,775 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:00:19,784 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_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/sv-benchmarks/c/recursified_loop-crafted/recursified_simple_vardep_2.c[1113,1126] [2023-11-19 08:00:19,790 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:00:19,802 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:00:19,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19 WrapperNode [2023-11-19 08:00:19,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:00:19,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:00:19,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:00:19,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:00:19,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,821 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,844 INFO L138 Inliner]: procedures = 14, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2023-11-19 08:00:19,845 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:00:19,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:00:19,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:00:19,846 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:00:19,853 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:00:19,885 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:00:19,885 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:00:19,885 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:00:19,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19" (1/1) ... [2023-11-19 08:00:19,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:00:19,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:00:19,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:00:19,957 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:00:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:00:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:00:19,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:00:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:00:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:00:19,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:00:19,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:00:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_24_0 [2023-11-19 08:00:19,978 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_24_0 [2023-11-19 08:00:19,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:00:20,082 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:00:20,085 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:00:20,267 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:00:20,275 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:00:20,276 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:00:20,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:20 BoogieIcfgContainer [2023-11-19 08:00:20,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:00:20,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:00:20,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:00:20,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:00:20,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:00:19" (1/3) ... [2023-11-19 08:00:20,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b60e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:00:20, skipping insertion in model container [2023-11-19 08:00:20,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:00:19" (2/3) ... [2023-11-19 08:00:20,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b60e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:00:20, skipping insertion in model container [2023-11-19 08:00:20,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:00:20" (3/3) ... [2023-11-19 08:00:20,291 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_simple_vardep_2.c [2023-11-19 08:00:20,312 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:00:20,313 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 08:00:20,364 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:00:20,371 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;@27031a44, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:00:20,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 08:00:20,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 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 08:00:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 08:00:20,384 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:20,384 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:20,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:00:20,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:20,391 INFO L85 PathProgramCache]: Analyzing trace with hash 231684199, now seen corresponding path program 1 times [2023-11-19 08:00:20,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719065808] [2023-11-19 08:00:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:21,765 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 08:00:21,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:21,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719065808] [2023-11-19 08:00:21,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719065808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:21,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:21,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:00:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081268454] [2023-11-19 08:00:21,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:21,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:00:21,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:21,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:00:21,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:00:21,811 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 15 states have internal predecessors, (17), 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.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:00:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:22,030 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-11-19 08:00:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:00:22,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 08:00:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:00:22,043 INFO L225 Difference]: With dead ends: 39 [2023-11-19 08:00:22,043 INFO L226 Difference]: Without dead ends: 15 [2023-11-19 08:00:22,048 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 08:00:22,056 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:00:22,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 61 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:00:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-11-19 08:00:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-11-19 08:00:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 08:00:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-11-19 08:00:22,106 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 9 [2023-11-19 08:00:22,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:00:22,107 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-11-19 08:00:22,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:00:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2023-11-19 08:00:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 08:00:22,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:22,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:22,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:00:22,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:00:22,110 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:22,110 INFO L85 PathProgramCache]: Analyzing trace with hash 231624617, now seen corresponding path program 1 times [2023-11-19 08:00:22,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:22,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611231157] [2023-11-19 08:00:22,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:22,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:23,148 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 08:00:23,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:23,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611231157] [2023-11-19 08:00:23,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611231157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:00:23,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:00:23,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-19 08:00:23,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824734202] [2023-11-19 08:00:23,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:00:23,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-19 08:00:23,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-19 08:00:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:00:23,153 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:00:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:23,407 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2023-11-19 08:00:23,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-19 08:00:23,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 08:00:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:00:23,411 INFO L225 Difference]: With dead ends: 21 [2023-11-19 08:00:23,412 INFO L226 Difference]: Without dead ends: 19 [2023-11-19 08:00:23,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-11-19 08:00:23,423 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:00:23,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 33 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:00:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-19 08:00:23,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-11-19 08:00:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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 08:00:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-11-19 08:00:23,437 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2023-11-19 08:00:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:00:23,438 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-11-19 08:00:23,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:00:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-11-19 08:00:23,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 08:00:23,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:23,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:23,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:00:23,442 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:00:23,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:23,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2028041086, now seen corresponding path program 1 times [2023-11-19 08:00:23,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:23,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80400684] [2023-11-19 08:00:23,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:23,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:24,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:24,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:24,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80400684] [2023-11-19 08:00:24,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80400684] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:00:24,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796719841] [2023-11-19 08:00:24,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:24,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:00:24,822 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:00:24,828 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:00:24,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 08:00:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:25,308 WARN L260 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 87 conjunts are in the unsatisfiable core [2023-11-19 08:00:25,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:00:25,418 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 08:00:25,419 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 08:00:25,691 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 65 treesize of output 47 [2023-11-19 08:00:25,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:00:25,703 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 35 treesize of output 33 [2023-11-19 08:00:25,716 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 [2023-11-19 08:00:26,025 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 176 treesize of output 118 [2023-11-19 08:00:26,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:00:26,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:00:26,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:00:26,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 60 treesize of output 36 [2023-11-19 08:00:26,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:26,046 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:00:26,074 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base| (let ((.cse3 (select |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base|))) (store .cse3 |c_func_to_recursive_line_20_to_24_0_~i#1.offset| (+ (select .cse3 |c_func_to_recursive_line_20_to_24_0_~i#1.offset|) 1)))) |c_func_to_recursive_line_20_to_24_0_~j#1.base| v_ArrVal_68))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_20_to_24_0_~k#1.base|))) (let ((.cse0 (+ (select .cse2 |c_func_to_recursive_line_20_to_24_0_~k#1.offset|) 3))) (= (mod .cse0 4294967296) (mod (* 3 (select (select (store .cse1 |c_func_to_recursive_line_20_to_24_0_~k#1.base| (store .cse2 |c_func_to_recursive_line_20_to_24_0_~k#1.offset| .cse0)) |c_func_to_recursive_line_20_to_24_0_~i#1.base|) |c_func_to_recursive_line_20_to_24_0_~i#1.offset|)) 4294967296)))))) is different from false [2023-11-19 08:00:26,096 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_68 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~i#1.base| (let ((.cse3 (select |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (store .cse3 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset| (+ (select .cse3 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset|) 1)))) |c_func_to_recursive_line_20_to_24_0_#in~j#1.base| v_ArrVal_68))) (let ((.cse2 (select .cse1 |c_func_to_recursive_line_20_to_24_0_#in~k#1.base|))) (let ((.cse0 (+ (select .cse2 |c_func_to_recursive_line_20_to_24_0_#in~k#1.offset|) 3))) (= (mod .cse0 4294967296) (mod (* (select (select (store .cse1 |c_func_to_recursive_line_20_to_24_0_#in~k#1.base| (store .cse2 |c_func_to_recursive_line_20_to_24_0_#in~k#1.offset| .cse0)) |c_func_to_recursive_line_20_to_24_0_#in~i#1.base|) |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset|) 3) 4294967296)))))) is different from false [2023-11-19 08:00:26,852 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_63 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base| (let ((.cse9 (select |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base|))) (store .cse9 |c_func_to_recursive_line_20_to_24_0_~i#1.offset| (+ (select .cse9 |c_func_to_recursive_line_20_to_24_0_~i#1.offset|) 1)))) |c_func_to_recursive_line_20_to_24_0_~j#1.base| v_ArrVal_63))) (let ((.cse8 (select .cse7 |c_func_to_recursive_line_20_to_24_0_~k#1.base|))) (let ((.cse6 (+ (select .cse8 |c_func_to_recursive_line_20_to_24_0_~k#1.offset|) 3))) (let ((.cse3 (store .cse8 |c_func_to_recursive_line_20_to_24_0_~k#1.offset| .cse6))) (let ((.cse4 (select (store .cse7 |c_func_to_recursive_line_20_to_24_0_~k#1.base| .cse3) |c_func_to_recursive_line_20_to_24_0_~i#1.base|))) (let ((.cse5 (select .cse4 |c_func_to_recursive_line_20_to_24_0_~i#1.offset|))) (or (let ((.cse1 (store .cse4 |c_func_to_recursive_line_20_to_24_0_~i#1.offset| (+ .cse5 1)))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~k#1.base| .cse3) |c_func_to_recursive_line_20_to_24_0_~i#1.base| .cse1) |c_func_to_recursive_line_20_to_24_0_~j#1.base| v_ArrVal_68) |c_func_to_recursive_line_20_to_24_0_~k#1.base|))) (let ((.cse0 (+ (select .cse2 |c_func_to_recursive_line_20_to_24_0_~k#1.offset|) 3))) (= (mod .cse0 4294967296) (mod (* 3 (select (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base| .cse1) |c_func_to_recursive_line_20_to_24_0_~j#1.base| v_ArrVal_68) |c_func_to_recursive_line_20_to_24_0_~k#1.base| (store .cse2 |c_func_to_recursive_line_20_to_24_0_~k#1.offset| .cse0)) |c_func_to_recursive_line_20_to_24_0_~i#1.base|) |c_func_to_recursive_line_20_to_24_0_~i#1.offset|)) 4294967296))))) (not (= (mod (* .cse5 3) 4294967296) (mod .cse6 4294967296))))))))))) is different from false [2023-11-19 08:00:26,908 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_63 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~i#1.base| (let ((.cse9 (select |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (store .cse9 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset| (+ (select .cse9 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset|) 1)))) |c_func_to_recursive_line_20_to_24_0_#in~j#1.base| v_ArrVal_63))) (let ((.cse8 (select .cse7 |c_func_to_recursive_line_20_to_24_0_#in~k#1.base|))) (let ((.cse6 (+ 3 (select .cse8 |c_func_to_recursive_line_20_to_24_0_#in~k#1.offset|)))) (let ((.cse3 (store .cse8 |c_func_to_recursive_line_20_to_24_0_#in~k#1.offset| .cse6))) (let ((.cse4 (select (store .cse7 |c_func_to_recursive_line_20_to_24_0_#in~k#1.base| .cse3) |c_func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (let ((.cse5 (select .cse4 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset|))) (or (let ((.cse1 (store .cse4 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset| (+ 1 .cse5)))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~k#1.base| .cse3) |c_func_to_recursive_line_20_to_24_0_#in~i#1.base| .cse1) |c_func_to_recursive_line_20_to_24_0_#in~j#1.base| v_ArrVal_68) |c_func_to_recursive_line_20_to_24_0_#in~k#1.base|))) (let ((.cse0 (+ 3 (select .cse2 |c_func_to_recursive_line_20_to_24_0_#in~k#1.offset|)))) (= (mod .cse0 4294967296) (mod (* 3 (select (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~i#1.base| .cse1) |c_func_to_recursive_line_20_to_24_0_#in~j#1.base| v_ArrVal_68) |c_func_to_recursive_line_20_to_24_0_#in~k#1.base| (store .cse2 |c_func_to_recursive_line_20_to_24_0_#in~k#1.offset| .cse0)) |c_func_to_recursive_line_20_to_24_0_#in~i#1.base|) |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) 4294967296))))) (not (= (mod .cse6 4294967296) (mod (* 3 .cse5) 4294967296))))))))))) is different from false [2023-11-19 08:00:29,697 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_63 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base| (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~#i~0#1.offset| (+ (select .cse9 |c_ULTIMATE.start_main_~#i~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#j~0#1.base| v_ArrVal_63))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#k~0#1.base|))) (let ((.cse6 (+ (select .cse8 |c_ULTIMATE.start_main_~#k~0#1.offset|) 3))) (let ((.cse3 (store .cse8 |c_ULTIMATE.start_main_~#k~0#1.offset| .cse6))) (let ((.cse4 (select (store .cse7 |c_ULTIMATE.start_main_~#k~0#1.base| .cse3) |c_ULTIMATE.start_main_~#i~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#i~0#1.offset|))) (or (let ((.cse1 (store .cse4 |c_ULTIMATE.start_main_~#i~0#1.offset| (+ .cse5 1)))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#k~0#1.base| .cse3) |c_ULTIMATE.start_main_~#i~0#1.base| .cse1) |c_ULTIMATE.start_main_~#j~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#k~0#1.base|))) (let ((.cse0 (+ (select .cse2 |c_ULTIMATE.start_main_~#k~0#1.offset|) 3))) (= (mod .cse0 4294967296) (mod (* (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base| .cse1) |c_ULTIMATE.start_main_~#j~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#k~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#k~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) 3) 4294967296))))) (not (= (mod (* 3 .cse5) 4294967296) (mod .cse6 4294967296))))))))))) is different from false [2023-11-19 08:00:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-19 08:00:29,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796719841] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:00:29,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:00:29,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2023-11-19 08:00:29,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045792899] [2023-11-19 08:00:29,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:00:29,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-19 08:00:29,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:29,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-19 08:00:29,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=191, Unknown=5, NotChecked=160, Total=420 [2023-11-19 08:00:29,818 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 21 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 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 08:00:32,482 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base|))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_main_~#i~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~#k~0#1.offset| 0) (forall ((v_ArrVal_63 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base| (store .cse9 |c_ULTIMATE.start_main_~#i~0#1.offset| (+ .cse10 1))) |c_ULTIMATE.start_main_~#j~0#1.base| v_ArrVal_63))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#k~0#1.base|))) (let ((.cse6 (+ (select .cse8 |c_ULTIMATE.start_main_~#k~0#1.offset|) 3))) (let ((.cse3 (store .cse8 |c_ULTIMATE.start_main_~#k~0#1.offset| .cse6))) (let ((.cse4 (select (store .cse7 |c_ULTIMATE.start_main_~#k~0#1.base| .cse3) |c_ULTIMATE.start_main_~#i~0#1.base|))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_main_~#i~0#1.offset|))) (or (let ((.cse1 (store .cse4 |c_ULTIMATE.start_main_~#i~0#1.offset| (+ .cse5 1)))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#k~0#1.base| .cse3) |c_ULTIMATE.start_main_~#i~0#1.base| .cse1) |c_ULTIMATE.start_main_~#j~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#k~0#1.base|))) (let ((.cse0 (+ (select .cse2 |c_ULTIMATE.start_main_~#k~0#1.offset|) 3))) (= (mod .cse0 4294967296) (mod (* (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base| .cse1) |c_ULTIMATE.start_main_~#j~0#1.base| v_ArrVal_68) |c_ULTIMATE.start_main_~#k~0#1.base| (store .cse2 |c_ULTIMATE.start_main_~#k~0#1.offset| .cse0)) |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) 3) 4294967296))))) (not (= (mod (* 3 .cse5) 4294967296) (mod .cse6 4294967296))))))))))) (= .cse10 0) (not (= |c_ULTIMATE.start_main_~#i~0#1.base| |c_ULTIMATE.start_main_~#k~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#k~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~#j~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#j~0#1.base| |c_ULTIMATE.start_main_~#k~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#j~0#1.base| |c_ULTIMATE.start_main_~#i~0#1.base|))))) is different from false [2023-11-19 08:00:34,713 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (let ((.cse0 (select .cse10 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset|))) (and (not (= |c_func_to_recursive_line_20_to_24_0_#in~i#1.base| |c_func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (= (select (select |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~k#1.base|) 0) 0) (not (= |c_func_to_recursive_line_20_to_24_0_#in~i#1.base| |c_func_to_recursive_line_20_to_24_0_#in~k#1.base|)) (= .cse0 0) (forall ((v_ArrVal_63 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~i#1.base| (store .cse10 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset| (+ .cse0 1))) |c_func_to_recursive_line_20_to_24_0_#in~j#1.base| v_ArrVal_63))) (let ((.cse9 (select .cse8 |c_func_to_recursive_line_20_to_24_0_#in~k#1.base|))) (let ((.cse7 (+ 3 (select .cse9 |c_func_to_recursive_line_20_to_24_0_#in~k#1.offset|)))) (let ((.cse4 (store .cse9 |c_func_to_recursive_line_20_to_24_0_#in~k#1.offset| .cse7))) (let ((.cse5 (select (store .cse8 |c_func_to_recursive_line_20_to_24_0_#in~k#1.base| .cse4) |c_func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (let ((.cse6 (select .cse5 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset|))) (or (let ((.cse2 (store .cse5 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset| (+ 1 .cse6)))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~k#1.base| .cse4) |c_func_to_recursive_line_20_to_24_0_#in~i#1.base| .cse2) |c_func_to_recursive_line_20_to_24_0_#in~j#1.base| v_ArrVal_68) |c_func_to_recursive_line_20_to_24_0_#in~k#1.base|))) (let ((.cse1 (+ 3 (select .cse3 |c_func_to_recursive_line_20_to_24_0_#in~k#1.offset|)))) (= (mod .cse1 4294967296) (mod (* 3 (select (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~i#1.base| .cse2) |c_func_to_recursive_line_20_to_24_0_#in~j#1.base| v_ArrVal_68) |c_func_to_recursive_line_20_to_24_0_#in~k#1.base| (store .cse3 |c_func_to_recursive_line_20_to_24_0_#in~k#1.offset| .cse1)) |c_func_to_recursive_line_20_to_24_0_#in~i#1.base|) |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset|)) 4294967296))))) (not (= (mod .cse7 4294967296) (mod (* 3 .cse6) 4294967296))))))))))) (not (= |c_func_to_recursive_line_20_to_24_0_#in~k#1.base| |c_func_to_recursive_line_20_to_24_0_#in~j#1.base|)) (= 0 |c_func_to_recursive_line_20_to_24_0_#in~j#1.offset|) (= |c_func_to_recursive_line_20_to_24_0_#in~k#1.offset| 0)))) is different from false [2023-11-19 08:00:36,819 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base|))) (let ((.cse0 (select .cse10 |c_func_to_recursive_line_20_to_24_0_~i#1.offset|))) (and (not (= |c_func_to_recursive_line_20_to_24_0_~i#1.base| |c_func_to_recursive_line_20_to_24_0_~k#1.base|)) (= (select (select |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~k#1.base|) 0) 0) (not (= |c_func_to_recursive_line_20_to_24_0_~i#1.base| |c_func_to_recursive_line_20_to_24_0_~j#1.base|)) (= |c_func_to_recursive_line_20_to_24_0_~k#1.offset| 0) (= .cse0 0) (not (= |c_func_to_recursive_line_20_to_24_0_~k#1.base| |c_func_to_recursive_line_20_to_24_0_~j#1.base|)) (forall ((v_ArrVal_63 (Array Int Int)) (v_ArrVal_68 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base| (store .cse10 |c_func_to_recursive_line_20_to_24_0_~i#1.offset| (+ .cse0 1))) |c_func_to_recursive_line_20_to_24_0_~j#1.base| v_ArrVal_63))) (let ((.cse9 (select .cse8 |c_func_to_recursive_line_20_to_24_0_~k#1.base|))) (let ((.cse7 (+ (select .cse9 |c_func_to_recursive_line_20_to_24_0_~k#1.offset|) 3))) (let ((.cse4 (store .cse9 |c_func_to_recursive_line_20_to_24_0_~k#1.offset| .cse7))) (let ((.cse5 (select (store .cse8 |c_func_to_recursive_line_20_to_24_0_~k#1.base| .cse4) |c_func_to_recursive_line_20_to_24_0_~i#1.base|))) (let ((.cse6 (select .cse5 |c_func_to_recursive_line_20_to_24_0_~i#1.offset|))) (or (let ((.cse2 (store .cse5 |c_func_to_recursive_line_20_to_24_0_~i#1.offset| (+ .cse6 1)))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~k#1.base| .cse4) |c_func_to_recursive_line_20_to_24_0_~i#1.base| .cse2) |c_func_to_recursive_line_20_to_24_0_~j#1.base| v_ArrVal_68) |c_func_to_recursive_line_20_to_24_0_~k#1.base|))) (let ((.cse1 (+ (select .cse3 |c_func_to_recursive_line_20_to_24_0_~k#1.offset|) 3))) (= (mod .cse1 4294967296) (mod (* 3 (select (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base| .cse2) |c_func_to_recursive_line_20_to_24_0_~j#1.base| v_ArrVal_68) |c_func_to_recursive_line_20_to_24_0_~k#1.base| (store .cse3 |c_func_to_recursive_line_20_to_24_0_~k#1.offset| .cse1)) |c_func_to_recursive_line_20_to_24_0_~i#1.base|) |c_func_to_recursive_line_20_to_24_0_~i#1.offset|)) 4294967296))))) (not (= (mod (* .cse6 3) 4294967296) (mod .cse7 4294967296)))))))))))))) is different from false [2023-11-19 08:00:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:38,221 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2023-11-19 08:00:38,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 08:00:38,223 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 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 16 [2023-11-19 08:00:38,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:00:38,248 INFO L225 Difference]: With dead ends: 30 [2023-11-19 08:00:38,248 INFO L226 Difference]: Without dead ends: 21 [2023-11-19 08:00:38,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=107, Invalid=297, Unknown=8, NotChecked=344, Total=756 [2023-11-19 08:00:38,250 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 16 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:00:38,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 65 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 128 Unchecked, 0.3s Time] [2023-11-19 08:00:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-19 08:00:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2023-11-19 08:00:38,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 08:00:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-11-19 08:00:38,275 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 16 [2023-11-19 08:00:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:00:38,277 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-11-19 08:00:38,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 15 states have internal predecessors, (32), 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 08:00:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-11-19 08:00:38,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 08:00:38,279 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:38,280 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:00:38,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 08:00:38,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:00:38,481 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:00:38,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:38,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2028100668, now seen corresponding path program 1 times [2023-11-19 08:00:38,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:38,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199376878] [2023-11-19 08:00:38,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:38,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:41,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:41,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:00:41,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199376878] [2023-11-19 08:00:41,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199376878] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:00:41,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175926355] [2023-11-19 08:00:41,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:41,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:00:41,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:00:41,161 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:00:41,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 08:00:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:00:41,564 WARN L260 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 94 conjunts are in the unsatisfiable core [2023-11-19 08:00:41,569 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:00:41,636 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 08:00:41,637 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 08:00:42,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:00:42,941 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 08:00:42,962 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 08:00:44,526 INFO L349 Elim1Store]: treesize reduction 42, result has 26.3 percent of original size [2023-11-19 08:00:44,527 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 08:00:44,667 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-11-19 08:00:44,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 111 [2023-11-19 08:00:44,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:00:44,739 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 08:00:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:00:45,184 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:00:45,466 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_117 (Array Int Int))) (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base| (let ((.cse3 (select |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base|))) (store .cse3 |c_func_to_recursive_line_20_to_24_0_~i#1.offset| (+ (select .cse3 |c_func_to_recursive_line_20_to_24_0_~i#1.offset|) 1)))))) (store .cse1 |c_func_to_recursive_line_20_to_24_0_~j#1.base| (let ((.cse2 (select .cse1 |c_func_to_recursive_line_20_to_24_0_~j#1.base|))) (store .cse2 |c_func_to_recursive_line_20_to_24_0_~j#1.offset| (+ 2 (select .cse2 |c_func_to_recursive_line_20_to_24_0_~j#1.offset|)))))) |c_func_to_recursive_line_20_to_24_0_~k#1.base| v_ArrVal_117))) (= (* (mod (select (select .cse0 |c_func_to_recursive_line_20_to_24_0_~i#1.base|) |c_func_to_recursive_line_20_to_24_0_~i#1.offset|) 2147483648) 2) (mod (select (select .cse0 |c_func_to_recursive_line_20_to_24_0_~j#1.base|) |c_func_to_recursive_line_20_to_24_0_~j#1.offset|) 4294967296)))) is different from false [2023-11-19 08:00:45,909 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_117 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse0 (store (let ((.cse5 (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base| (let ((.cse7 (select |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base|))) (store .cse7 |c_func_to_recursive_line_20_to_24_0_~i#1.offset| (+ (select .cse7 |c_func_to_recursive_line_20_to_24_0_~i#1.offset|) 1)))))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_func_to_recursive_line_20_to_24_0_~j#1.base|))) (store .cse6 |c_func_to_recursive_line_20_to_24_0_~j#1.offset| (+ 2 (select .cse6 |c_func_to_recursive_line_20_to_24_0_~j#1.offset|)))))) (let ((.cse1 (let ((.cse4 (select (store (store .cse5 |c_func_to_recursive_line_20_to_24_0_~j#1.base| .cse3) |c_func_to_recursive_line_20_to_24_0_~k#1.base| v_ArrVal_110) |c_func_to_recursive_line_20_to_24_0_~i#1.base|))) (store .cse4 |c_func_to_recursive_line_20_to_24_0_~i#1.offset| (+ (select .cse4 |c_func_to_recursive_line_20_to_24_0_~i#1.offset|) 1))))) (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~i#1.base| .cse1) |c_func_to_recursive_line_20_to_24_0_~j#1.base| (let ((.cse2 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_~j#1.base| .cse3) |c_func_to_recursive_line_20_to_24_0_~k#1.base| v_ArrVal_110) |c_func_to_recursive_line_20_to_24_0_~i#1.base| .cse1) |c_func_to_recursive_line_20_to_24_0_~j#1.base|))) (store .cse2 |c_func_to_recursive_line_20_to_24_0_~j#1.offset| (+ (select .cse2 |c_func_to_recursive_line_20_to_24_0_~j#1.offset|) 2))))))) |c_func_to_recursive_line_20_to_24_0_~k#1.base| v_ArrVal_117))) (= (mod (select (select .cse0 |c_func_to_recursive_line_20_to_24_0_~j#1.base|) |c_func_to_recursive_line_20_to_24_0_~j#1.offset|) 4294967296) (* (mod (select (select .cse0 |c_func_to_recursive_line_20_to_24_0_~i#1.base|) |c_func_to_recursive_line_20_to_24_0_~i#1.offset|) 2147483648) 2)))) is different from false [2023-11-19 08:00:45,962 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_117 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse0 (store (let ((.cse5 (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~i#1.base| (let ((.cse7 (select |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (store .cse7 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset| (+ (select .cse7 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset|) 1)))))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_func_to_recursive_line_20_to_24_0_#in~j#1.base|))) (store .cse6 |c_func_to_recursive_line_20_to_24_0_#in~j#1.offset| (+ (select .cse6 |c_func_to_recursive_line_20_to_24_0_#in~j#1.offset|) 2))))) (let ((.cse1 (let ((.cse4 (select (store (store .cse5 |c_func_to_recursive_line_20_to_24_0_#in~j#1.base| .cse3) |c_func_to_recursive_line_20_to_24_0_#in~k#1.base| v_ArrVal_110) |c_func_to_recursive_line_20_to_24_0_#in~i#1.base|))) (store .cse4 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset| (+ (select .cse4 |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset|) 1))))) (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~i#1.base| .cse1) |c_func_to_recursive_line_20_to_24_0_#in~j#1.base| (let ((.cse2 (select (store (store (store |c_#memory_int| |c_func_to_recursive_line_20_to_24_0_#in~j#1.base| .cse3) |c_func_to_recursive_line_20_to_24_0_#in~k#1.base| v_ArrVal_110) |c_func_to_recursive_line_20_to_24_0_#in~i#1.base| .cse1) |c_func_to_recursive_line_20_to_24_0_#in~j#1.base|))) (store .cse2 |c_func_to_recursive_line_20_to_24_0_#in~j#1.offset| (+ 2 (select .cse2 |c_func_to_recursive_line_20_to_24_0_#in~j#1.offset|)))))))) |c_func_to_recursive_line_20_to_24_0_#in~k#1.base| v_ArrVal_117))) (= (mod (select (select .cse0 |c_func_to_recursive_line_20_to_24_0_#in~j#1.base|) |c_func_to_recursive_line_20_to_24_0_#in~j#1.offset|) 4294967296) (* 2 (mod (select (select .cse0 |c_func_to_recursive_line_20_to_24_0_#in~i#1.base|) |c_func_to_recursive_line_20_to_24_0_#in~i#1.offset|) 2147483648))))) is different from false [2023-11-19 08:00:48,599 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_117 (Array Int Int)) (v_ArrVal_110 (Array Int Int))) (let ((.cse0 (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base| (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base|))) (store .cse7 |c_ULTIMATE.start_main_~#i~0#1.offset| (+ (select .cse7 |c_ULTIMATE.start_main_~#i~0#1.offset|) 1)))))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#j~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~#j~0#1.offset| (+ (select .cse6 |c_ULTIMATE.start_main_~#j~0#1.offset|) 2))))) (let ((.cse1 (let ((.cse4 (select (store (store .cse5 |c_ULTIMATE.start_main_~#j~0#1.base| .cse3) |c_ULTIMATE.start_main_~#k~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#i~0#1.base|))) (store .cse4 |c_ULTIMATE.start_main_~#i~0#1.offset| (+ (select .cse4 |c_ULTIMATE.start_main_~#i~0#1.offset|) 1))))) (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#i~0#1.base| .cse1) |c_ULTIMATE.start_main_~#j~0#1.base| (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#j~0#1.base| .cse3) |c_ULTIMATE.start_main_~#k~0#1.base| v_ArrVal_110) |c_ULTIMATE.start_main_~#i~0#1.base| .cse1) |c_ULTIMATE.start_main_~#j~0#1.base|))) (store .cse2 |c_ULTIMATE.start_main_~#j~0#1.offset| (+ 2 (select .cse2 |c_ULTIMATE.start_main_~#j~0#1.offset|)))))))) |c_ULTIMATE.start_main_~#k~0#1.base| v_ArrVal_117))) (= (mod (select (select .cse0 |c_ULTIMATE.start_main_~#j~0#1.base|) |c_ULTIMATE.start_main_~#j~0#1.offset|) 4294967296) (* 2 (mod (select (select .cse0 |c_ULTIMATE.start_main_~#i~0#1.base|) |c_ULTIMATE.start_main_~#i~0#1.offset|) 2147483648))))) is different from false [2023-11-19 08:00:48,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-19 08:00:48,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175926355] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:00:48,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:00:48,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 25 [2023-11-19 08:00:48,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073945480] [2023-11-19 08:00:48,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:00:48,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-19 08:00:48,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:00:48,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-19 08:00:48,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=365, Unknown=10, NotChecked=164, Total=600 [2023-11-19 08:00:48,669 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 25 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 states have internal predecessors, (36), 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 08:00:54,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:00:54,044 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2023-11-19 08:00:54,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 08:00:54,045 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 states have internal predecessors, (36), 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 16 [2023-11-19 08:00:54,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:00:54,046 INFO L225 Difference]: With dead ends: 28 [2023-11-19 08:00:54,046 INFO L226 Difference]: Without dead ends: 26 [2023-11-19 08:00:54,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=150, Invalid=848, Unknown=10, NotChecked=252, Total=1260 [2023-11-19 08:00:54,049 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-19 08:00:54,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 192 Invalid, 0 Unknown, 91 Unchecked, 1.8s Time] [2023-11-19 08:00:54,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-19 08:00:54,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-19 08:00:54,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:00:54,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2023-11-19 08:00:54,066 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 16 [2023-11-19 08:00:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:00:54,066 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2023-11-19 08:00:54,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 states have internal predecessors, (36), 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 08:00:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2023-11-19 08:00:54,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-19 08:00:54,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:00:54,068 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-19 08:00:54,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 08:00:54,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:00:54,273 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION === [func_to_recursive_line_20_to_24_0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:00:54,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:00:54,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1637381303, now seen corresponding path program 2 times [2023-11-19 08:00:54,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:00:54,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090831235] [2023-11-19 08:00:54,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:00:54,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:00:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:01:00,159 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:00,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:01:00,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090831235] [2023-11-19 08:01:00,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090831235] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:01:00,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826403930] [2023-11-19 08:01:00,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 08:01:00,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:01:00,162 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:01:00,163 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:01:00,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f58fb70a-ded9-4ebb-b518-bfa11bfc0aff/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 08:01:00,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 08:01:00,623 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:01:00,628 WARN L260 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 145 conjunts are in the unsatisfiable core [2023-11-19 08:01:00,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:01:00,820 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 08:01:00,820 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 08:01:02,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:02,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:02,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:02,514 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 08:01:05,761 INFO L349 Elim1Store]: treesize reduction 342, result has 21.0 percent of original size [2023-11-19 08:01:05,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 636 treesize of output 512 [2023-11-19 08:01:06,153 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-19 08:01:06,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:06,919 INFO L224 Elim1Store]: Index analysis took 553 ms [2023-11-19 08:01:06,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 33 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 80 [2023-11-19 08:01:11,845 INFO L349 Elim1Store]: treesize reduction 135, result has 14.0 percent of original size [2023-11-19 08:01:11,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 432 treesize of output 416 [2023-11-19 08:01:12,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:12,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:12,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:01:12,092 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 47 treesize of output 23 [2023-11-19 08:01:12,924 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:01:12,924 INFO L327 TraceCheckSpWp]: Computing backward predicates...