./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc 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_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 07:06:16,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 07:06:16,740 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-29 07:06:16,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 07:06:16,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 07:06:16,767 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 07:06:16,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 07:06:16,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 07:06:16,768 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 07:06:16,769 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 07:06:16,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 07:06:16,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 07:06:16,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 07:06:16,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 07:06:16,772 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 07:06:16,772 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 07:06:16,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 07:06:16,773 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 07:06:16,773 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 07:06:16,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 07:06:16,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 07:06:16,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 07:06:16,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 07:06:16,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 07:06:16,776 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 07:06:16,776 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 07:06:16,777 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 07:06:16,777 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 07:06:16,777 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 07:06:16,778 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 07:06:16,778 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 07:06:16,778 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 07:06:16,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 07:06:16,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:06:16,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 07:06:16,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 07:06:16,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 07:06:16,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 07:06:16,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 07:06:16,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 07:06:16,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 07:06:16,780 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 07:06:16,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 07:06:16,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 07:06:16,781 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_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/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_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya 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 ! overflow) ) 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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2023-11-29 07:06:16,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 07:06:17,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 07:06:17,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 07:06:17,017 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 07:06:17,017 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 07:06:17,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2023-11-29 07:06:19,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 07:06:19,953 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 07:06:19,953 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2023-11-29 07:06:19,960 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/data/0d4ffcc22/9268941359f843c3a280ba36158df937/FLAG528f91ebc [2023-11-29 07:06:19,974 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/data/0d4ffcc22/9268941359f843c3a280ba36158df937 [2023-11-29 07:06:19,977 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 07:06:19,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 07:06:19,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 07:06:19,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 07:06:19,984 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 07:06:19,985 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:19,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2565985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:19, skipping insertion in model container [2023-11-29 07:06:19,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:06:19" (1/1) ... [2023-11-29 07:06:20,014 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 07:06:20,172 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:06:20,182 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 07:06:20,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 07:06:20,218 INFO L206 MainTranslator]: Completed translation [2023-11-29 07:06:20,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20 WrapperNode [2023-11-29 07:06:20,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 07:06:20,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 07:06:20,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 07:06:20,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 07:06:20,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (1/1) ... [2023-11-29 07:06:20,235 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (1/1) ... [2023-11-29 07:06:20,255 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2023-11-29 07:06:20,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 07:06:20,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 07:06:20,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 07:06:20,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 07:06:20,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (1/1) ... [2023-11-29 07:06:20,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (1/1) ... [2023-11-29 07:06:20,272 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (1/1) ... [2023-11-29 07:06:20,294 INFO L175 MemorySlicer]: Split 32 memory accesses to 6 slices as follows [2, 6, 6, 6, 6, 6]. 19 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 1, 1, 1, 1, 1]. The 10 writes are split as follows [0, 2, 2, 2, 2, 2]. [2023-11-29 07:06:20,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (1/1) ... [2023-11-29 07:06:20,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (1/1) ... [2023-11-29 07:06:20,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (1/1) ... [2023-11-29 07:06:20,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (1/1) ... [2023-11-29 07:06:20,307 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (1/1) ... [2023-11-29 07:06:20,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (1/1) ... [2023-11-29 07:06:20,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 07:06:20,314 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 07:06:20,314 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 07:06:20,314 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 07:06:20,315 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (1/1) ... [2023-11-29 07:06:20,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 07:06:20,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:20,343 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 07:06:20,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 07:06:20,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 07:06:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 07:06:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 07:06:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 07:06:20,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 07:06:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 07:06:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 07:06:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 07:06:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 07:06:20,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 07:06:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 07:06:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 07:06:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 07:06:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 07:06:20,378 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2023-11-29 07:06:20,378 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2023-11-29 07:06:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2023-11-29 07:06:20,379 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2023-11-29 07:06:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2023-11-29 07:06:20,379 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2023-11-29 07:06:20,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 07:06:20,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 07:06:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 07:06:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 07:06:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 07:06:20,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 07:06:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 07:06:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 07:06:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2023-11-29 07:06:20,381 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2023-11-29 07:06:20,381 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2023-11-29 07:06:20,381 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2023-11-29 07:06:20,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 07:06:20,493 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 07:06:20,495 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 07:06:20,731 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 07:06:20,763 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 07:06:20,763 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 07:06:20,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:06:20 BoogieIcfgContainer [2023-11-29 07:06:20,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 07:06:20,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 07:06:20,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 07:06:20,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 07:06:20,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:06:19" (1/3) ... [2023-11-29 07:06:20,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfecae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:06:20, skipping insertion in model container [2023-11-29 07:06:20,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:06:20" (2/3) ... [2023-11-29 07:06:20,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfecae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:06:20, skipping insertion in model container [2023-11-29 07:06:20,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:06:20" (3/3) ... [2023-11-29 07:06:20,773 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2023-11-29 07:06:20,788 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 07:06:20,788 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-11-29 07:06:20,830 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 07:06:20,836 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;@5b0ac504, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 07:06:20,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-29 07:06:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 40 states have (on average 1.5) internal successors, (60), 55 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 07:06:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 07:06:20,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:20,847 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:20,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:20,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:20,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2007023355, now seen corresponding path program 1 times [2023-11-29 07:06:20,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:20,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238619706] [2023-11-29 07:06:20,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:20,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:21,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:21,347 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-29 07:06:21,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:21,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238619706] [2023-11-29 07:06:21,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238619706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:21,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:06:21,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:06:21,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992317609] [2023-11-29 07:06:21,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:21,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:06:21,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:21,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:06:21,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:06:21,387 INFO L87 Difference]: Start difference. First operand has 66 states, 40 states have (on average 1.5) internal successors, (60), 55 states have internal predecessors, (60), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 07:06:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:21,733 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2023-11-29 07:06:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:06:21,736 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-11-29 07:06:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:21,743 INFO L225 Difference]: With dead ends: 98 [2023-11-29 07:06:21,743 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 07:06:21,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:06:21,749 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 46 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:21,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 243 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:06:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 07:06:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2023-11-29 07:06:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.411764705882353) internal successors, (48), 47 states have internal predecessors, (48), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 07:06:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2023-11-29 07:06:21,789 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 11 [2023-11-29 07:06:21,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:21,789 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2023-11-29 07:06:21,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 07:06:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2023-11-29 07:06:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 07:06:21,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:21,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:21,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 07:06:21,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:21,792 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:21,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1663685642, now seen corresponding path program 1 times [2023-11-29 07:06:21,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:21,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004404480] [2023-11-29 07:06:21,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:21,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:06:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:21,999 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-29 07:06:22,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:22,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004404480] [2023-11-29 07:06:22,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004404480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:22,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:06:22,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:06:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482209823] [2023-11-29 07:06:22,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:22,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:06:22,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:22,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:06:22,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:06:22,003 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 07:06:22,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:22,249 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2023-11-29 07:06:22,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:06:22,251 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-29 07:06:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:22,253 INFO L225 Difference]: With dead ends: 130 [2023-11-29 07:06:22,253 INFO L226 Difference]: Without dead ends: 76 [2023-11-29 07:06:22,255 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-29 07:06:22,257 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:22,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 144 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 07:06:22,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-11-29 07:06:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 61. [2023-11-29 07:06:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.4) internal successors, (49), 48 states have internal predecessors, (49), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-11-29 07:06:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2023-11-29 07:06:22,272 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 14 [2023-11-29 07:06:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:22,272 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2023-11-29 07:06:22,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 07:06:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2023-11-29 07:06:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 07:06:22,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:22,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:22,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 07:06:22,275 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:22,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:22,276 INFO L85 PathProgramCache]: Analyzing trace with hash 498483849, now seen corresponding path program 1 times [2023-11-29 07:06:22,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:22,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236579862] [2023-11-29 07:06:22,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:22,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:22,467 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-29 07:06:22,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:22,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236579862] [2023-11-29 07:06:22,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236579862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:22,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:06:22,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:06:22,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486008434] [2023-11-29 07:06:22,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:22,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:06:22,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:22,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:06:22,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:06:22,470 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:06:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:22,548 INFO L93 Difference]: Finished difference Result 122 states and 149 transitions. [2023-11-29 07:06:22,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:06:22,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 07:06:22,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:22,550 INFO L225 Difference]: With dead ends: 122 [2023-11-29 07:06:22,551 INFO L226 Difference]: Without dead ends: 66 [2023-11-29 07:06:22,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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-29 07:06:22,553 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 6 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:22,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 266 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:06:22,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-29 07:06:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2023-11-29 07:06:22,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 38 states have (on average 1.368421052631579) internal successors, (52), 50 states have internal predecessors, (52), 11 states have call successors, (11), 7 states have call predecessors, (11), 5 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-11-29 07:06:22,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2023-11-29 07:06:22,564 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 17 [2023-11-29 07:06:22,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:22,565 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2023-11-29 07:06:22,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:06:22,565 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2023-11-29 07:06:22,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 07:06:22,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:22,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:22,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 07:06:22,566 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:22,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:22,567 INFO L85 PathProgramCache]: Analyzing trace with hash 504798164, now seen corresponding path program 1 times [2023-11-29 07:06:22,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:22,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598768460] [2023-11-29 07:06:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:22,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:22,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:22,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:22,714 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-29 07:06:22,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:22,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598768460] [2023-11-29 07:06:22,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598768460] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:22,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:06:22,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:06:22,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914420420] [2023-11-29 07:06:22,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:22,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:06:22,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:22,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:06:22,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:06:22,717 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 07:06:22,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:22,911 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2023-11-29 07:06:22,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:06:22,912 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2023-11-29 07:06:22,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:22,914 INFO L225 Difference]: With dead ends: 89 [2023-11-29 07:06:22,914 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 07:06:22,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:06:22,915 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:22,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 222 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:22,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 07:06:22,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2023-11-29 07:06:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 55 states have internal predecessors, (58), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-29 07:06:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2023-11-29 07:06:22,928 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 17 [2023-11-29 07:06:22,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:22,929 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2023-11-29 07:06:22,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 07:06:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2023-11-29 07:06:22,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-29 07:06:22,930 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:22,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:22,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 07:06:22,930 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:22,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:22,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1726869798, now seen corresponding path program 1 times [2023-11-29 07:06:22,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:22,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883158280] [2023-11-29 07:06:22,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:22,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,002 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-29 07:06:23,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:23,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883158280] [2023-11-29 07:06:23,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883158280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:23,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:06:23,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 07:06:23,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169985008] [2023-11-29 07:06:23,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:23,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 07:06:23,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:23,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 07:06:23,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:06:23,005 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:06:23,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:23,027 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2023-11-29 07:06:23,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 07:06:23,028 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-29 07:06:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:23,029 INFO L225 Difference]: With dead ends: 72 [2023-11-29 07:06:23,029 INFO L226 Difference]: Without dead ends: 71 [2023-11-29 07:06:23,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 07:06:23,031 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:23,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 160 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:06:23,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-29 07:06:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-29 07:06:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 54 states have internal predecessors, (57), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-29 07:06:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2023-11-29 07:06:23,041 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 18 [2023-11-29 07:06:23,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:23,041 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2023-11-29 07:06:23,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:06:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2023-11-29 07:06:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 07:06:23,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:23,043 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-29 07:06:23,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 07:06:23,043 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:23,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1851625347, now seen corresponding path program 1 times [2023-11-29 07:06:23,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:23,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323636119] [2023-11-29 07:06:23,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:23,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:06:23,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:23,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323636119] [2023-11-29 07:06:23,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323636119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:23,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:06:23,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:06:23,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654649879] [2023-11-29 07:06:23,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:23,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:06:23,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:23,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:06:23,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:06:23,229 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:06:23,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:23,315 INFO L93 Difference]: Finished difference Result 75 states and 89 transitions. [2023-11-29 07:06:23,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:06:23,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-29 07:06:23,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:23,317 INFO L225 Difference]: With dead ends: 75 [2023-11-29 07:06:23,318 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 07:06:23,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 07:06:23,319 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:23,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 209 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 07:06:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 07:06:23,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2023-11-29 07:06:23,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 52 states have internal predecessors, (55), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-29 07:06:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2023-11-29 07:06:23,330 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 22 [2023-11-29 07:06:23,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:23,330 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2023-11-29 07:06:23,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:06:23,331 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2023-11-29 07:06:23,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 07:06:23,332 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:23,332 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:23,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 07:06:23,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:23,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1813325083, now seen corresponding path program 1 times [2023-11-29 07:06:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:23,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245579916] [2023-11-29 07:06:23,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 07:06:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:06:23,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:23,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245579916] [2023-11-29 07:06:23,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245579916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:23,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267649102] [2023-11-29 07:06:23,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:23,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:23,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:23,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:23,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 07:06:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:23,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 07:06:23,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:23,743 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 15 treesize of output 1 [2023-11-29 07:06:23,839 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 17 treesize of output 9 [2023-11-29 07:06:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 07:06:23,855 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:23,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267649102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:23,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:23,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11 [2023-11-29 07:06:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361981637] [2023-11-29 07:06:23,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:23,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:06:23,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:06:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 07:06:23,858 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:06:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:24,001 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2023-11-29 07:06:24,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:06:24,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-29 07:06:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:24,002 INFO L225 Difference]: With dead ends: 70 [2023-11-29 07:06:24,003 INFO L226 Difference]: Without dead ends: 69 [2023-11-29 07:06:24,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-11-29 07:06:24,004 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 63 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:24,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 180 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-29 07:06:24,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-29 07:06:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.255813953488372) internal successors, (54), 51 states have internal predecessors, (54), 12 states have call successors, (12), 8 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-11-29 07:06:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2023-11-29 07:06:24,016 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 22 [2023-11-29 07:06:24,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:24,017 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2023-11-29 07:06:24,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:06:24,017 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2023-11-29 07:06:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 07:06:24,018 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:24,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-11-29 07:06:24,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 07:06:24,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:24,221 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:24,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:24,221 INFO L85 PathProgramCache]: Analyzing trace with hash 378502822, now seen corresponding path program 1 times [2023-11-29 07:06:24,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:24,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38425166] [2023-11-29 07:06:24,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:24,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:24,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:24,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 07:06:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 07:06:24,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:24,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38425166] [2023-11-29 07:06:24,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38425166] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:24,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218358797] [2023-11-29 07:06:24,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:24,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:24,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:24,423 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:24,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 07:06:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:24,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 07:06:24,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:24,630 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 15 treesize of output 7 [2023-11-29 07:06:24,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 07:06:24,644 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:24,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218358797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:24,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:24,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2023-11-29 07:06:24,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248052272] [2023-11-29 07:06:24,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:24,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:06:24,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:24,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:06:24,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 07:06:24,646 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:06:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:24,756 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2023-11-29 07:06:24,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:06:24,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-11-29 07:06:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:24,758 INFO L225 Difference]: With dead ends: 68 [2023-11-29 07:06:24,758 INFO L226 Difference]: Without dead ends: 67 [2023-11-29 07:06:24,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:06:24,759 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 50 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:24,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 168 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2023-11-29 07:06:24,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2023-11-29 07:06:24,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 38 states have (on average 1.263157894736842) internal successors, (48), 46 states have internal predecessors, (48), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (11), 9 states have call predecessors, (11), 9 states have call successors, (11) [2023-11-29 07:06:24,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2023-11-29 07:06:24,772 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 23 [2023-11-29 07:06:24,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:24,773 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2023-11-29 07:06:24,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:06:24,773 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2023-11-29 07:06:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 07:06:24,774 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:24,775 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, 1, 1, 1, 1, 1] [2023-11-29 07:06:24,781 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 07:06:24,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:24,981 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:24,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:24,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1633138441, now seen corresponding path program 1 times [2023-11-29 07:06:24,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:24,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620008274] [2023-11-29 07:06:24,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:24,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:06:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 07:06:25,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:25,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620008274] [2023-11-29 07:06:25,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620008274] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:25,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:06:25,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 07:06:25,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750229645] [2023-11-29 07:06:25,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:25,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:06:25,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:06:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 07:06:25,148 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:06:25,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:25,320 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2023-11-29 07:06:25,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:06:25,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2023-11-29 07:06:25,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:25,322 INFO L225 Difference]: With dead ends: 96 [2023-11-29 07:06:25,322 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 07:06:25,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-11-29 07:06:25,323 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 50 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:25,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 220 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:25,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 07:06:25,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2023-11-29 07:06:25,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 53 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 8 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2023-11-29 07:06:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 83 transitions. [2023-11-29 07:06:25,338 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 83 transitions. Word has length 27 [2023-11-29 07:06:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:25,338 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 83 transitions. [2023-11-29 07:06:25,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:06:25,339 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 83 transitions. [2023-11-29 07:06:25,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 07:06:25,340 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:25,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:25,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 07:06:25,341 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:25,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:25,341 INFO L85 PathProgramCache]: Analyzing trace with hash -301987700, now seen corresponding path program 1 times [2023-11-29 07:06:25,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:25,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981578928] [2023-11-29 07:06:25,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:25,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:25,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 07:06:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-29 07:06:25,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:25,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981578928] [2023-11-29 07:06:25,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981578928] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:25,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539565475] [2023-11-29 07:06:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:25,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:25,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:25,513 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:25,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 07:06:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 07:06:25,653 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:25,659 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-29 07:06:25,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 07:06:25,711 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:25,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539565475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:25,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:25,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2023-11-29 07:06:25,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816192757] [2023-11-29 07:06:25,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:25,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:06:25,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:25,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:06:25,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:06:25,713 INFO L87 Difference]: Start difference. First operand 71 states and 83 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:06:25,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:25,825 INFO L93 Difference]: Finished difference Result 146 states and 175 transitions. [2023-11-29 07:06:25,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:06:25,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-11-29 07:06:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:25,828 INFO L225 Difference]: With dead ends: 146 [2023-11-29 07:06:25,828 INFO L226 Difference]: Without dead ends: 75 [2023-11-29 07:06:25,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:06:25,829 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 24 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:25,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 117 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:25,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-29 07:06:25,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2023-11-29 07:06:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 51 states have internal predecessors, (54), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (13), 10 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-29 07:06:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2023-11-29 07:06:25,841 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 28 [2023-11-29 07:06:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:25,841 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2023-11-29 07:06:25,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 07:06:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2023-11-29 07:06:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-11-29 07:06:25,843 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:25,843 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:25,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 07:06:26,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:26,049 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:26,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:26,049 INFO L85 PathProgramCache]: Analyzing trace with hash -704784010, now seen corresponding path program 1 times [2023-11-29 07:06:26,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:26,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173864176] [2023-11-29 07:06:26,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:26,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:06:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 07:06:26,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-29 07:06:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:26,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173864176] [2023-11-29 07:06:26,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173864176] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:26,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053972367] [2023-11-29 07:06:26,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:26,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:26,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:26,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:26,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 07:06:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:26,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 07:06:26,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:26,596 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 15 treesize of output 1 [2023-11-29 07:06:26,828 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-29 07:06:26,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 07:06:27,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053972367] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:27,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:27,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2023-11-29 07:06:27,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842167678] [2023-11-29 07:06:27,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:27,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 07:06:27,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:27,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 07:06:27,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2023-11-29 07:06:27,246 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 25 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 22 states have internal predecessors, (51), 8 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 07:06:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:27,633 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2023-11-29 07:06:27,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 07:06:27,635 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 22 states have internal predecessors, (51), 8 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) Word has length 45 [2023-11-29 07:06:27,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:27,636 INFO L225 Difference]: With dead ends: 146 [2023-11-29 07:06:27,636 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 07:06:27,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2023-11-29 07:06:27,638 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 55 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:27,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 516 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:06:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 07:06:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2023-11-29 07:06:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 53 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (15), 12 states have call predecessors, (15), 10 states have call successors, (15) [2023-11-29 07:06:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2023-11-29 07:06:27,648 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 45 [2023-11-29 07:06:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:27,649 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2023-11-29 07:06:27,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 22 states have internal predecessors, (51), 8 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (9), 5 states have call predecessors, (9), 8 states have call successors, (9) [2023-11-29 07:06:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2023-11-29 07:06:27,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-29 07:06:27,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:27,651 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:27,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 07:06:27,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 07:06:27,857 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:27,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:27,857 INFO L85 PathProgramCache]: Analyzing trace with hash 62702726, now seen corresponding path program 2 times [2023-11-29 07:06:27,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:27,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317832820] [2023-11-29 07:06:27,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:27,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:06:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:28,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:28,257 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2023-11-29 07:06:28,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:28,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317832820] [2023-11-29 07:06:28,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317832820] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:28,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118747428] [2023-11-29 07:06:28,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:06:28,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:28,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:28,258 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:28,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 07:06:28,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:06:28,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:06:28,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 54 conjunts are in the unsatisfiable core [2023-11-29 07:06:28,456 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:28,464 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 15 treesize of output 1 [2023-11-29 07:06:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2023-11-29 07:06:28,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 3 proven. 124 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-29 07:06:30,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118747428] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:30,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:30,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 21] total 38 [2023-11-29 07:06:30,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357574449] [2023-11-29 07:06:30,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:30,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 07:06:30,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:30,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 07:06:30,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=1187, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 07:06:30,206 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 38 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 11 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2023-11-29 07:06:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:30,875 INFO L93 Difference]: Finished difference Result 154 states and 191 transitions. [2023-11-29 07:06:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 07:06:30,876 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 11 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) Word has length 73 [2023-11-29 07:06:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:30,877 INFO L225 Difference]: With dead ends: 154 [2023-11-29 07:06:30,877 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 07:06:30,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=373, Invalid=2279, Unknown=0, NotChecked=0, Total=2652 [2023-11-29 07:06:30,880 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 92 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:30,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 616 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 07:06:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 07:06:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2023-11-29 07:06:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 53 states have internal predecessors, (56), 12 states have call successors, (12), 8 states have call predecessors, (12), 10 states have return successors, (16), 13 states have call predecessors, (16), 10 states have call successors, (16) [2023-11-29 07:06:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2023-11-29 07:06:30,891 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 73 [2023-11-29 07:06:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:30,891 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2023-11-29 07:06:30,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 11 states have call successors, (20), 9 states have call predecessors, (20), 10 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2023-11-29 07:06:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2023-11-29 07:06:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-29 07:06:30,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:30,893 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:30,899 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 07:06:31,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 07:06:31,097 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:31,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:31,097 INFO L85 PathProgramCache]: Analyzing trace with hash -683302022, now seen corresponding path program 1 times [2023-11-29 07:06:31,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:31,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007278143] [2023-11-29 07:06:31,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:31,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 07:06:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2023-11-29 07:06:31,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:31,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007278143] [2023-11-29 07:06:31,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007278143] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:31,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:06:31,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 07:06:31,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759255060] [2023-11-29 07:06:31,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:31,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:06:31,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:31,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:06:31,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 07:06:31,291 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 07:06:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:31,375 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2023-11-29 07:06:31,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 07:06:31,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 88 [2023-11-29 07:06:31,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:31,377 INFO L225 Difference]: With dead ends: 80 [2023-11-29 07:06:31,377 INFO L226 Difference]: Without dead ends: 79 [2023-11-29 07:06:31,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 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-29 07:06:31,378 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 23 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:31,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 190 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:31,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-11-29 07:06:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2023-11-29 07:06:31,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 49 states have internal predecessors, (52), 11 states have call successors, (11), 8 states have call predecessors, (11), 10 states have return successors, (15), 12 states have call predecessors, (15), 9 states have call successors, (15) [2023-11-29 07:06:31,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2023-11-29 07:06:31,388 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 88 [2023-11-29 07:06:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:31,389 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2023-11-29 07:06:31,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 07:06:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2023-11-29 07:06:31,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 07:06:31,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:31,390 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:31,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 07:06:31,391 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:31,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash 217780949, now seen corresponding path program 1 times [2023-11-29 07:06:31,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:31,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278082736] [2023-11-29 07:06:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:31,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:06:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:31,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 07:06:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 07:06:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-11-29 07:06:31,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:31,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278082736] [2023-11-29 07:06:31,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278082736] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:31,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 07:06:31,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 07:06:31,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850346181] [2023-11-29 07:06:31,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:31,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:06:31,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:31,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:06:31,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 07:06:31,690 INFO L87 Difference]: Start difference. First operand 69 states and 78 transitions. Second operand has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 07:06:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:31,871 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2023-11-29 07:06:31,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:06:31,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 68 [2023-11-29 07:06:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:31,873 INFO L225 Difference]: With dead ends: 85 [2023-11-29 07:06:31,873 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 07:06:31,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2023-11-29 07:06:31,874 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 63 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:31,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 175 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:31,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 07:06:31,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2023-11-29 07:06:31,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 56 states have internal predecessors, (60), 12 states have call successors, (12), 9 states have call predecessors, (12), 12 states have return successors, (18), 13 states have call predecessors, (18), 10 states have call successors, (18) [2023-11-29 07:06:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 90 transitions. [2023-11-29 07:06:31,884 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 90 transitions. Word has length 68 [2023-11-29 07:06:31,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:31,885 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 90 transitions. [2023-11-29 07:06:31,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.857142857142857) internal successors, (27), 5 states have internal predecessors, (27), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-29 07:06:31,885 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 90 transitions. [2023-11-29 07:06:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 07:06:31,887 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:31,887 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:31,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 07:06:31,887 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:31,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:31,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1447143500, now seen corresponding path program 1 times [2023-11-29 07:06:31,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:31,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003805019] [2023-11-29 07:06:31,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:31,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:32,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:32,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:32,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:32,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:33,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 07:06:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 07:06:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 07:06:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 5 proven. 156 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2023-11-29 07:06:33,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:33,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003805019] [2023-11-29 07:06:33,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003805019] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:33,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277726945] [2023-11-29 07:06:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:33,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:33,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:33,394 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:33,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 07:06:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:33,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 07:06:33,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:33,722 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-29 07:06:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2023-11-29 07:06:34,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:34,523 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2023-11-29 07:06:34,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277726945] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:34,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:34,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 11] total 39 [2023-11-29 07:06:34,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66795383] [2023-11-29 07:06:34,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:34,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 07:06:34,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:34,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 07:06:34,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1336, Unknown=0, NotChecked=0, Total=1482 [2023-11-29 07:06:34,528 INFO L87 Difference]: Start difference. First operand 79 states and 90 transitions. Second operand has 39 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (28), 10 states have call predecessors, (28), 11 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2023-11-29 07:06:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:35,342 INFO L93 Difference]: Finished difference Result 164 states and 197 transitions. [2023-11-29 07:06:35,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 07:06:35,342 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (28), 10 states have call predecessors, (28), 11 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) Word has length 110 [2023-11-29 07:06:35,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:35,343 INFO L225 Difference]: With dead ends: 164 [2023-11-29 07:06:35,343 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 07:06:35,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=359, Invalid=3301, Unknown=0, NotChecked=0, Total=3660 [2023-11-29 07:06:35,346 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 137 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:35,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 437 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:06:35,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 07:06:35,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2023-11-29 07:06:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.169811320754717) internal successors, (62), 58 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 14 states have return successors, (20), 15 states have call predecessors, (20), 10 states have call successors, (20) [2023-11-29 07:06:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2023-11-29 07:06:35,354 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 110 [2023-11-29 07:06:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:35,355 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2023-11-29 07:06:35,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 31 states have (on average 2.5161290322580645) internal successors, (78), 31 states have internal predecessors, (78), 15 states have call successors, (28), 10 states have call predecessors, (28), 11 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2023-11-29 07:06:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2023-11-29 07:06:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2023-11-29 07:06:35,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:35,357 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 20, 20, 20, 20, 20, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:35,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 07:06:35,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:35,557 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:35,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:35,558 INFO L85 PathProgramCache]: Analyzing trace with hash -923254132, now seen corresponding path program 2 times [2023-11-29 07:06:35,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:35,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523038832] [2023-11-29 07:06:35,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:35,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:35,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:36,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:37,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:37,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:37,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:37,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:37,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 07:06:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 23 proven. 605 refuted. 0 times theorem prover too weak. 1141 trivial. 0 not checked. [2023-11-29 07:06:38,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:38,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523038832] [2023-11-29 07:06:38,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523038832] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:38,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403000033] [2023-11-29 07:06:38,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:06:38,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:38,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:38,292 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:38,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 07:06:38,577 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:06:38,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:06:38,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 07:06:38,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:38,615 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 15 treesize of output 1 [2023-11-29 07:06:38,902 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 17 treesize of output 9 [2023-11-29 07:06:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1769 backedges. 937 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2023-11-29 07:06:38,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:38,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403000033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:38,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:38,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [19] total 24 [2023-11-29 07:06:38,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746977661] [2023-11-29 07:06:38,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:38,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 07:06:38,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:38,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 07:06:38,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2023-11-29 07:06:38,923 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 07:06:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:39,031 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2023-11-29 07:06:39,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 07:06:39,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 220 [2023-11-29 07:06:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:39,033 INFO L225 Difference]: With dead ends: 86 [2023-11-29 07:06:39,033 INFO L226 Difference]: Without dead ends: 85 [2023-11-29 07:06:39,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2023-11-29 07:06:39,035 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 47 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:39,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 156 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:06:39,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-29 07:06:39,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2023-11-29 07:06:39,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.150943396226415) internal successors, (61), 57 states have internal predecessors, (61), 12 states have call successors, (12), 9 states have call predecessors, (12), 14 states have return successors, (20), 15 states have call predecessors, (20), 10 states have call successors, (20) [2023-11-29 07:06:39,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2023-11-29 07:06:39,046 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 220 [2023-11-29 07:06:39,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:39,047 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2023-11-29 07:06:39,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 07:06:39,047 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2023-11-29 07:06:39,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2023-11-29 07:06:39,050 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:39,050 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 20, 20, 20, 20, 20, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:39,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 07:06:39,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-29 07:06:39,251 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:39,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1443893034, now seen corresponding path program 1 times [2023-11-29 07:06:39,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:39,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987621456] [2023-11-29 07:06:39,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-29 07:06:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:40,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:40,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:40,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:40,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:40,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:40,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:40,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:41,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 07:06:41,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 23 proven. 605 refuted. 0 times theorem prover too weak. 1142 trivial. 0 not checked. [2023-11-29 07:06:41,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:41,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987621456] [2023-11-29 07:06:41,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987621456] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:41,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490755230] [2023-11-29 07:06:41,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:41,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:41,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:41,206 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:41,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 07:06:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:41,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 07:06:41,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:41,783 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 15 treesize of output 7 [2023-11-29 07:06:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 937 proven. 0 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2023-11-29 07:06:41,804 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:06:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490755230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:06:41,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:06:41,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2023-11-29 07:06:41,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413309922] [2023-11-29 07:06:41,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:06:41,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:06:41,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:41,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:06:41,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-11-29 07:06:41,807 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 07:06:43,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 07:06:43,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:43,189 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2023-11-29 07:06:43,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:06:43,189 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 221 [2023-11-29 07:06:43,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:43,191 INFO L225 Difference]: With dead ends: 82 [2023-11-29 07:06:43,191 INFO L226 Difference]: Without dead ends: 81 [2023-11-29 07:06:43,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2023-11-29 07:06:43,192 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:43,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 1 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 07:06:43,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-29 07:06:43,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2023-11-29 07:06:43,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 11 states have call successors, (11), 9 states have call predecessors, (11), 14 states have return successors, (19), 14 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-29 07:06:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2023-11-29 07:06:43,202 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 221 [2023-11-29 07:06:43,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:43,203 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2023-11-29 07:06:43,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2023-11-29 07:06:43,204 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2023-11-29 07:06:43,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2023-11-29 07:06:43,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:43,207 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 20, 20, 20, 20, 20, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:43,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 07:06:43,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 07:06:43,409 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:43,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:43,409 INFO L85 PathProgramCache]: Analyzing trace with hash -229887225, now seen corresponding path program 1 times [2023-11-29 07:06:43,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:43,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753520620] [2023-11-29 07:06:43,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:43,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:43,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:06:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:44,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:44,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:45,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:45,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 07:06:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2023-11-29 07:06:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:45,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:45,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 07:06:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 07:06:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1798 backedges. 25 proven. 613 refuted. 0 times theorem prover too weak. 1160 trivial. 0 not checked. [2023-11-29 07:06:45,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:45,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753520620] [2023-11-29 07:06:45,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753520620] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:45,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621665641] [2023-11-29 07:06:45,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:45,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:45,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:45,903 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:45,903 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 07:06:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:46,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 80 conjunts are in the unsatisfiable core [2023-11-29 07:06:46,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:46,175 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 15 treesize of output 1 [2023-11-29 07:06:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1798 backedges. 1170 proven. 35 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2023-11-29 07:06:46,716 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:50,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1798 backedges. 470 proven. 314 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2023-11-29 07:06:50,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621665641] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:50,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:50,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 31] total 53 [2023-11-29 07:06:50,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705728551] [2023-11-29 07:06:50,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:50,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-29 07:06:50,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:50,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-29 07:06:50,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=2288, Unknown=0, NotChecked=0, Total=2756 [2023-11-29 07:06:50,412 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand has 53 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 44 states have internal predecessors, (109), 13 states have call successors, (36), 11 states have call predecessors, (36), 15 states have return successors, (34), 13 states have call predecessors, (34), 13 states have call successors, (34) [2023-11-29 07:06:51,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:51,164 INFO L93 Difference]: Finished difference Result 158 states and 187 transitions. [2023-11-29 07:06:51,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 07:06:51,164 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 44 states have internal predecessors, (109), 13 states have call successors, (36), 11 states have call predecessors, (36), 15 states have return successors, (34), 13 states have call predecessors, (34), 13 states have call successors, (34) Word has length 243 [2023-11-29 07:06:51,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:51,165 INFO L225 Difference]: With dead ends: 158 [2023-11-29 07:06:51,165 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 07:06:51,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 517 SyntacticMatches, 6 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1534 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=723, Invalid=3183, Unknown=0, NotChecked=0, Total=3906 [2023-11-29 07:06:51,167 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 50 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:51,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 736 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 07:06:51,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 07:06:51,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2023-11-29 07:06:51,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.1372549019607843) internal successors, (58), 54 states have internal predecessors, (58), 11 states have call successors, (11), 9 states have call predecessors, (11), 15 states have return successors, (20), 15 states have call predecessors, (20), 9 states have call successors, (20) [2023-11-29 07:06:51,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2023-11-29 07:06:51,175 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 243 [2023-11-29 07:06:51,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:51,175 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2023-11-29 07:06:51,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 42 states have (on average 2.5952380952380953) internal successors, (109), 44 states have internal predecessors, (109), 13 states have call successors, (36), 11 states have call predecessors, (36), 15 states have return successors, (34), 13 states have call predecessors, (34), 13 states have call successors, (34) [2023-11-29 07:06:51,175 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2023-11-29 07:06:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2023-11-29 07:06:51,177 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:51,177 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 24, 24, 24, 24, 24, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:51,183 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 07:06:51,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 07:06:51,377 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:51,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1532190731, now seen corresponding path program 2 times [2023-11-29 07:06:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667097021] [2023-11-29 07:06:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:51,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:51,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:06:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:52,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:06:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 07:06:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:52,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:53,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:53,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:53,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:53,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:53,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:53,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 07:06:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:53,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 11 proven. 64 refuted. 0 times theorem prover too weak. 2389 trivial. 0 not checked. [2023-11-29 07:06:53,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:53,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667097021] [2023-11-29 07:06:53,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667097021] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:53,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266082699] [2023-11-29 07:06:53,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 07:06:53,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:53,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:53,036 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:53,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 07:06:53,412 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 07:06:53,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:06:53,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 1223 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 07:06:53,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:53,536 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-29 07:06:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 79 proven. 8 refuted. 0 times theorem prover too weak. 2377 trivial. 0 not checked. [2023-11-29 07:06:53,842 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2464 backedges. 69 proven. 17 refuted. 0 times theorem prover too weak. 2378 trivial. 0 not checked. [2023-11-29 07:06:55,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266082699] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:55,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:55,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 16] total 44 [2023-11-29 07:06:55,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553787776] [2023-11-29 07:06:55,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:55,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-29 07:06:55,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:55,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-29 07:06:55,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=1653, Unknown=0, NotChecked=0, Total=1892 [2023-11-29 07:06:55,100 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 44 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 35 states have internal predecessors, (92), 18 states have call successors, (37), 11 states have call predecessors, (37), 9 states have return successors, (26), 12 states have call predecessors, (26), 16 states have call successors, (26) [2023-11-29 07:06:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:06:55,841 INFO L93 Difference]: Finished difference Result 164 states and 191 transitions. [2023-11-29 07:06:55,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 07:06:55,841 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 35 states have internal predecessors, (92), 18 states have call successors, (37), 11 states have call predecessors, (37), 9 states have return successors, (26), 12 states have call predecessors, (26), 16 states have call successors, (26) Word has length 271 [2023-11-29 07:06:55,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:06:55,843 INFO L225 Difference]: With dead ends: 164 [2023-11-29 07:06:55,843 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 07:06:55,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 590 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=415, Invalid=2891, Unknown=0, NotChecked=0, Total=3306 [2023-11-29 07:06:55,845 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 86 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:06:55,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 444 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:06:55,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 07:06:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2023-11-29 07:06:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.1320754716981132) internal successors, (60), 56 states have internal predecessors, (60), 11 states have call successors, (11), 9 states have call predecessors, (11), 17 states have return successors, (22), 17 states have call predecessors, (22), 9 states have call successors, (22) [2023-11-29 07:06:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2023-11-29 07:06:55,859 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 271 [2023-11-29 07:06:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:06:55,860 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2023-11-29 07:06:55,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 34 states have (on average 2.7058823529411766) internal successors, (92), 35 states have internal predecessors, (92), 18 states have call successors, (37), 11 states have call predecessors, (37), 9 states have return successors, (26), 12 states have call predecessors, (26), 16 states have call successors, (26) [2023-11-29 07:06:55,861 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2023-11-29 07:06:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2023-11-29 07:06:55,866 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:06:55,866 INFO L195 NwaCegarLoop]: trace histogram [56, 56, 48, 48, 48, 48, 48, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:06:55,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 07:06:56,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:56,067 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:06:56,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:06:56,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1635752175, now seen corresponding path program 3 times [2023-11-29 07:06:56,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:06:56,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416241195] [2023-11-29 07:06:56,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:56,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:06:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:56,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:06:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:56,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:56,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:56,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 07:06:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-29 07:06:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:57,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:06:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:06:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:06:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 07:06:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:57,544 INFO L134 CoverageAnalysis]: Checked inductivity of 9898 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9893 trivial. 0 not checked. [2023-11-29 07:06:57,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:06:57,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416241195] [2023-11-29 07:06:57,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416241195] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:57,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589619256] [2023-11-29 07:06:57,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 07:06:57,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:06:57,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:06:57,546 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:06:57,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 07:06:57,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 07:06:57,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 07:06:57,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-29 07:06:57,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:58,044 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 15 treesize of output 1 [2023-11-29 07:06:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9898 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 9871 trivial. 0 not checked. [2023-11-29 07:06:58,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:59,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9898 backedges. 24 proven. 4 refuted. 0 times theorem prover too weak. 9870 trivial. 0 not checked. [2023-11-29 07:06:59,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589619256] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 07:06:59,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 07:06:59,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 11] total 34 [2023-11-29 07:06:59,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800831159] [2023-11-29 07:06:59,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:59,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 07:06:59,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:06:59,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 07:06:59,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 07:06:59,458 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 34 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 24 states have internal predecessors, (71), 13 states have call successors, (28), 11 states have call predecessors, (28), 5 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) [2023-11-29 07:07:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:00,318 INFO L93 Difference]: Finished difference Result 172 states and 202 transitions. [2023-11-29 07:07:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 07:07:00,319 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 24 states have internal predecessors, (71), 13 states have call successors, (28), 11 states have call predecessors, (28), 5 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) Word has length 491 [2023-11-29 07:07:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:00,321 INFO L225 Difference]: With dead ends: 172 [2023-11-29 07:07:00,321 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 07:07:00,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1155 GetRequests, 1103 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=338, Invalid=2524, Unknown=0, NotChecked=0, Total=2862 [2023-11-29 07:07:00,323 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 195 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:00,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 204 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 07:07:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 07:07:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2023-11-29 07:07:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 11 states have call successors, (11), 9 states have call predecessors, (11), 18 states have return successors, (23), 18 states have call predecessors, (23), 9 states have call successors, (23) [2023-11-29 07:07:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2023-11-29 07:07:00,336 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 491 [2023-11-29 07:07:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:00,336 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2023-11-29 07:07:00,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 24 states have internal predecessors, (71), 13 states have call successors, (28), 11 states have call predecessors, (28), 5 states have return successors, (15), 9 states have call predecessors, (15), 10 states have call successors, (15) [2023-11-29 07:07:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2023-11-29 07:07:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 959 [2023-11-29 07:07:00,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:07:00,346 INFO L195 NwaCegarLoop]: trace histogram [112, 112, 96, 96, 96, 96, 96, 20, 20, 16, 16, 16, 16, 16, 16, 16, 16, 16, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:07:00,352 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 07:07:00,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:07:00,547 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2023-11-29 07:07:00,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:07:00,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1655400556, now seen corresponding path program 1 times [2023-11-29 07:07:00,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 07:07:00,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199164125] [2023-11-29 07:07:00,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 07:07:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 07:07:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:02,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 07:07:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 07:07:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 484 [2023-11-29 07:07:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:02,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:03,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 07:07:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 07:07:03,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 07:07:03,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-29 07:07:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 07:07:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:03,420 INFO L134 CoverageAnalysis]: Checked inductivity of 40000 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 39994 trivial. 0 not checked. [2023-11-29 07:07:03,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 07:07:03,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199164125] [2023-11-29 07:07:03,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199164125] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:07:03,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96275776] [2023-11-29 07:07:03,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:07:03,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 07:07:03,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 07:07:03,421 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 07:07:03,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 07:07:04,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:07:04,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 3648 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 07:07:04,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:07:05,043 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 15 treesize of output 7 [2023-11-29 07:07:05,063 INFO L134 CoverageAnalysis]: Checked inductivity of 40000 backedges. 20237 proven. 0 refuted. 0 times theorem prover too weak. 19763 trivial. 0 not checked. [2023-11-29 07:07:05,063 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 07:07:05,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96275776] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 07:07:05,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 07:07:05,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2023-11-29 07:07:05,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854034203] [2023-11-29 07:07:05,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 07:07:05,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 07:07:05,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 07:07:05,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 07:07:05,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-29 07:07:05,066 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 07:07:05,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:07:05,169 INFO L93 Difference]: Finished difference Result 90 states and 100 transitions. [2023-11-29 07:07:05,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 07:07:05,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 958 [2023-11-29 07:07:05,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:07:05,172 INFO L225 Difference]: With dead ends: 90 [2023-11-29 07:07:05,172 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 07:07:05,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1244 GetRequests, 1227 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-11-29 07:07:05,173 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 14 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:07:05,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 152 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 07:07:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 07:07:05,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 07:07:05,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 07:07:05,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 07:07:05,175 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 958 [2023-11-29 07:07:05,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:07:05,175 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 07:07:05,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-11-29 07:07:05,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 07:07:05,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 07:07:05,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 10 remaining) [2023-11-29 07:07:05,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2023-11-29 07:07:05,178 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2023-11-29 07:07:05,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2023-11-29 07:07:05,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2023-11-29 07:07:05,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2023-11-29 07:07:05,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2023-11-29 07:07:05,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2023-11-29 07:07:05,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2023-11-29 07:07:05,179 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 10 remaining) [2023-11-29 07:07:05,189 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 07:07:05,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 07:07:05,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 07:07:55,260 WARN L293 SmtUtils]: Spent 48.24s on a formula simplification. DAG size of input: 82 DAG size of output: 70 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 07:08:28,713 WARN L293 SmtUtils]: Spent 32.14s on a formula simplification. DAG size of input: 78 DAG size of output: 64 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 07:08:52,936 WARN L293 SmtUtils]: Spent 24.16s on a formula simplification. DAG size of input: 97 DAG size of output: 55 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 07:09:01,398 WARN L293 SmtUtils]: Spent 8.34s on a formula simplification. DAG size of input: 80 DAG size of output: 62 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-11-29 07:09:01,401 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse7 (= |func_to_recursive_line_24_to_25_0_#in~d.offset| 0))) (let ((.cse0 (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse1 (not .cse7)) (.cse2 (not (= |func_to_recursive_line_24_to_25_0_#in~c.offset| 0))) (.cse3 (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (< (+ (select (select |old(#memory_int#1)| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse4 (and (exists ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648))) (<= 1 (select (select |#memory_int#3| func_to_recursive_line_24_to_25_0_~b.base) func_to_recursive_line_24_to_25_0_~b.offset)) (= func_to_recursive_line_24_to_25_0_~c.offset 0) (= func_to_recursive_line_24_to_25_0_~d.offset 0) (exists ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648))) .cse7)) (.cse5 (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3)))) (.cse6 (select (select |old(#memory_int#3)| |func_to_recursive_line_24_to_25_0_#in~b.base|) |func_to_recursive_line_24_to_25_0_#in~b.offset|))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= .cse6 0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< .cse6 1))))) [2023-11-29 07:09:01,402 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-11-29 07:09:01,402 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-11-29 07:09:01,402 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse16 (select (select |#memory_int#1| |func_to_recursive_line_25_to_26_0_#in~c.base|) |func_to_recursive_line_25_to_26_0_#in~c.offset|)) (.cse15 (select (select |old(#memory_int#1)| |func_to_recursive_line_25_to_26_0_#in~c.base|) |func_to_recursive_line_25_to_26_0_#in~c.offset|))) (let ((.cse9 (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse10 (not (= |func_to_recursive_line_24_to_25_0_#in~d.offset| 0))) (.cse11 (not (= |func_to_recursive_line_24_to_25_0_#in~c.offset| 0))) (.cse12 (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (< (+ (select (select |old(#memory_int#1)| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse13 (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3)))) (.cse14 (select (select |old(#memory_int#3)| |func_to_recursive_line_24_to_25_0_#in~b.base|) |func_to_recursive_line_24_to_25_0_#in~b.offset|)) (.cse4 (select (select |#memory_int#3| |func_to_recursive_line_24_to_25_0_#in~b.base|) |func_to_recursive_line_24_to_25_0_#in~b.offset|)) (.cse1 (= func_to_recursive_line_24_to_25_0_~c.offset 0)) (.cse2 (= |#memory_int#4| |old(#memory_int#4)|)) (.cse3 (= |#memory_int#2| |old(#memory_int#2)|)) (.cse0 (select (select |#memory_int#3| func_to_recursive_line_24_to_25_0_~b.base) func_to_recursive_line_24_to_25_0_~b.offset)) (.cse5 (or (< .cse16 6) (< 5 .cse15))) (.cse6 (or (< 4 .cse15) (< .cse16 5))) (.cse7 (= func_to_recursive_line_24_to_25_0_~d.offset 0)) (.cse8 (= (select (select |#memory_int#1| func_to_recursive_line_24_to_25_0_~c.base) 0) 0))) (and (or (and (<= .cse0 5) (<= 1 .cse0) .cse1 .cse2 .cse3 (<= 1 .cse4) .cse5 .cse6 .cse7 .cse8) .cse9 .cse10 .cse11 .cse12 .cse13 (< .cse14 1)) (or .cse9 .cse10 .cse11 .cse12 .cse13 (not (= .cse14 0)) (and (= .cse4 0) .cse1 .cse2 .cse3 (= .cse0 0) .cse5 .cse6 .cse7 .cse8))))) [2023-11-29 07:09:01,402 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-11-29 07:09:01,402 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_24_to_25_0EXIT(lines 79 97) no Hoare annotation was computed. [2023-11-29 07:09:01,402 INFO L899 garLoopResultBuilder]: For program point L81(lines 81 96) no Hoare annotation was computed. [2023-11-29 07:09:01,402 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 90) no Hoare annotation was computed. [2023-11-29 07:09:01,402 INFO L899 garLoopResultBuilder]: For program point L81-1(lines 79 97) no Hoare annotation was computed. [2023-11-29 07:09:01,402 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 90) no Hoare annotation was computed. [2023-11-29 07:09:01,403 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 79 97) the Hoare annotation is: (let ((.cse0 (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse1 (not (= |func_to_recursive_line_24_to_25_0_#in~d.offset| 0))) (.cse2 (not (= |func_to_recursive_line_24_to_25_0_#in~c.offset| 0))) (.cse3 (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (< (+ (select (select |old(#memory_int#1)| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse4 (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3)))) (.cse5 (select (select |old(#memory_int#3)| |func_to_recursive_line_24_to_25_0_#in~b.base|) |func_to_recursive_line_24_to_25_0_#in~b.offset|)) (.cse6 (and (= |#memory_int#4| |old(#memory_int#4)|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|) (= |#memory_int#3| |old(#memory_int#3)|)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (< .cse5 1) .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse4 (not (= .cse5 0)) .cse6))) [2023-11-29 07:09:01,403 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 76) no Hoare annotation was computed. [2023-11-29 07:09:01,403 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 59 77) no Hoare annotation was computed. [2023-11-29 07:09:01,403 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_25_to_26_0EXIT(lines 59 77) no Hoare annotation was computed. [2023-11-29 07:09:01,403 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 59 77) the Hoare annotation is: (or (forall ((v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1))) (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (not (= |func_to_recursive_line_25_to_26_0_#in~d.offset| 0)) (< (+ (select (select |old(#memory_int#1)| |func_to_recursive_line_25_to_26_0_#in~c.base|) |func_to_recursive_line_25_to_26_0_#in~c.offset|) 2147483648) 0) (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3))) (and (= |#memory_int#4| |old(#memory_int#4)|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|))) [2023-11-29 07:09:01,403 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (or (forall ((v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1))) (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (not (= |func_to_recursive_line_25_to_26_0_#in~d.offset| 0)) (< (+ (select (select |old(#memory_int#1)| |func_to_recursive_line_25_to_26_0_#in~c.base|) |func_to_recursive_line_25_to_26_0_#in~c.offset|) 2147483648) 0) (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3))) (let ((.cse1 (select |old(#memory_int#1)| func_to_recursive_line_25_to_26_0_~c.base)) (.cse0 (select (select |#memory_int#1| func_to_recursive_line_25_to_26_0_~c.base) func_to_recursive_line_25_to_26_0_~c.offset))) (and (= func_to_recursive_line_25_to_26_0_~d.offset 0) (= func_to_recursive_line_25_to_26_0_~c.offset |func_to_recursive_line_25_to_26_0_#in~c.offset|) (= |func_to_recursive_line_25_to_26_0_#in~c.base| func_to_recursive_line_25_to_26_0_~c.base) (<= .cse0 (+ (select .cse1 func_to_recursive_line_25_to_26_0_~c.offset) 1)) (= |#memory_int#1| (store |old(#memory_int#1)| func_to_recursive_line_25_to_26_0_~c.base (store .cse1 func_to_recursive_line_25_to_26_0_~c.offset .cse0))) (<= 0 (+ 2147483648 .cse0))))) [2023-11-29 07:09:01,403 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-11-29 07:09:01,404 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-11-29 07:09:01,404 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-11-29 07:09:01,404 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (or (let ((.cse0 (select (select |old(#memory_int#2)| |func_to_recursive_line_26_to_27_0_#in~d.base|) |func_to_recursive_line_26_to_27_0_#in~d.offset|)) (.cse1 (select (select |#memory_int#2| |func_to_recursive_line_26_to_27_0_#in~d.base|) |func_to_recursive_line_26_to_27_0_#in~d.offset|))) (and (or (< 3 .cse0) (< .cse1 4)) (<= (select (select |#memory_int#1| func_to_recursive_line_25_to_26_0_~c.base) func_to_recursive_line_25_to_26_0_~c.offset) 5) (= |#memory_int#4| |old(#memory_int#4)|) (= func_to_recursive_line_25_to_26_0_~c.offset |func_to_recursive_line_25_to_26_0_#in~c.offset|) (or (< 4 .cse0) (< .cse1 5)) (= |func_to_recursive_line_25_to_26_0_#in~c.base| func_to_recursive_line_25_to_26_0_~c.base) (= |#memory_int#1| |old(#memory_int#1)|) (= (select (select |#memory_int#2| func_to_recursive_line_25_to_26_0_~d.base) func_to_recursive_line_25_to_26_0_~d.offset) 0) (= func_to_recursive_line_25_to_26_0_~d.offset |func_to_recursive_line_25_to_26_0_#in~d.offset|) (or (< 5 .cse0) (< .cse1 6)))) (forall ((v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1))) (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (not (= |func_to_recursive_line_25_to_26_0_#in~d.offset| 0)) (< (+ (select (select |old(#memory_int#1)| |func_to_recursive_line_25_to_26_0_#in~c.base|) |func_to_recursive_line_25_to_26_0_#in~c.offset|) 2147483648) 0) (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3)))) [2023-11-29 07:09:01,404 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-11-29 07:09:01,404 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_25_to_26_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-11-29 07:09:01,404 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (forall ((v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1))) (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (< (+ (select (select |old(#memory_int#4)| |func_to_recursive_line_27_to_27_0_#in~e.base|) |func_to_recursive_line_27_to_27_0_#in~e.offset|) 2147483648) 0) (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_3) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_3))) (let ((.cse1 (select (select |#memory_int#4| func_to_recursive_line_27_to_27_0_~e.base) func_to_recursive_line_27_to_27_0_~e.offset)) (.cse0 (select |old(#memory_int#4)| func_to_recursive_line_27_to_27_0_~e.base))) (and (= |func_to_recursive_line_27_to_27_0_#in~e.base| func_to_recursive_line_27_to_27_0_~e.base) (= func_to_recursive_line_27_to_27_0_~e.offset |func_to_recursive_line_27_to_27_0_#in~e.offset|) (= |#memory_int#4| (store |old(#memory_int#4)| func_to_recursive_line_27_to_27_0_~e.base (store .cse0 func_to_recursive_line_27_to_27_0_~e.offset .cse1))) (<= 0 (+ 2147483648 .cse1)) (<= .cse1 (+ (select .cse0 func_to_recursive_line_27_to_27_0_~e.offset) 1)))) (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3))) (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) [2023-11-29 07:09:01,404 INFO L899 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2023-11-29 07:09:01,404 INFO L899 garLoopResultBuilder]: For program point L30-1(line 30) no Hoare annotation was computed. [2023-11-29 07:09:01,405 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 36) no Hoare annotation was computed. [2023-11-29 07:09:01,405 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 23 37) no Hoare annotation was computed. [2023-11-29 07:09:01,405 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-11-29 07:09:01,405 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-11-29 07:09:01,405 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_27_to_27_0EXIT(lines 23 37) no Hoare annotation was computed. [2023-11-29 07:09:01,405 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 23 37) the Hoare annotation is: (or (forall ((v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1))) (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648) 0)) (= |#memory_int#4| |old(#memory_int#4)|) (< (+ (select (select |old(#memory_int#4)| |func_to_recursive_line_27_to_27_0_#in~e.base|) |func_to_recursive_line_27_to_27_0_#in~e.offset|) 2147483648) 0) (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_3) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_3))) (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3))) (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) [2023-11-29 07:09:01,405 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 50) no Hoare annotation was computed. [2023-11-29 07:09:01,405 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse0 (forall ((v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1)))) (.cse1 (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse3 (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_3) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_3)))) (.cse4 (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3)))) (.cse5 (let ((.cse8 (select |old(#memory_int#2)| func_to_recursive_line_26_to_27_0_~d.base)) (.cse7 (select (select |#memory_int#2| func_to_recursive_line_26_to_27_0_~d.base) func_to_recursive_line_26_to_27_0_~d.offset))) (and (exists ((v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1 Int)) (<= (select (select |#memory_int#3| v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1) 5)) (<= .cse7 (+ (select .cse8 func_to_recursive_line_26_to_27_0_~d.offset) 1)) (= func_to_recursive_line_26_to_27_0_~d.offset |func_to_recursive_line_26_to_27_0_#in~d.offset|) (= |#memory_int#2| (store |old(#memory_int#2)| func_to_recursive_line_26_to_27_0_~d.base (store .cse8 func_to_recursive_line_26_to_27_0_~d.offset .cse7))) (= |func_to_recursive_line_26_to_27_0_#in~d.base| func_to_recursive_line_26_to_27_0_~d.base) (exists ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648))) (<= 1 .cse7)))) (.cse6 (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse2 (select (select |old(#memory_int#2)| |func_to_recursive_line_26_to_27_0_#in~d.base|) |func_to_recursive_line_26_to_27_0_#in~d.offset|))) (and (or .cse0 .cse1 (< .cse2 1) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (not (= 0 .cse2))))) [2023-11-29 07:09:01,406 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-29 07:09:01,406 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2023-11-29 07:09:01,406 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (forall ((v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1)))) (.cse1 (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse3 (let ((.cse10 (select (select |old(#memory_int#4)| |func_to_recursive_line_27_to_27_0_#in~e.base|) |func_to_recursive_line_27_to_27_0_#in~e.offset|)) (.cse11 (select (select |#memory_int#4| |func_to_recursive_line_27_to_27_0_#in~e.base|) |func_to_recursive_line_27_to_27_0_#in~e.offset|))) (and (exists ((v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1 Int)) (<= (select (select |#memory_int#3| v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1) 5)) (= (select (select |#memory_int#4| func_to_recursive_line_26_to_27_0_~e.base) func_to_recursive_line_26_to_27_0_~e.offset) 0) (let ((.cse8 (exists ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3 Int)) (<= (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3) 5))) (.cse9 (exists ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648))))) (or (let ((.cse7 (select (select |#memory_int#2| func_to_recursive_line_26_to_27_0_~d.base) func_to_recursive_line_26_to_27_0_~d.offset))) (and (<= .cse7 5) .cse8 .cse9 (<= 1 .cse7))) (and .cse8 (= (select (select |#memory_int#2| |func_to_recursive_line_26_to_27_0_#in~d.base|) |func_to_recursive_line_26_to_27_0_#in~d.offset|) 0) .cse9))) (or (< 2 .cse10) (< .cse11 3)) (= |#memory_int#2| |old(#memory_int#2)|) (or (< .cse11 2) (< 1 .cse10)) (= func_to_recursive_line_26_to_27_0_~d.offset |func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (< .cse11 4) (< 3 .cse10)) (exists ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_3 Int)) (<= (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_3) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_3) 5)) (or (< .cse11 1) (< 0 .cse10)) (= |func_to_recursive_line_26_to_27_0_#in~d.base| func_to_recursive_line_26_to_27_0_~d.base) (or (< 4 .cse10) (< .cse11 5)) (or (< 5 .cse10) (< .cse11 6))))) (.cse4 (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_3) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_3)))) (.cse5 (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3)))) (.cse6 (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse2 (select (select |old(#memory_int#2)| |func_to_recursive_line_26_to_27_0_#in~d.base|) |func_to_recursive_line_26_to_27_0_#in~d.offset|))) (and (or .cse0 .cse1 (< .cse2 1) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (not (= 0 .cse2))))) [2023-11-29 07:09:01,406 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2023-11-29 07:09:01,406 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 50) no Hoare annotation was computed. [2023-11-29 07:09:01,407 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 39 57) the Hoare annotation is: (let ((.cse0 (forall ((v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1 Int) (v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1 Int)) (< 5 (select (select |#memory_int#3| v_func_to_recursive_line_24_to_25_0_~b.base_BEFORE_CALL_1) v_func_to_recursive_line_24_to_25_0_~b.offset_BEFORE_CALL_1)))) (.cse1 (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_2) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse3 (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_3 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_3) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_3)))) (.cse4 (forall ((v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3 Int) (v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3 Int)) (< 5 (select (select |#memory_int#5| v_func_to_recursive_line_23_to_24_0_~a.base_BEFORE_CALL_3) v_func_to_recursive_line_23_to_24_0_~a.offset_BEFORE_CALL_3)))) (.cse5 (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (< (+ (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648) 0))) (.cse6 (and (= |#memory_int#4| |old(#memory_int#4)|) (= |#memory_int#2| |old(#memory_int#2)|))) (.cse2 (select (select |old(#memory_int#2)| |func_to_recursive_line_26_to_27_0_#in~d.base|) |func_to_recursive_line_26_to_27_0_#in~d.offset|))) (and (or .cse0 .cse1 (< .cse2 1) .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse3 .cse4 .cse5 .cse6 (not (= 0 .cse2))))) [2023-11-29 07:09:01,407 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 56) no Hoare annotation was computed. [2023-11-29 07:09:01,407 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 39 57) no Hoare annotation was computed. [2023-11-29 07:09:01,407 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_26_to_27_0EXIT(lines 39 57) no Hoare annotation was computed. [2023-11-29 07:09:01,407 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_23_to_24_0EXIT(lines 99 117) no Hoare annotation was computed. [2023-11-29 07:09:01,407 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 110) no Hoare annotation was computed. [2023-11-29 07:09:01,407 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_23_to_24_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 110) no Hoare annotation was computed. [2023-11-29 07:09:01,408 INFO L895 garLoopResultBuilder]: At program point L112(line 112) the Hoare annotation is: (or (< (+ (select (select |old(#memory_int#5)| |func_to_recursive_line_23_to_24_0_#in~a.base|) |func_to_recursive_line_23_to_24_0_#in~a.offset|) 2147483648) 0) (and (exists ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648))) (= func_to_recursive_line_23_to_24_0_~d.offset 0) (<= 0 (+ (select (select |#memory_int#5| func_to_recursive_line_23_to_24_0_~a.base) func_to_recursive_line_23_to_24_0_~a.offset) 2147483648)) (= func_to_recursive_line_23_to_24_0_~c.offset 0)) (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (< (+ (select (select |old(#memory_int#1)| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648) 0)) (not (= |func_to_recursive_line_23_to_24_0_#in~c.offset| 0)) (not (= |func_to_recursive_line_23_to_24_0_#in~d.offset| 0))) [2023-11-29 07:09:01,408 INFO L899 garLoopResultBuilder]: For program point L110(line 110) no Hoare annotation was computed. [2023-11-29 07:09:01,408 INFO L899 garLoopResultBuilder]: For program point L110-1(line 110) no Hoare annotation was computed. [2023-11-29 07:09:01,408 INFO L895 garLoopResultBuilder]: At program point L107(line 107) the Hoare annotation is: (or (< (+ (select (select |old(#memory_int#5)| |func_to_recursive_line_23_to_24_0_#in~a.base|) |func_to_recursive_line_23_to_24_0_#in~a.offset|) 2147483648) 0) (let ((.cse0 (select (select |#memory_int#5| func_to_recursive_line_23_to_24_0_~a.base) func_to_recursive_line_23_to_24_0_~a.offset))) (and (<= .cse0 5) (= |#memory_int#4| |old(#memory_int#4)|) (= |#memory_int#2| |old(#memory_int#2)|) (= func_to_recursive_line_23_to_24_0_~d.offset 0) (= |#memory_int#1| |old(#memory_int#1)|) (<= 0 (+ .cse0 2147483648)) (= (select (select |#memory_int#3| func_to_recursive_line_23_to_24_0_~b.base) func_to_recursive_line_23_to_24_0_~b.offset) 0) (<= 0 (+ (select (select |#memory_int#5| |func_to_recursive_line_23_to_24_0_#in~a.base|) |func_to_recursive_line_23_to_24_0_#in~a.offset|) 2147483648)) (= func_to_recursive_line_23_to_24_0_~c.offset 0))) (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (< (+ (select (select |old(#memory_int#1)| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648) 0)) (not (= |func_to_recursive_line_23_to_24_0_#in~c.offset| 0)) (not (= |func_to_recursive_line_23_to_24_0_#in~d.offset| 0))) [2023-11-29 07:09:01,408 INFO L899 garLoopResultBuilder]: For program point L107-1(line 107) no Hoare annotation was computed. [2023-11-29 07:09:01,408 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 99 117) the Hoare annotation is: (or (< (+ (select (select |old(#memory_int#5)| |func_to_recursive_line_23_to_24_0_#in~a.base|) |func_to_recursive_line_23_to_24_0_#in~a.offset|) 2147483648) 0) (forall ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (< (+ (select (select |old(#memory_int#1)| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648) 0)) (and (= |#memory_int#4| |old(#memory_int#4)|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_int#1| |old(#memory_int#1)|) (<= 0 (+ (select (select |#memory_int#5| |func_to_recursive_line_23_to_24_0_#in~a.base|) |func_to_recursive_line_23_to_24_0_#in~a.offset|) 2147483648)) (= |#memory_int#3| |old(#memory_int#3)|)) (not (= |func_to_recursive_line_23_to_24_0_#in~c.offset| 0)) (not (= |func_to_recursive_line_23_to_24_0_#in~d.offset| 0))) [2023-11-29 07:09:01,408 INFO L899 garLoopResultBuilder]: For program point L101(lines 101 116) no Hoare annotation was computed. [2023-11-29 07:09:01,408 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 99 117) no Hoare annotation was computed. [2023-11-29 07:09:01,408 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 07:09:01,408 INFO L895 garLoopResultBuilder]: At program point L128(line 128) the Hoare annotation is: (and (= 0 (select (select |#memory_int#5| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|)) (exists ((v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2 Int) (v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2 Int)) (<= 0 (+ (select (select |#memory_int#1| v_func_to_recursive_line_25_to_26_0_~c.base_BEFORE_CALL_2) v_func_to_recursive_line_25_to_26_0_~c.offset_BEFORE_CALL_2) 2147483648))) (= |ULTIMATE.start_main_~#d~0#1.offset| 0) (= |ULTIMATE.start_main_~#c~0#1.offset| 0)) [2023-11-29 07:09:01,409 INFO L899 garLoopResultBuilder]: For program point L130-2(line 130) no Hoare annotation was computed. [2023-11-29 07:09:01,409 INFO L899 garLoopResultBuilder]: For program point L128-1(line 128) no Hoare annotation was computed. [2023-11-29 07:09:01,409 INFO L899 garLoopResultBuilder]: For program point L130-3(line 130) no Hoare annotation was computed. [2023-11-29 07:09:01,409 INFO L899 garLoopResultBuilder]: For program point L130-5(line 130) no Hoare annotation was computed. [2023-11-29 07:09:01,409 INFO L899 garLoopResultBuilder]: For program point L130-6(line 130) no Hoare annotation was computed. [2023-11-29 07:09:01,409 INFO L899 garLoopResultBuilder]: For program point L130-8(line 130) no Hoare annotation was computed. [2023-11-29 07:09:01,409 INFO L899 garLoopResultBuilder]: For program point L130-9(line 130) no Hoare annotation was computed. [2023-11-29 07:09:01,409 INFO L899 garLoopResultBuilder]: For program point L130-11(lines 130 136) no Hoare annotation was computed. [2023-11-29 07:09:01,409 INFO L899 garLoopResultBuilder]: For program point L130-13(lines 130 136) no Hoare annotation was computed. [2023-11-29 07:09:01,409 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 07:09:01,409 INFO L899 garLoopResultBuilder]: For program point L130(line 130) no Hoare annotation was computed. [2023-11-29 07:09:01,411 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 07:09:01,413 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 07:09:01,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:09:01 BoogieIcfgContainer [2023-11-29 07:09:01,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 07:09:01,417 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 07:09:01,417 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 07:09:01,417 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 07:09:01,418 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:06:20" (3/4) ... [2023-11-29 07:09:01,419 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 07:09:01,423 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_24_to_25_0 [2023-11-29 07:09:01,423 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_23_to_24_0 [2023-11-29 07:09:01,423 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_25_to_26_0 [2023-11-29 07:09:01,423 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_27_to_27_0 [2023-11-29 07:09:01,423 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_26_to_27_0 [2023-11-29 07:09:01,429 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2023-11-29 07:09:01,430 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2023-11-29 07:09:01,430 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-29 07:09:01,430 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 07:09:01,515 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 07:09:01,516 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 07:09:01,516 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 07:09:01,517 INFO L158 Benchmark]: Toolchain (without parser) took 161538.54ms. Allocated memory was 151.0MB in the beginning and 799.0MB in the end (delta: 648.0MB). Free memory was 118.7MB in the beginning and 659.9MB in the end (delta: -541.2MB). Peak memory consumption was 109.4MB. Max. memory is 16.1GB. [2023-11-29 07:09:01,517 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 07:09:01,517 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.73ms. Allocated memory is still 151.0MB. Free memory was 118.1MB in the beginning and 107.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 07:09:01,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.32ms. Allocated memory is still 151.0MB. Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:09:01,518 INFO L158 Benchmark]: Boogie Preprocessor took 56.24ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 103.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 07:09:01,519 INFO L158 Benchmark]: RCFGBuilder took 450.29ms. Allocated memory is still 151.0MB. Free memory was 103.5MB in the beginning and 82.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 07:09:01,519 INFO L158 Benchmark]: TraceAbstraction took 160649.57ms. Allocated memory was 151.0MB in the beginning and 799.0MB in the end (delta: 648.0MB). Free memory was 81.8MB in the beginning and 666.2MB in the end (delta: -584.4MB). Peak memory consumption was 464.0MB. Max. memory is 16.1GB. [2023-11-29 07:09:01,520 INFO L158 Benchmark]: Witness Printer took 98.91ms. Allocated memory is still 799.0MB. Free memory was 666.2MB in the beginning and 659.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 07:09:01,521 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 107.0MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.73ms. Allocated memory is still 151.0MB. Free memory was 118.1MB in the beginning and 107.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.32ms. Allocated memory is still 151.0MB. Free memory was 107.6MB in the beginning and 106.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.24ms. Allocated memory is still 151.0MB. Free memory was 106.3MB in the beginning and 103.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 450.29ms. Allocated memory is still 151.0MB. Free memory was 103.5MB in the beginning and 82.6MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 160649.57ms. Allocated memory was 151.0MB in the beginning and 799.0MB in the end (delta: 648.0MB). Free memory was 81.8MB in the beginning and 666.2MB in the end (delta: -584.4MB). Peak memory consumption was 464.0MB. Max. memory is 16.1GB. * Witness Printer took 98.91ms. Allocated memory is still 799.0MB. Free memory was 666.2MB in the beginning and 659.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 90]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 70]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 110]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 66 locations, 10 error locations. Started 1 CEGAR loops. OverallTime: 160.6s, OverallIterations: 21, TraceHistogramMax: 112, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 116.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1089 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1078 mSDsluCounter, 5740 SdHoareTripleChecker+Invalid, 4.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4824 mSDsCounter, 425 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5187 IncrementalHoareTripleChecker+Invalid, 5613 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 425 mSolverCounterUnsat, 916 mSDtfsCounter, 5187 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5043 GetRequests, 4560 SyntacticMatches, 14 SemanticMatches, 469 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4721 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=20, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 134 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 290 PreInvPairs, 303 NumberOfFragments, 1934 HoareAnnotationTreeSize, 290 FomulaSimplifications, 205759 FormulaSimplificationTreeSizeReduction, 1.6s HoareSimplificationTime, 15 FomulaSimplificationsInter, 3110 FormulaSimplificationTreeSizeReductionInter, 114.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 5692 NumberOfCodeBlocks, 5239 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6886 ConstructedInterpolants, 678 QuantifiedInterpolants, 19534 SizeOfPredicates, 83 NumberOfNonLiveVariables, 10757 ConjunctsInSsa, 365 ConjunctsInUnsatCore, 39 InterpolantComputations, 15 PerfectInterpolantSequences, 128813/131433 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-29 07:09:01,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_78eaa505-d578-419d-a5ce-c21bebfa3865/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE