./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_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_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/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_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/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_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/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 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:04:34,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:04:35,065 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 08:04:35,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:04:35,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:04:35,103 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:04:35,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:04:35,105 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:04:35,106 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:04:35,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:04:35,108 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:04:35,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:04:35,110 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:04:35,111 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:04:35,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 08:04:35,112 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:04:35,113 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:04:35,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:04:35,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:04:35,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 08:04:35,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:04:35,117 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 08:04:35,117 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:04:35,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 08:04:35,118 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:04:35,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:04:35,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:04:35,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:04:35,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:04:35,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:04:35,122 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:04:35,134 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 08:04:35,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:04:35,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:04:35,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:04:35,136 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 08:04:35,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:04:35,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:04:35,137 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:04:35,138 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_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/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_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2023-11-19 08:04:35,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:04:35,556 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:04:35,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:04:35,562 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:04:35,563 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:04:35,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2023-11-19 08:04:39,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:04:39,396 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:04:39,397 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2023-11-19 08:04:39,407 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/data/6c52a4fff/49927fd0caae4ca68e73a6ee855804da/FLAGa212695eb [2023-11-19 08:04:39,426 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/data/6c52a4fff/49927fd0caae4ca68e73a6ee855804da [2023-11-19 08:04:39,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:04:39,436 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:04:39,441 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:04:39,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:04:39,450 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:04:39,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:04:39" (1/1) ... [2023-11-19 08:04:39,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aac67c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:39, skipping insertion in model container [2023-11-19 08:04:39,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:04:39" (1/1) ... [2023-11-19 08:04:39,485 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:04:39,652 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_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2023-11-19 08:04:39,658 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:04:39,670 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:04:39,688 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_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c[1611,1624] [2023-11-19 08:04:39,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:04:39,707 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:04:39,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:39 WrapperNode [2023-11-19 08:04:39,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:04:39,709 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:04:39,709 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:04:39,709 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:04:39,719 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:04:39" (1/1) ... [2023-11-19 08:04:39,727 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:04:39" (1/1) ... [2023-11-19 08:04:39,745 INFO L138 Inliner]: procedures = 13, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2023-11-19 08:04:39,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:04:39,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:04:39,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:04:39,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:04:39,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:39" (1/1) ... [2023-11-19 08:04:39,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:39" (1/1) ... [2023-11-19 08:04:39,759 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:39" (1/1) ... [2023-11-19 08:04:39,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:39" (1/1) ... [2023-11-19 08:04:39,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:39" (1/1) ... [2023-11-19 08:04:39,767 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:39" (1/1) ... [2023-11-19 08:04:39,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:39" (1/1) ... [2023-11-19 08:04:39,770 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:39" (1/1) ... [2023-11-19 08:04:39,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:04:39,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:04:39,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:04:39,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:04:39,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:39" (1/1) ... [2023-11-19 08:04:39,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:04:39,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:04:39,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/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:04:39,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/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:04:39,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:04:39,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:04:39,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:04:39,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:04:39,868 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2023-11-19 08:04:39,869 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2023-11-19 08:04:39,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:04:39,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:04:39,869 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 08:04:39,869 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2023-11-19 08:04:39,869 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2023-11-19 08:04:39,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:04:39,950 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:04:39,953 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:04:40,266 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:04:40,275 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:04:40,275 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:04:40,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:40 BoogieIcfgContainer [2023-11-19 08:04:40,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:04:40,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:04:40,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:04:40,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:04:40,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:04:39" (1/3) ... [2023-11-19 08:04:40,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8abc037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:40, skipping insertion in model container [2023-11-19 08:04:40,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:04:39" (2/3) ... [2023-11-19 08:04:40,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8abc037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:04:40, skipping insertion in model container [2023-11-19 08:04:40,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:04:40" (3/3) ... [2023-11-19 08:04:40,293 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2023-11-19 08:04:40,320 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:04:40,320 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 08:04:40,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:04:40,407 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;@2b73dd0a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:04:40,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 08:04:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 08:04:40,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 08:04:40,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:04:40,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:40,428 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:04:40,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:40,438 INFO L85 PathProgramCache]: Analyzing trace with hash -927054850, now seen corresponding path program 1 times [2023-11-19 08:04:40,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:40,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171075259] [2023-11-19 08:04:40,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:40,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:41,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:41,232 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:04:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:41,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171075259] [2023-11-19 08:04:41,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171075259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:41,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:41,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:04:41,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653075217] [2023-11-19 08:04:41,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:41,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:41,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:41,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:41,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:41,314 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.3125) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 08:04:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:04:41,495 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2023-11-19 08:04:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:41,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-19 08:04:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:04:41,511 INFO L225 Difference]: With dead ends: 37 [2023-11-19 08:04:41,511 INFO L226 Difference]: Without dead ends: 24 [2023-11-19 08:04:41,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:04:41,520 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:04:41,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:04:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-19 08:04:41,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2023-11-19 08:04:41,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-19 08:04:41,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-11-19 08:04:41,576 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 11 [2023-11-19 08:04:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:04:41,577 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-11-19 08:04:41,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 08:04:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-11-19 08:04:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-19 08:04:41,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:04:41,581 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:41,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:04:41,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:04:41,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1141956254, now seen corresponding path program 1 times [2023-11-19 08:04:41,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:41,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093444934] [2023-11-19 08:04:41,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:41,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:41,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:41,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-19 08:04:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 08:04:41,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:41,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093444934] [2023-11-19 08:04:41,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093444934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:04:41,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:04:41,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 08:04:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312552397] [2023-11-19 08:04:41,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:04:41,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:04:41,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:41,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:04:41,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:04:41,969 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 08:04:42,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:04:42,065 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2023-11-19 08:04:42,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:04:42,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 22 [2023-11-19 08:04:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:04:42,067 INFO L225 Difference]: With dead ends: 43 [2023-11-19 08:04:42,067 INFO L226 Difference]: Without dead ends: 24 [2023-11-19 08:04:42,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 08:04:42,071 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:04:42,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 08:04:42,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-19 08:04:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-11-19 08:04:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-19 08:04:42,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2023-11-19 08:04:42,081 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 22 [2023-11-19 08:04:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:04:42,082 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2023-11-19 08:04:42,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 08:04:42,083 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2023-11-19 08:04:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-19 08:04:42,084 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:04:42,085 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:42,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:04:42,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:04:42,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1444799936, now seen corresponding path program 1 times [2023-11-19 08:04:42,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:42,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077104167] [2023-11-19 08:04:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:42,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:42,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:42,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:42,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:42,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-19 08:04:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:42,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 08:04:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:42,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077104167] [2023-11-19 08:04:42,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077104167] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:04:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704959900] [2023-11-19 08:04:42,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:42,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:04:42,915 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:04:42,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:04:42,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 08:04:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:43,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-19 08:04:43,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:04:43,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 08:04:43,440 WARN L876 $PredicateComparison]: unable to prove that (exists ((func_to_recursive_line_20_to_21_0_~b.base Int)) (= (let ((.cse0 (store |c_old(#memory_int)| func_to_recursive_line_20_to_21_0_~b.base (store (select |c_old(#memory_int)| func_to_recursive_line_20_to_21_0_~b.base) |c_func_to_recursive_line_20_to_21_0_#in~b.offset| 1)))) (store .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1))))) |c_#memory_int|)) is different from true [2023-11-19 08:04:43,580 INFO L349 Elim1Store]: treesize reduction 30, result has 38.8 percent of original size [2023-11-19 08:04:43,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 67 [2023-11-19 08:04:43,637 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 08:04:43,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 5 [2023-11-19 08:04:43,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:04:43,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2023-11-19 08:04:43,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2023-11-19 08:04:43,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2023-11-19 08:04:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2023-11-19 08:04:43,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:04:44,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704959900] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:04:44,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 08:04:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 18 [2023-11-19 08:04:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882753611] [2023-11-19 08:04:44,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 08:04:44,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-19 08:04:44,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:44,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-19 08:04:44,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=298, Unknown=1, NotChecked=34, Total=380 [2023-11-19 08:04:44,289 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 16 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 08:04:44,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:04:44,710 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2023-11-19 08:04:44,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 08:04:44,710 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 16 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Word has length 27 [2023-11-19 08:04:44,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:04:44,712 INFO L225 Difference]: With dead ends: 48 [2023-11-19 08:04:44,712 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 08:04:44,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=438, Unknown=1, NotChecked=42, Total=552 [2023-11-19 08:04:44,714 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:04:44,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 152 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 31 Unchecked, 0.3s Time] [2023-11-19 08:04:44,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 08:04:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2023-11-19 08:04:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-19 08:04:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2023-11-19 08:04:44,722 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 27 [2023-11-19 08:04:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:04:44,722 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2023-11-19 08:04:44,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 16 states have internal predecessors, (34), 8 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 08:04:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2023-11-19 08:04:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-19 08:04:44,724 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:04:44,724 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:44,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 08:04:44,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:04:44,941 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:04:44,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:44,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1635249458, now seen corresponding path program 2 times [2023-11-19 08:04:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:44,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250273233] [2023-11-19 08:04:44,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:44,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:44,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:45,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:45,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:45,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:46,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-19 08:04:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 08:04:46,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:46,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250273233] [2023-11-19 08:04:46,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250273233] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:04:46,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953773077] [2023-11-19 08:04:46,012 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 08:04:46,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:04:46,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:04:46,014 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:04:46,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 08:04:46,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 08:04:46,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:04:46,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-19 08:04:46,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:04:46,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-19 08:04:46,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 08:04:46,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:04:46,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-19 08:04:46,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-19 08:04:46,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:04:47,740 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 08:04:47,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953773077] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:04:47,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:04:47,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 31 [2023-11-19 08:04:47,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479931761] [2023-11-19 08:04:47,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:04:47,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-19 08:04:47,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:47,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-19 08:04:47,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2023-11-19 08:04:47,745 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 31 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 27 states have internal predecessors, (42), 11 states have call successors, (14), 6 states have call predecessors, (14), 9 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-19 08:04:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:04:48,219 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2023-11-19 08:04:48,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 08:04:48,220 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 27 states have internal predecessors, (42), 11 states have call successors, (14), 6 states have call predecessors, (14), 9 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 32 [2023-11-19 08:04:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:04:48,222 INFO L225 Difference]: With dead ends: 53 [2023-11-19 08:04:48,222 INFO L226 Difference]: Without dead ends: 30 [2023-11-19 08:04:48,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2023-11-19 08:04:48,225 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:04:48,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 121 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 08:04:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-11-19 08:04:48,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-11-19 08:04:48,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 7 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-19 08:04:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2023-11-19 08:04:48,242 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 32 [2023-11-19 08:04:48,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:04:48,243 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2023-11-19 08:04:48,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 27 states have internal predecessors, (42), 11 states have call successors, (14), 6 states have call predecessors, (14), 9 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-19 08:04:48,243 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2023-11-19 08:04:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-19 08:04:48,245 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:04:48,246 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:48,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-19 08:04:48,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:04:48,479 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:04:48,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash -2140733182, now seen corresponding path program 3 times [2023-11-19 08:04:48,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:48,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728489348] [2023-11-19 08:04:48,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:48,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:48,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:49,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:49,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:49,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:49,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-19 08:04:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:50,089 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-19 08:04:50,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:50,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728489348] [2023-11-19 08:04:50,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728489348] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:04:50,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698701753] [2023-11-19 08:04:50,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 08:04:50,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:04:50,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:04:50,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:04:50,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 08:04:50,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-19 08:04:50,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:04:50,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-19 08:04:50,232 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:04:50,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 08:04:50,690 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-19 08:04:50,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:04:53,032 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 46 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-19 08:04:53,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698701753] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 08:04:53,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 08:04:53,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 22] total 41 [2023-11-19 08:04:53,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571413202] [2023-11-19 08:04:53,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 08:04:53,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-19 08:04:53,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:04:53,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-19 08:04:53,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=1355, Unknown=0, NotChecked=0, Total=1640 [2023-11-19 08:04:53,038 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 41 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 35 states have internal predecessors, (50), 13 states have call successors, (16), 8 states have call predecessors, (16), 13 states have return successors, (19), 10 states have call predecessors, (19), 13 states have call successors, (19) [2023-11-19 08:04:53,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:04:53,653 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2023-11-19 08:04:53,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 08:04:53,656 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 35 states have internal predecessors, (50), 13 states have call successors, (16), 8 states have call predecessors, (16), 13 states have return successors, (19), 10 states have call predecessors, (19), 13 states have call successors, (19) Word has length 42 [2023-11-19 08:04:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:04:53,657 INFO L225 Difference]: With dead ends: 61 [2023-11-19 08:04:53,658 INFO L226 Difference]: Without dead ends: 34 [2023-11-19 08:04:53,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=403, Invalid=1949, Unknown=0, NotChecked=0, Total=2352 [2023-11-19 08:04:53,660 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 31 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-19 08:04:53,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 203 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-19 08:04:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-19 08:04:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-11-19 08:04:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-19 08:04:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2023-11-19 08:04:53,668 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 42 [2023-11-19 08:04:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:04:53,669 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2023-11-19 08:04:53,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 35 states have internal predecessors, (50), 13 states have call successors, (16), 8 states have call predecessors, (16), 13 states have return successors, (19), 10 states have call predecessors, (19), 13 states have call successors, (19) [2023-11-19 08:04:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2023-11-19 08:04:53,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-19 08:04:53,671 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:04:53,672 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:04:53,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 08:04:53,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:04:53,893 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:04:53,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:04:53,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1019454254, now seen corresponding path program 4 times [2023-11-19 08:04:53,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:04:53,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580165545] [2023-11-19 08:04:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:04:53,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:04:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:54,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:54,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:54,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:55,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:55,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:55,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:55,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:55,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:55,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:56,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:04:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:56,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:04:56,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:04:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-11-19 08:04:56,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:04:56,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580165545] [2023-11-19 08:04:56,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580165545] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:04:56,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970853210] [2023-11-19 08:04:56,191 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-19 08:04:56,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:04:56,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:04:56,197 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:04:56,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 08:04:56,315 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-19 08:04:56,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:04:56,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-19 08:04:56,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:04:56,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2023-11-19 08:04:56,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 08:04:58,688 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_20_to_21_0_#in~a.offset| c_func_to_recursive_line_20_to_21_0_~a.offset) (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_23| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| .cse0))))) (= c_func_to_recursive_line_20_to_21_0_~a.base |c_func_to_recursive_line_20_to_21_0_#in~a.base|)) is different from false [2023-11-19 08:05:00,690 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_20_to_21_0_#in~a.offset| c_func_to_recursive_line_20_to_21_0_~a.offset) (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_23| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| .cse0))))) (= c_func_to_recursive_line_20_to_21_0_~a.base |c_func_to_recursive_line_20_to_21_0_#in~a.base|)) is different from true [2023-11-19 08:05:02,721 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_3 (Array Int Int))) (= (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| v_DerPreprocessor_3))) (store .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_247| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_23| |v_#memory_int_247|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse2 (select |v_#memory_int_247| .cse2)) |v_#memory_int_247|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| .cse2)))) (= (store |v_#memory_int_247| |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse3 (select |v_#memory_int_247| |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1)))) |c_#memory_int|)))) is different from false [2023-11-19 08:05:03,425 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((v_DerPreprocessor_3 (Array Int Int))) (= (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| v_DerPreprocessor_3))) (store .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_247| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_23| |v_#memory_int_247|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse2 (select |v_#memory_int_247| .cse2)) |v_#memory_int_247|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| .cse2)))) (= (store |v_#memory_int_247| |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse3 (select |v_#memory_int_247| |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1)))) |c_#memory_int|)))) is different from true [2023-11-19 08:05:03,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 08:05:03,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 90 [2023-11-19 08:05:03,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-11-19 08:05:03,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 14 [2023-11-19 08:05:03,603 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:05:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 77 trivial. 2 not checked. [2023-11-19 08:05:03,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:05:04,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970853210] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:04,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 08:05:04,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 19 [2023-11-19 08:05:04,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347218271] [2023-11-19 08:05:04,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 08:05:04,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-19 08:05:04,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:04,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-19 08:05:04,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=281, Unknown=9, NotChecked=70, Total=420 [2023-11-19 08:05:04,066 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 19 states, 14 states have (on average 2.0) internal successors, (28), 16 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-19 08:05:06,215 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_20_to_21_0_#in~a.offset| c_func_to_recursive_line_20_to_21_0_~a.offset) (= (store |c_old(#memory_int)| c_func_to_recursive_line_20_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_20_to_21_0_~b.base)) |c_#memory_int|) (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_23| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| .cse0))))) (= c_func_to_recursive_line_20_to_21_0_~b.base |c_func_to_recursive_line_20_to_21_0_#in~b.base|) (= c_func_to_recursive_line_20_to_21_0_~a.base |c_func_to_recursive_line_20_to_21_0_#in~a.base|)) is different from false [2023-11-19 08:05:06,218 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_20_to_21_0_#in~a.offset| c_func_to_recursive_line_20_to_21_0_~a.offset) (= (store |c_old(#memory_int)| c_func_to_recursive_line_20_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_20_to_21_0_~b.base)) |c_#memory_int|) (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_23| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| .cse0))))) (= c_func_to_recursive_line_20_to_21_0_~b.base |c_func_to_recursive_line_20_to_21_0_#in~b.base|) (= c_func_to_recursive_line_20_to_21_0_~a.base |c_func_to_recursive_line_20_to_21_0_#in~a.base|)) is different from true [2023-11-19 08:05:08,222 WARN L854 $PredicateComparison]: unable to prove that (and (or (< (select (select |c_#memory_int| c_func_to_recursive_line_20_to_21_0_~a.base) c_func_to_recursive_line_20_to_21_0_~a.offset) 2) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| |c_func_to_recursive_line_20_to_21_0_#in~a.base|) (and (= |c_func_to_recursive_line_20_to_21_0_#in~a.offset| c_func_to_recursive_line_20_to_21_0_~a.offset) (not (= (select (select |c_old(#memory_int)| c_func_to_recursive_line_20_to_21_0_~a.base) c_func_to_recursive_line_20_to_21_0_~a.offset) 0)) (= c_func_to_recursive_line_20_to_21_0_~a.base |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (or (exists ((v_DerPreprocessor_3 (Array Int Int))) (= (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| v_DerPreprocessor_3))) (store .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_247| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_23| |v_#memory_int_247|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse2 (select |v_#memory_int_247| .cse2)) |v_#memory_int_247|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| .cse2)))) (= (store |v_#memory_int_247| |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse3 (select |v_#memory_int_247| |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1)))) |c_#memory_int|))))) is different from false [2023-11-19 08:05:08,226 WARN L876 $PredicateComparison]: unable to prove that (and (or (< (select (select |c_#memory_int| c_func_to_recursive_line_20_to_21_0_~a.base) c_func_to_recursive_line_20_to_21_0_~a.offset) 2) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| |c_func_to_recursive_line_20_to_21_0_#in~a.base|) (and (= |c_func_to_recursive_line_20_to_21_0_#in~a.offset| c_func_to_recursive_line_20_to_21_0_~a.offset) (not (= (select (select |c_old(#memory_int)| c_func_to_recursive_line_20_to_21_0_~a.base) c_func_to_recursive_line_20_to_21_0_~a.offset) 0)) (= c_func_to_recursive_line_20_to_21_0_~a.base |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (or (exists ((v_DerPreprocessor_3 (Array Int Int))) (= (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| v_DerPreprocessor_3))) (store .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_247| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_23| |v_#memory_int_247|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse2 (select |v_#memory_int_247| .cse2)) |v_#memory_int_247|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| .cse2)))) (= (store |v_#memory_int_247| |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse3 (select |v_#memory_int_247| |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1)))) |c_#memory_int|))))) is different from true [2023-11-19 08:05:10,230 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array Int Int))) (= (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| v_DerPreprocessor_3))) (store .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_247| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_23| |v_#memory_int_247|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse2 (select |v_#memory_int_247| .cse2)) |v_#memory_int_247|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| .cse2)))) (= (store |v_#memory_int_247| |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse3 (select |v_#memory_int_247| |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1)))) |c_#memory_int|)))) (or (not (= (select (select |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~a.base|) |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 0)) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) is different from false [2023-11-19 08:05:10,233 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((v_DerPreprocessor_3 (Array Int Int))) (= (let ((.cse0 (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| v_DerPreprocessor_3))) (store .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse1 (select .cse0 |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse1 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1))))) |c_#memory_int|)) (exists ((|v_#memory_int_247| (Array Int (Array Int Int)))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_23| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_23| |v_#memory_int_247|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_23| .cse2 (select |v_#memory_int_247| .cse2)) |v_#memory_int_247|) (= |v_old(#memory_int)_AFTER_CALL_23| (store |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_23| |c_func_to_recursive_line_20_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| .cse2)))) (= (store |v_#memory_int_247| |c_func_to_recursive_line_20_to_21_0_#in~a.base| (let ((.cse3 (select |v_#memory_int_247| |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) (store .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.offset| (+ (select .cse3 |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 1)))) |c_#memory_int|)))) (or (not (= (select (select |c_old(#memory_int)| |c_func_to_recursive_line_20_to_21_0_#in~a.base|) |c_func_to_recursive_line_20_to_21_0_#in~a.offset|) 0)) (= |c_func_to_recursive_line_20_to_21_0_#in~b.base| |c_func_to_recursive_line_20_to_21_0_#in~a.base|))) is different from true [2023-11-19 08:05:10,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:10,258 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2023-11-19 08:05:10,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 08:05:10,258 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 14 states have (on average 2.0) internal successors, (28), 16 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 52 [2023-11-19 08:05:10,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:05:10,260 INFO L225 Difference]: With dead ends: 42 [2023-11-19 08:05:10,260 INFO L226 Difference]: Without dead ends: 37 [2023-11-19 08:05:10,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 65 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=87, Invalid=338, Unknown=15, NotChecked=210, Total=650 [2023-11-19 08:05:10,261 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 08:05:10,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 150 Unchecked, 0.1s Time] [2023-11-19 08:05:10,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-19 08:05:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2023-11-19 08:05:10,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 23 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-11-19 08:05:10,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2023-11-19 08:05:10,270 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 52 [2023-11-19 08:05:10,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:05:10,271 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2023-11-19 08:05:10,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 14 states have (on average 2.0) internal successors, (28), 16 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2023-11-19 08:05:10,271 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2023-11-19 08:05:10,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-19 08:05:10,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:05:10,275 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:10,301 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 08:05:10,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 08:05:10,495 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:05:10,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash -760270906, now seen corresponding path program 5 times [2023-11-19 08:05:10,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:10,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631631125] [2023-11-19 08:05:10,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:10,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:10,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:11,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:12,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:13,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:13,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:13,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:13,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:13,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:13,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:05:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:14,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:14,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:15,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:15,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:15,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:15,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:15,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:15,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:15,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:05:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 19 proven. 65 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2023-11-19 08:05:15,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:15,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631631125] [2023-11-19 08:05:15,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631631125] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:15,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401279822] [2023-11-19 08:05:15,696 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-19 08:05:15,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 08:05:15,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:15,701 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 08:05:15,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 08:05:16,262 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2023-11-19 08:05:16,262 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:05:16,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 129 conjunts are in the unsatisfiable core [2023-11-19 08:05:16,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:05:16,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-19 08:05:16,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 08:05:16,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-19 08:05:17,000 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-19 08:05:17,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2023-11-19 08:05:17,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 08:05:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 229 proven. 88 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-11-19 08:05:17,162 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 08:05:17,953 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:17,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-19 08:05:17,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2023-11-19 08:05:17,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 08:05:18,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:18,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-11-19 08:05:18,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 08:05:18,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2023-11-19 08:05:18,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-19 08:05:19,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401279822] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 08:05:19,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 08:05:19,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2023-11-19 08:05:19,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417064799] [2023-11-19 08:05:19,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 08:05:19,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-19 08:05:19,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:19,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-19 08:05:19,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1633, Unknown=6, NotChecked=0, Total=1806 [2023-11-19 08:05:19,285 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 37 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 33 states have internal predecessors, (51), 14 states have call successors, (15), 2 states have call predecessors, (15), 13 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) [2023-11-19 08:05:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 08:05:21,314 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2023-11-19 08:05:21,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-19 08:05:21,315 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 33 states have internal predecessors, (51), 14 states have call successors, (15), 2 states have call predecessors, (15), 13 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) Word has length 93 [2023-11-19 08:05:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 08:05:21,318 INFO L225 Difference]: With dead ends: 74 [2023-11-19 08:05:21,318 INFO L226 Difference]: Without dead ends: 70 [2023-11-19 08:05:21,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 132 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1598 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=523, Invalid=4873, Unknown=6, NotChecked=0, Total=5402 [2023-11-19 08:05:21,322 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 78 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-19 08:05:21,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 300 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-19 08:05:21,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-19 08:05:21,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2023-11-19 08:05:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 32 states have internal predecessors, (35), 5 states have call successors, (5), 3 states have call predecessors, (5), 15 states have return successors, (25), 16 states have call predecessors, (25), 5 states have call successors, (25) [2023-11-19 08:05:21,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2023-11-19 08:05:21,339 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 93 [2023-11-19 08:05:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 08:05:21,340 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2023-11-19 08:05:21,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 33 states have internal predecessors, (51), 14 states have call successors, (15), 2 states have call predecessors, (15), 13 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) [2023-11-19 08:05:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2023-11-19 08:05:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-19 08:05:21,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 08:05:21,343 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:21,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 08:05:21,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7abf23b3-057c-4fed-87ce-b05c1d45d2f8/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-19 08:05:21,566 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 08:05:21,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:21,567 INFO L85 PathProgramCache]: Analyzing trace with hash -760268984, now seen corresponding path program 1 times [2023-11-19 08:05:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:21,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820470341] [2023-11-19 08:05:21,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:22,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:23,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:23,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:24,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:24,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:24,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:24,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:24,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:24,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-19 08:05:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:25,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:25,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:25,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:25,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:25,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:25,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 08:05:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat