./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu --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 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:35:21,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:35:21,827 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-19 07:35:21,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:35:21,839 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:35:21,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:35:21,883 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:35:21,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:35:21,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:35:21,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:35:21,886 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:35:21,887 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:35:21,887 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:35:21,888 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:35:21,889 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:35:21,889 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:35:21,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:35:21,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:35:21,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:35:21,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:35:21,893 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:35:21,893 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:35:21,894 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-19 07:35:21,894 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:35:21,895 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:35:21,895 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:35:21,896 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:35:21,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:35:21,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:35:21,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:35:21,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:35:21,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:35:21,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:35:21,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:35:21,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:35:21,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:35:21,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:35:21,901 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:35:21,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:35:21,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:35:21,902 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:35:21,903 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_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 1a590e2514668f126114e4312bb6236a04cce9502b393533b5b4bfd230be904b [2023-11-19 07:35:22,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:35:22,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:35:22,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:35:22,211 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:35:22,212 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:35:22,214 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2023-11-19 07:35:25,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:35:25,857 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:35:25,858 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/sv-benchmarks/c/recursified_loop-simple/recursified_nested_2.c [2023-11-19 07:35:25,866 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/data/59d30dec7/fdca34fc715243c7b1b9b0a5481bfab7/FLAG12d30520a [2023-11-19 07:35:25,882 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/data/59d30dec7/fdca34fc715243c7b1b9b0a5481bfab7 [2023-11-19 07:35:25,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:35:25,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:35:25,888 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:35:25,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:35:25,894 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:35:25,895 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:25" (1/1) ... [2023-11-19 07:35:25,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc2d40f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:25, skipping insertion in model container [2023-11-19 07:35:25,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:35:25" (1/1) ... [2023-11-19 07:35:25,921 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:35:26,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:35:26,108 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:35:26,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:35:26,141 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:35:26,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26 WrapperNode [2023-11-19 07:35:26,142 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:35:26,143 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:35:26,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:35:26,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:35:26,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26" (1/1) ... [2023-11-19 07:35:26,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26" (1/1) ... [2023-11-19 07:35:26,181 INFO L138 Inliner]: procedures = 13, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2023-11-19 07:35:26,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:35:26,182 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:35:26,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:35:26,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:35:26,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26" (1/1) ... [2023-11-19 07:35:26,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26" (1/1) ... [2023-11-19 07:35:26,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26" (1/1) ... [2023-11-19 07:35:26,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26" (1/1) ... [2023-11-19 07:35:26,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26" (1/1) ... [2023-11-19 07:35:26,223 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26" (1/1) ... [2023-11-19 07:35:26,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26" (1/1) ... [2023-11-19 07:35:26,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26" (1/1) ... [2023-11-19 07:35:26,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:35:26,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:35:26,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:35:26,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:35:26,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26" (1/1) ... [2023-11-19 07:35:26,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:35:26,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:26,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:35:26,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:35:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:35:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:35:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:35:26,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:35:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_20_to_21_0 [2023-11-19 07:35:26,324 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_20_to_21_0 [2023-11-19 07:35:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:35:26,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:35:26,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:35:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_21_0 [2023-11-19 07:35:26,325 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_21_0 [2023-11-19 07:35:26,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:35:26,415 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:35:26,418 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:35:26,626 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:35:26,642 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:35:26,642 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:35:26,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:26 BoogieIcfgContainer [2023-11-19 07:35:26,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:35:26,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:35:26,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:35:26,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:35:26,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:35:25" (1/3) ... [2023-11-19 07:35:26,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6384de99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:26, skipping insertion in model container [2023-11-19 07:35:26,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:35:26" (2/3) ... [2023-11-19 07:35:26,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6384de99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:35:26, skipping insertion in model container [2023-11-19 07:35:26,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:26" (3/3) ... [2023-11-19 07:35:26,656 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_2.c [2023-11-19 07:35:26,676 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:35:26,676 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-19 07:35:26,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:35:26,775 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;@652690a6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:35:26,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-19 07:35:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 20 states have (on average 1.4) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:35:26,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 07:35:26,788 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:26,789 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:26,789 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 07:35:26,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:26,795 INFO L85 PathProgramCache]: Analyzing trace with hash -403132117, now seen corresponding path program 1 times [2023-11-19 07:35:26,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:26,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861666380] [2023-11-19 07:35:26,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:26,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:27,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-19 07:35:27,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:27,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861666380] [2023-11-19 07:35:27,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861666380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:27,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:27,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:35:27,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056710601] [2023-11-19 07:35:27,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:27,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:35:27,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:27,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:35:27,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:35:27,395 INFO L87 Difference]: Start difference. First operand has 31 states, 20 states have (on average 1.4) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:27,590 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2023-11-19 07:35:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:35:27,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-19 07:35:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:27,601 INFO L225 Difference]: With dead ends: 63 [2023-11-19 07:35:27,601 INFO L226 Difference]: Without dead ends: 26 [2023-11-19 07:35:27,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:35:27,612 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:27,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 116 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:35:27,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-11-19 07:35:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2023-11-19 07:35:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:35:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-11-19 07:35:27,654 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 9 [2023-11-19 07:35:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:27,655 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-11-19 07:35:27,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-11-19 07:35:27,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 07:35:27,657 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:27,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:27,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:35:27,658 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_21_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 07:35:27,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash 387806336, now seen corresponding path program 1 times [2023-11-19 07:35:27,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:27,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150099266] [2023-11-19 07:35:27,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:27,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:27,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:27,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:27,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150099266] [2023-11-19 07:35:27,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150099266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:27,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:27,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:35:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130002522] [2023-11-19 07:35:27,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:27,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:35:27,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:27,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:35:27,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:35:27,747 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:27,776 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2023-11-19 07:35:27,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:35:27,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-19 07:35:27,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:27,778 INFO L225 Difference]: With dead ends: 24 [2023-11-19 07:35:27,778 INFO L226 Difference]: Without dead ends: 23 [2023-11-19 07:35:27,779 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-19 07:35:27,781 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:27,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:35:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-11-19 07:35:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-11-19 07:35:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:35:27,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-11-19 07:35:27,789 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 10 [2023-11-19 07:35:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:27,790 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-11-19 07:35:27,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-11-19 07:35:27,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-19 07:35:27,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:27,792 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:27,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:35:27,795 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 07:35:27,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1434990353, now seen corresponding path program 1 times [2023-11-19 07:35:27,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:27,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769939723] [2023-11-19 07:35:27,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:27,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:28,131 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-19 07:35:28,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:28,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769939723] [2023-11-19 07:35:28,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769939723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:35:28,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:35:28,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:35:28,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819897621] [2023-11-19 07:35:28,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:35:28,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:35:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:28,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:35:28,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:35:28,137 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:28,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:28,353 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2023-11-19 07:35:28,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:35:28,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-19 07:35:28,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:28,368 INFO L225 Difference]: With dead ends: 29 [2023-11-19 07:35:28,369 INFO L226 Difference]: Without dead ends: 28 [2023-11-19 07:35:28,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:35:28,375 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:28,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 74 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:35:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-19 07:35:28,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2023-11-19 07:35:28,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-19 07:35:28,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2023-11-19 07:35:28,398 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2023-11-19 07:35:28,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:28,399 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2023-11-19 07:35:28,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:35:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2023-11-19 07:35:28,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 07:35:28,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:28,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:28,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:35:28,401 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 07:35:28,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:28,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1405703731, now seen corresponding path program 1 times [2023-11-19 07:35:28,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:28,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696086854] [2023-11-19 07:35:28,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:28,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:28,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:28,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:28,894 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:35:28,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:28,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696086854] [2023-11-19 07:35:28,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696086854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:28,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542978362] [2023-11-19 07:35:28,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:28,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:28,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:28,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:35:28,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:35:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:28,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-19 07:35:28,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:29,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:35:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:35:29,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:35:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:29,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542978362] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:35:29,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:35:29,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2023-11-19 07:35:29,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423813652] [2023-11-19 07:35:29,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:35:29,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-19 07:35:29,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:29,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-19 07:35:29,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2023-11-19 07:35:29,966 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 24 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-19 07:35:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:30,333 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2023-11-19 07:35:30,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:35:30,334 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 19 [2023-11-19 07:35:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:30,338 INFO L225 Difference]: With dead ends: 47 [2023-11-19 07:35:30,338 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 07:35:30,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2023-11-19 07:35:30,345 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:30,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 100 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:35:30,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 07:35:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-19 07:35:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-19 07:35:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-11-19 07:35:30,354 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2023-11-19 07:35:30,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:30,354 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-11-19 07:35:30,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 21 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-19 07:35:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-11-19 07:35:30,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-19 07:35:30,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:30,356 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:30,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:35:30,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:30,579 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 07:35:30,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:30,579 INFO L85 PathProgramCache]: Analyzing trace with hash 993694173, now seen corresponding path program 2 times [2023-11-19 07:35:30,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:30,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136661870] [2023-11-19 07:35:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:30,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:30,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:31,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:31,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:31,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:31,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:31,968 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-19 07:35:31,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:31,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136661870] [2023-11-19 07:35:31,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136661870] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:31,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812659477] [2023-11-19 07:35:31,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:35:31,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:31,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:31,971 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:35:31,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:35:32,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:35:32,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:35:32,061 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-19 07:35:32,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:32,077 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-19 07:35:32,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-19 07:35:32,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:35:32,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:35:32,356 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-19 07:35:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-19 07:35:32,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:35:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812659477] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:32,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:35:32,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2023-11-19 07:35:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823855679] [2023-11-19 07:35:32,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:35:32,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-19 07:35:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:32,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-19 07:35:32,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=556, Unknown=12, NotChecked=0, Total=650 [2023-11-19 07:35:32,590 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 23 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-19 07:35:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:33,027 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2023-11-19 07:35:33,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-19 07:35:33,028 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 33 [2023-11-19 07:35:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:33,029 INFO L225 Difference]: With dead ends: 52 [2023-11-19 07:35:33,030 INFO L226 Difference]: Without dead ends: 28 [2023-11-19 07:35:33,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=1014, Unknown=12, NotChecked=0, Total=1190 [2023-11-19 07:35:33,032 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 24 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:33,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 36 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:35:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-19 07:35:33,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-11-19 07:35:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-19 07:35:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-11-19 07:35:33,040 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 33 [2023-11-19 07:35:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:33,041 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-11-19 07:35:33,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 21 states have internal predecessors, (34), 8 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-19 07:35:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-11-19 07:35:33,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-19 07:35:33,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:33,043 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:33,072 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:35:33,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:33,252 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 07:35:33,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:33,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1601479902, now seen corresponding path program 1 times [2023-11-19 07:35:33,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:33,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306220872] [2023-11-19 07:35:33,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:33,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:33,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:34,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:34,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:34,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:34,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-11-19 07:35:34,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306220872] [2023-11-19 07:35:34,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306220872] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098359861] [2023-11-19 07:35:34,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:34,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:34,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:34,682 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:35:34,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:35:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:34,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-19 07:35:34,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:34,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:35:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-19 07:35:35,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:35:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:37,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098359861] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:35:37,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:35:37,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 26] total 44 [2023-11-19 07:35:37,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278879485] [2023-11-19 07:35:37,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:35:37,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-19 07:35:37,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:37,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-19 07:35:37,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1541, Unknown=0, NotChecked=0, Total=1892 [2023-11-19 07:35:37,579 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 44 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 38 states have internal predecessors, (52), 10 states have call successors, (10), 7 states have call predecessors, (10), 11 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) [2023-11-19 07:35:38,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:38,087 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2023-11-19 07:35:38,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:35:38,091 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 38 states have internal predecessors, (52), 10 states have call successors, (10), 7 states have call predecessors, (10), 11 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) Word has length 41 [2023-11-19 07:35:38,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:38,093 INFO L225 Difference]: With dead ends: 57 [2023-11-19 07:35:38,093 INFO L226 Difference]: Without dead ends: 32 [2023-11-19 07:35:38,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1020 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=494, Invalid=2056, Unknown=0, NotChecked=0, Total=2550 [2023-11-19 07:35:38,095 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:38,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 115 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:35:38,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-19 07:35:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-11-19 07:35:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-19 07:35:38,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2023-11-19 07:35:38,106 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 41 [2023-11-19 07:35:38,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:38,107 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2023-11-19 07:35:38,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 38 states have internal predecessors, (52), 10 states have call successors, (10), 7 states have call predecessors, (10), 11 states have return successors, (15), 10 states have call predecessors, (15), 9 states have call successors, (15) [2023-11-19 07:35:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2023-11-19 07:35:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-19 07:35:38,112 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:38,112 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:35:38,141 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:35:38,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 07:35:38,331 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 07:35:38,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:38,331 INFO L85 PathProgramCache]: Analyzing trace with hash 386544078, now seen corresponding path program 2 times [2023-11-19 07:35:38,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:38,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160088431] [2023-11-19 07:35:38,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:38,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:38,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:35:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:39,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:39,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:39,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:35:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:40,190 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-11-19 07:35:40,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:40,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160088431] [2023-11-19 07:35:40,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160088431] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:40,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963442240] [2023-11-19 07:35:40,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:35:40,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:40,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:40,196 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:35:40,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:35:40,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:35:40,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:35:40,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-19 07:35:40,324 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:40,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-19 07:35:40,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:35:40,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:35:42,611 WARN L854 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_40| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_40| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_40| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_40| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_40|))))) is different from false [2023-11-19 07:35:44,614 WARN L876 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_#memory_int_BEFORE_CALL_40| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_40| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_40| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_40| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_40|))))) is different from true [2023-11-19 07:35:46,651 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_16| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_16| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= |v_old(#memory_int)_AFTER_CALL_16| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_16| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_16| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|)) is different from false [2023-11-19 07:35:48,654 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_16| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_16| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= |v_old(#memory_int)_AFTER_CALL_16| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_16| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_16| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|)) is different from true [2023-11-19 07:35:50,757 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_18| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_18| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_18| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_18| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_18| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|)) is different from false [2023-11-19 07:35:52,759 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_18| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_18| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_18| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_18| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_18| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|)) is different from true [2023-11-19 07:35:54,795 WARN L854 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_19| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_19| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_19| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0))))) is different from false [2023-11-19 07:35:56,797 WARN L876 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_19| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_19| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_19| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0))))) is different from true [2023-11-19 07:35:56,852 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-19 07:35:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 92 trivial. 18 not checked. [2023-11-19 07:35:56,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:35:57,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963442240] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:57,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:35:57,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14] total 19 [2023-11-19 07:35:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138074490] [2023-11-19 07:35:57,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:35:57,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-19 07:35:57,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:57,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-19 07:35:57,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=284, Unknown=10, NotChecked=148, Total=506 [2023-11-19 07:35:57,158 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 20 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-19 07:35:59,284 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_21_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_21_to_21_0_~b.base)) |c_#memory_int|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_18| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_18| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_18| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_18| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_18| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)))))) .cse1) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_40| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_40| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_40| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= .cse2 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_40| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_40|))))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_16| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_16| |c_#memory_int|))) (and (= .cse3 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= |v_old(#memory_int)_AFTER_CALL_16| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_16| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_16| .cse3 (select |c_#memory_int| .cse3)))))) .cse1) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base) (or .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_19| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_19| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_19| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse4))))))) is different from false [2023-11-19 07:36:01,289 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_21_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_21_to_21_0_~b.base)) |c_#memory_int|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_18| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_18| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_18| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_18| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_18| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)))))) .cse1) (or .cse1 (exists ((|v_#memory_int_BEFORE_CALL_40| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_40| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_40| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= .cse2 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_#memory_int_BEFORE_CALL_40| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |v_#memory_int_BEFORE_CALL_40|))))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_16| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_16| |c_#memory_int|))) (and (= .cse3 |c_func_to_recursive_line_21_to_21_0_#in~b.base|) (= |v_old(#memory_int)_AFTER_CALL_16| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_16| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_16| .cse3 (select |c_#memory_int| .cse3)))))) .cse1) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base) (or .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_19| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_19| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_19| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_19| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_19| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse4))))))) is different from true [2023-11-19 07:36:01,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:36:01,374 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2023-11-19 07:36:01,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-19 07:36:01,375 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 55 [2023-11-19 07:36:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:36:01,376 INFO L225 Difference]: With dead ends: 39 [2023-11-19 07:36:01,376 INFO L226 Difference]: Without dead ends: 38 [2023-11-19 07:36:01,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=107, Invalid=407, Unknown=12, NotChecked=230, Total=756 [2023-11-19 07:36:01,378 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 12 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:36:01,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 50 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 119 Invalid, 0 Unknown, 122 Unchecked, 0.1s Time] [2023-11-19 07:36:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-11-19 07:36:01,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-11-19 07:36:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-19 07:36:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2023-11-19 07:36:01,387 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 55 [2023-11-19 07:36:01,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:36:01,388 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2023-11-19 07:36:01,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 1.625) internal successors, (26), 12 states have internal predecessors, (26), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2023-11-19 07:36:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2023-11-19 07:36:01,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-19 07:36:01,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:36:01,392 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-19 07:36:01,425 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-19 07:36:01,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-19 07:36:01,613 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 2 more)] === [2023-11-19 07:36:01,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:36:01,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1850205728, now seen corresponding path program 1 times [2023-11-19 07:36:01,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:36:01,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529959934] [2023-11-19 07:36:01,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:36:01,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:36:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:02,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-19 07:36:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:03,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:36:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:03,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:36:03,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:03,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:36:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:03,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:36:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:04,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:36:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:04,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:36:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:04,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-19 07:36:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:04,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:36:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:04,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:36:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:04,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:36:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:04,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:36:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:36:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:05,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-19 07:36:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2023-11-19 07:36:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:36:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529959934] [2023-11-19 07:36:05,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529959934] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:36:05,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532471157] [2023-11-19 07:36:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:36:05,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:36:05,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:36:05,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:36:05,220 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-19 07:36:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:36:05,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-19 07:36:05,390 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:36:05,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-19 07:36:05,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:36:07,714 WARN L854 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_30| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_30| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_30| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_30| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_30| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))) is different from false [2023-11-19 07:36:09,715 WARN L876 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_30| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_30| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_30| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_30| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_30| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))) is different from true [2023-11-19 07:36:11,787 WARN L854 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_32| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_32| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_32| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_32| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|)) is different from false [2023-11-19 07:36:13,789 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_32| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_32| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_32| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_32| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|)) is different from true [2023-11-19 07:36:13,875 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-19 07:36:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 306 proven. 24 refuted. 0 times theorem prover too weak. 227 trivial. 11 not checked. [2023-11-19 07:36:13,894 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:36:14,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532471157] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:36:14,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:36:14,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2023-11-19 07:36:14,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345745103] [2023-11-19 07:36:14,170 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:36:14,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-19 07:36:14,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:36:14,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-19 07:36:14,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=463, Unknown=10, NotChecked=90, Total=650 [2023-11-19 07:36:14,172 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 23 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 16 states have internal predecessors, (40), 9 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-19 07:36:16,289 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|))) (and (or (exists ((|v_old(#memory_int)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_32| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_32| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_32| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_32| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)))))) .cse1) (= (store |c_old(#memory_int)| c_func_to_recursive_line_21_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_21_to_21_0_~b.base)) |c_#memory_int|) (or .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_30| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_30| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse2) (= (store |v_old(#memory_int)_AFTER_CALL_30| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_30| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_30| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base))) is different from false [2023-11-19 07:36:18,291 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |c_#memory_int| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)) |c_#memory_int|))) (and (or (exists ((|v_old(#memory_int)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_32| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_32| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_32| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_32| |c_func_to_recursive_line_21_to_21_0_#in~b.base|)))))) .cse1) (= (store |c_old(#memory_int)| c_func_to_recursive_line_21_to_21_0_~b.base (select |c_#memory_int| c_func_to_recursive_line_21_to_21_0_~b.base)) |c_#memory_int|) (or .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_30| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_30| |c_#memory_int|))) (and (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| .cse2) (= (store |v_old(#memory_int)_AFTER_CALL_30| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_30| (store |c_old(#memory_int)| |c_func_to_recursive_line_21_to_21_0_#in~b.base| (select |v_old(#memory_int)_AFTER_CALL_30| |c_func_to_recursive_line_21_to_21_0_#in~b.base|))))))) (= |c_func_to_recursive_line_21_to_21_0_#in~b.base| c_func_to_recursive_line_21_to_21_0_~b.base))) is different from true [2023-11-19 07:36:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:36:18,598 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2023-11-19 07:36:18,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-19 07:36:18,599 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 16 states have internal predecessors, (40), 9 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 108 [2023-11-19 07:36:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:36:18,600 INFO L225 Difference]: With dead ends: 46 [2023-11-19 07:36:18,600 INFO L226 Difference]: Without dead ends: 0 [2023-11-19 07:36:18,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 138 SyntacticMatches, 14 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=288, Invalid=1194, Unknown=12, NotChecked=228, Total=1722 [2023-11-19 07:36:18,602 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:36:18,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 54 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 151 Invalid, 0 Unknown, 89 Unchecked, 0.1s Time] [2023-11-19 07:36:18,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-19 07:36:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-19 07:36:18,604 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-19 07:36:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-19 07:36:18,604 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2023-11-19 07:36:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:36:18,604 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-19 07:36:18,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 16 states have internal predecessors, (40), 9 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2023-11-19 07:36:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-19 07:36:18,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-19 07:36:18,607 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2023-11-19 07:36:18,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2023-11-19 07:36:18,608 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2023-11-19 07:36:18,609 INFO L805 garLoopResultBuilder]: Registering result SAFE for location func_to_recursive_line_21_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2023-11-19 07:36:18,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-19 07:36:18,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-19 07:36:18,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-19 07:36:19,200 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 50) no Hoare annotation was computed. [2023-11-19 07:36:19,201 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 50) no Hoare annotation was computed. [2023-11-19 07:36:19,201 INFO L895 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (let ((.cse3 (select (select |old(#memory_int)| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|))) (let ((.cse1 (select (select |#memory_int| func_to_recursive_line_20_to_21_0_~a.base) func_to_recursive_line_20_to_21_0_~a.offset)) (.cse0 (= |func_to_recursive_line_20_to_21_0_#in~a.base| |func_to_recursive_line_20_to_21_0_#in~b.base|)) (.cse2 (< .cse3 0))) (and (or .cse0 (and (<= 0 .cse1) (not (= func_to_recursive_line_20_to_21_0_~a.base func_to_recursive_line_20_to_21_0_~b.base))) .cse2) (or .cse0 (<= .cse1 1) (not (= .cse3 0))) (or (<= .cse1 5) .cse0 (< 1 .cse3) .cse2)))) [2023-11-19 07:36:19,201 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_20_to_21_0EXIT(lines 39 57) no Hoare annotation was computed. [2023-11-19 07:36:19,201 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-19 07:36:19,201 INFO L899 garLoopResultBuilder]: For program point L50-1(line 50) no Hoare annotation was computed. [2023-11-19 07:36:19,202 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse3 (select (select |old(#memory_int)| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|))) (let ((.cse0 (= |func_to_recursive_line_20_to_21_0_#in~a.base| |func_to_recursive_line_20_to_21_0_#in~b.base|)) (.cse1 (select (select |#memory_int| func_to_recursive_line_20_to_21_0_~a.base) func_to_recursive_line_20_to_21_0_~a.offset)) (.cse2 (select (select |#memory_int| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|)) (.cse4 (< .cse3 0))) (and (or .cse0 (and (<= .cse1 1) (<= .cse2 1)) (< 1 .cse3) .cse4) (or .cse0 (not (= .cse3 0)) (and (= .cse2 0) (= .cse1 0))) (or .cse0 (let ((.cse6 (select (select |old(#memory_int)| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|)) (.cse5 (select (select |#memory_int| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|))) (and (or (< .cse5 3) (< 2 .cse6)) (<= 0 .cse1) (or (< 4 .cse6) (< .cse5 5)) (= (select (select |#memory_int| func_to_recursive_line_20_to_21_0_~b.base) func_to_recursive_line_20_to_21_0_~b.offset) 0) (<= .cse1 5) (or (< 1 .cse6) (< .cse5 2)) (or (< 5 .cse6) (< .cse5 6)) (<= 0 .cse2) (or (< 3 .cse6) (< .cse5 4)) (not (= func_to_recursive_line_20_to_21_0_~a.base func_to_recursive_line_20_to_21_0_~b.base)))) .cse4)))) [2023-11-19 07:36:19,202 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2023-11-19 07:36:19,202 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 39 57) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (= |func_to_recursive_line_20_to_21_0_#in~a.base| |func_to_recursive_line_20_to_21_0_#in~b.base|) (< (select (select |old(#memory_int)| |func_to_recursive_line_20_to_21_0_#in~a.base|) |func_to_recursive_line_20_to_21_0_#in~a.offset|) 0)) [2023-11-19 07:36:19,202 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 56) no Hoare annotation was computed. [2023-11-19 07:36:19,202 INFO L899 garLoopResultBuilder]: For program point L41-1(lines 39 57) no Hoare annotation was computed. [2023-11-19 07:36:19,202 INFO L895 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: (and (= (select (select |#memory_int| |ULTIMATE.start_main_~#a~0#1.base|) |ULTIMATE.start_main_~#a~0#1.offset|) 0) (not (= |ULTIMATE.start_main_~#b~0#1.base| |ULTIMATE.start_main_~#a~0#1.base|))) [2023-11-19 07:36:19,202 INFO L899 garLoopResultBuilder]: For program point L67-2(lines 67 73) no Hoare annotation was computed. [2023-11-19 07:36:19,203 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-19 07:36:19,203 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-11-19 07:36:19,203 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-19 07:36:19,203 INFO L899 garLoopResultBuilder]: For program point L67-4(lines 67 73) no Hoare annotation was computed. [2023-11-19 07:36:19,203 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-19 07:36:19,203 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 21) no Hoare annotation was computed. [2023-11-19 07:36:19,203 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-19 07:36:19,203 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 59 75) no Hoare annotation was computed. [2023-11-19 07:36:19,203 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-19 07:36:19,204 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (let ((.cse1 (select (select |#memory_int| func_to_recursive_line_21_to_21_0_~b.base) func_to_recursive_line_21_to_21_0_~b.offset)) (.cse0 (select |old(#memory_int)| func_to_recursive_line_21_to_21_0_~b.base))) (and (= |#memory_int| (store |old(#memory_int)| func_to_recursive_line_21_to_21_0_~b.base (store .cse0 func_to_recursive_line_21_to_21_0_~b.offset .cse1))) (= |func_to_recursive_line_21_to_21_0_#in~b.offset| func_to_recursive_line_21_to_21_0_~b.offset) (= func_to_recursive_line_21_to_21_0_~b.base |func_to_recursive_line_21_to_21_0_#in~b.base|) (<= 0 (+ .cse1 2147483648)) (<= .cse1 (+ (select .cse0 func_to_recursive_line_21_to_21_0_~b.offset) 1)))) (< (+ (select (select |old(#memory_int)| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|) 2147483648) 0)) [2023-11-19 07:36:19,204 INFO L899 garLoopResultBuilder]: For program point L30(line 30) no Hoare annotation was computed. [2023-11-19 07:36:19,204 INFO L899 garLoopResultBuilder]: For program point L30-1(line 30) no Hoare annotation was computed. [2023-11-19 07:36:19,204 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 36) no Hoare annotation was computed. [2023-11-19 07:36:19,204 INFO L899 garLoopResultBuilder]: For program point L25-1(lines 23 37) no Hoare annotation was computed. [2023-11-19 07:36:19,204 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_21_to_21_0EXIT(lines 23 37) no Hoare annotation was computed. [2023-11-19 07:36:19,204 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 23 37) the Hoare annotation is: (or (= |#memory_int| |old(#memory_int)|) (< (+ (select (select |old(#memory_int)| |func_to_recursive_line_21_to_21_0_#in~b.base|) |func_to_recursive_line_21_to_21_0_#in~b.offset|) 2147483648) 0)) [2023-11-19 07:36:19,205 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_21_to_21_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-11-19 07:36:19,205 INFO L899 garLoopResultBuilder]: For program point func_to_recursive_line_21_to_21_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2023-11-19 07:36:19,208 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2023-11-19 07:36:19,210 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:36:19,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:36:19 BoogieIcfgContainer [2023-11-19 07:36:19,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:36:19,216 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:36:19,216 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:36:19,216 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:36:19,217 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:35:26" (3/4) ... [2023-11-19 07:36:19,219 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-19 07:36:19,224 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_20_to_21_0 [2023-11-19 07:36:19,224 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure func_to_recursive_line_21_to_21_0 [2023-11-19 07:36:19,229 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-19 07:36:19,229 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2023-11-19 07:36:19,230 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-19 07:36:19,230 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-19 07:36:19,321 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/witness.graphml [2023-11-19 07:36:19,322 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/witness.yml [2023-11-19 07:36:19,322 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:36:19,323 INFO L158 Benchmark]: Toolchain (without parser) took 53436.54ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 109.4MB in the beginning and 185.7MB in the end (delta: -76.3MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2023-11-19 07:36:19,323 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 115.3MB. Free memory was 68.5MB in the beginning and 68.3MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:36:19,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.90ms. Allocated memory is still 155.2MB. Free memory was 109.0MB in the beginning and 99.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-19 07:36:19,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.50ms. Allocated memory is still 155.2MB. Free memory was 99.1MB in the beginning and 97.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:36:19,324 INFO L158 Benchmark]: Boogie Preprocessor took 53.09ms. Allocated memory is still 155.2MB. Free memory was 97.6MB in the beginning and 96.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:36:19,325 INFO L158 Benchmark]: RCFGBuilder took 409.68ms. Allocated memory is still 155.2MB. Free memory was 96.4MB in the beginning and 84.9MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:36:19,326 INFO L158 Benchmark]: TraceAbstraction took 52566.59ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 84.2MB in the beginning and 190.9MB in the end (delta: -106.7MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. [2023-11-19 07:36:19,326 INFO L158 Benchmark]: Witness Printer took 106.41ms. Allocated memory is still 245.4MB. Free memory was 190.9MB in the beginning and 185.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-19 07:36:19,334 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.32ms. Allocated memory is still 115.3MB. Free memory was 68.5MB in the beginning and 68.3MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.90ms. Allocated memory is still 155.2MB. Free memory was 109.0MB in the beginning and 99.1MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.50ms. Allocated memory is still 155.2MB. Free memory was 99.1MB in the beginning and 97.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.09ms. Allocated memory is still 155.2MB. Free memory was 97.6MB in the beginning and 96.4MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 409.68ms. Allocated memory is still 155.2MB. Free memory was 96.4MB in the beginning and 84.9MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 52566.59ms. Allocated memory was 155.2MB in the beginning and 245.4MB in the end (delta: 90.2MB). Free memory was 84.2MB in the beginning and 190.9MB in the end (delta: -106.7MB). Peak memory consumption was 108.1MB. Max. memory is 16.1GB. * Witness Printer took 106.41ms. Allocated memory is still 245.4MB. Free memory was 190.9MB in the beginning and 185.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 52.5s, OverallIterations: 8, TraceHistogramMax: 14, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 119 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 119 mSDsluCounter, 589 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 211 IncrementalHoareTripleChecker+Unchecked, 473 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1103 IncrementalHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 116 mSDtfsCounter, 1103 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 539 GetRequests, 319 SyntacticMatches, 29 SemanticMatches, 191 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1914 ImplicationChecksByTransitivity, 35.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=7, InterpolantAutomatonStates: 95, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 49 PreInvPairs, 53 NumberOfFragments, 341 HoareAnnotationTreeSize, 49 FomulaSimplifications, 108 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 436 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 39.2s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 590 ConstructedInterpolants, 6 QuantifiedInterpolants, 5550 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1119 ConjunctsInSsa, 277 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 1357/1649 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-19 07:36:19,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_97ed986d-a23e-4fa5-aedb-330d328d5639/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE