./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_10-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 23:30:58,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 23:30:58,775 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-27 23:30:58,782 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 23:30:58,782 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 23:30:58,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 23:30:58,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 23:30:58,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 23:30:58,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 23:30:58,814 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 23:30:58,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 23:30:58,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 23:30:58,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 23:30:58,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 23:30:58,816 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 23:30:58,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 23:30:58,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 23:30:58,816 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 23:30:58,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 23:30:58,817 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 23:30:58,817 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 23:30:58,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 23:30:58,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 23:30:58,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 23:30:58,817 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 23:30:58,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 23:30:58,818 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 23:30:58,818 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 23:30:58,818 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 23:30:58,818 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:30:58,819 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:30:58,819 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:30:58,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:30:58,819 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 23:30:58,819 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 23:30:58,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 23:30:58,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 23:30:58,820 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:30:58,820 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 23:30:58,821 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 23:30:58,821 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 23:30:58,821 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 23:30:58,821 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 23:30:58,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 23:30:58,821 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 23:30:58,821 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 23:30:58,822 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 23:30:58,822 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 23:30:58,822 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> acde98dd01af02b5a508b32116f1b2c3612f1f84e6ba2fe02fc76c333a1d32d3 [2024-11-27 23:30:59,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 23:30:59,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 23:30:59,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 23:30:59,167 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 23:30:59,167 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 23:30:59,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2024-11-27 23:31:02,472 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/data/37da789f9/3f5b6dcdcdd54696b1fcb024eb1679ed/FLAGb2dfd4433 [2024-11-27 23:31:02,818 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 23:31:02,819 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2024-11-27 23:31:02,829 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/data/37da789f9/3f5b6dcdcdd54696b1fcb024eb1679ed/FLAGb2dfd4433 [2024-11-27 23:31:02,856 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/data/37da789f9/3f5b6dcdcdd54696b1fcb024eb1679ed [2024-11-27 23:31:02,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 23:31:02,864 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 23:31:02,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 23:31:02,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 23:31:02,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 23:31:02,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:31:02" (1/1) ... [2024-11-27 23:31:02,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc55bf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:02, skipping insertion in model container [2024-11-27 23:31:02,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:31:02" (1/1) ... [2024-11-27 23:31:02,898 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 23:31:03,101 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2024-11-27 23:31:03,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:31:03,122 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 23:31:03,144 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2024-11-27 23:31:03,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 23:31:03,166 INFO L204 MainTranslator]: Completed translation [2024-11-27 23:31:03,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03 WrapperNode [2024-11-27 23:31:03,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 23:31:03,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 23:31:03,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 23:31:03,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 23:31:03,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,220 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2024-11-27 23:31:03,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 23:31:03,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 23:31:03,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 23:31:03,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 23:31:03,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,252 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 23:31:03,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,261 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,270 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 23:31:03,274 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 23:31:03,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 23:31:03,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 23:31:03,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (1/1) ... [2024-11-27 23:31:03,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 23:31:03,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:03,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 23:31:03,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 23:31:03,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 23:31:03,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 23:31:03,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 23:31:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 23:31:03,365 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2024-11-27 23:31:03,365 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2024-11-27 23:31:03,443 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 23:31:03,446 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 23:31:03,598 INFO L? ?]: Removed 6 outVars from TransFormulas that were not future-live. [2024-11-27 23:31:03,598 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 23:31:03,612 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 23:31:03,613 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-27 23:31:03,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:31:03 BoogieIcfgContainer [2024-11-27 23:31:03,615 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 23:31:03,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 23:31:03,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 23:31:03,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 23:31:03,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:31:02" (1/3) ... [2024-11-27 23:31:03,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ae395e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:31:03, skipping insertion in model container [2024-11-27 23:31:03,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:31:03" (2/3) ... [2024-11-27 23:31:03,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ae395e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:31:03, skipping insertion in model container [2024-11-27 23:31:03,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:31:03" (3/3) ... [2024-11-27 23:31:03,631 INFO L128 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2024-11-27 23:31:03,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 23:31:03,653 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fibo_10-1.c that has 2 procedures, 20 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2024-11-27 23:31:03,716 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 23:31:03,732 INFO L333 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, 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;@6ae1d46f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 23:31:03,732 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 23:31:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-27 23:31:03,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-27 23:31:03,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:03,746 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:03,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:03,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:03,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2024-11-27 23:31:03,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:03,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123417461] [2024-11-27 23:31:03,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:03,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:31:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:04,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123417461] [2024-11-27 23:31:04,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123417461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:31:04,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:31:04,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:31:04,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589146891] [2024-11-27 23:31:04,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:31:04,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:31:04,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:04,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:31:04,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:31:04,125 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:31:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:04,181 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-27 23:31:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:31:04,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2024-11-27 23:31:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:04,191 INFO L225 Difference]: With dead ends: 30 [2024-11-27 23:31:04,192 INFO L226 Difference]: Without dead ends: 18 [2024-11-27 23:31:04,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:31:04,198 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:04,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:31:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-27 23:31:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-27 23:31:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-27 23:31:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-27 23:31:04,245 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2024-11-27 23:31:04,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:04,245 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-27 23:31:04,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:31:04,246 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-27 23:31:04,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-27 23:31:04,247 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:04,247 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:04,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 23:31:04,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:04,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:04,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2024-11-27 23:31:04,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:04,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467889800] [2024-11-27 23:31:04,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:04,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 23:31:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467889800] [2024-11-27 23:31:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467889800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 23:31:04,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 23:31:04,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 23:31:04,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893157750] [2024-11-27 23:31:04,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 23:31:04,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 23:31:04,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:04,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 23:31:04,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:31:04,385 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:31:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:04,411 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2024-11-27 23:31:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 23:31:04,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-27 23:31:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:04,413 INFO L225 Difference]: With dead ends: 24 [2024-11-27 23:31:04,413 INFO L226 Difference]: Without dead ends: 20 [2024-11-27 23:31:04,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 23:31:04,415 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:04,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 23:31:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-27 23:31:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2024-11-27 23:31:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-27 23:31:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-27 23:31:04,421 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2024-11-27 23:31:04,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:04,421 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-27 23:31:04,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-27 23:31:04,421 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-27 23:31:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-27 23:31:04,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:04,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:04,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 23:31:04,422 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:04,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2024-11-27 23:31:04,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:04,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802362792] [2024-11-27 23:31:04,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:04,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 23:31:04,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:04,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802362792] [2024-11-27 23:31:04,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802362792] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:04,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077517468] [2024-11-27 23:31:04,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:04,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:04,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:04,605 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:04,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 23:31:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:04,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 23:31:04,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-27 23:31:04,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 23:31:05,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077517468] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:05,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:05,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 11 [2024-11-27 23:31:05,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146516529] [2024-11-27 23:31:05,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:05,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 23:31:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:05,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 23:31:05,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-27 23:31:05,316 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-27 23:31:05,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:05,496 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2024-11-27 23:31:05,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:31:05,497 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2024-11-27 23:31:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:05,499 INFO L225 Difference]: With dead ends: 35 [2024-11-27 23:31:05,499 INFO L226 Difference]: Without dead ends: 20 [2024-11-27 23:31:05,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-27 23:31:05,501 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:05,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 48 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:31:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-27 23:31:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-27 23:31:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-27 23:31:05,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-11-27 23:31:05,512 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2024-11-27 23:31:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:05,513 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-11-27 23:31:05,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.5) internal successors, (28), 11 states have internal predecessors, (28), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-27 23:31:05,515 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-11-27 23:31:05,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-27 23:31:05,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:05,517 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:05,532 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 23:31:05,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-27 23:31:05,718 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:05,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:05,719 INFO L85 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2024-11-27 23:31:05,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:05,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49698114] [2024-11-27 23:31:05,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:05,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 23:31:05,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:05,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49698114] [2024-11-27 23:31:05,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49698114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:05,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842563161] [2024-11-27 23:31:05,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 23:31:05,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:05,889 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:05,894 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:05,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 23:31:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:05,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-27 23:31:05,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-27 23:31:06,033 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-27 23:31:06,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842563161] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:06,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:06,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2024-11-27 23:31:06,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483312051] [2024-11-27 23:31:06,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:06,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 23:31:06,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:06,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 23:31:06,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-27 23:31:06,334 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 23:31:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:06,463 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2024-11-27 23:31:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 23:31:06,464 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2024-11-27 23:31:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:06,465 INFO L225 Difference]: With dead ends: 29 [2024-11-27 23:31:06,465 INFO L226 Difference]: Without dead ends: 25 [2024-11-27 23:31:06,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-27 23:31:06,467 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:06,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:31:06,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-27 23:31:06,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-27 23:31:06,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-27 23:31:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2024-11-27 23:31:06,486 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2024-11-27 23:31:06,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:06,491 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2024-11-27 23:31:06,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 9 states have internal predecessors, (23), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-27 23:31:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2024-11-27 23:31:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-27 23:31:06,492 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:06,493 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:06,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-27 23:31:06,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:06,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:06,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:06,700 INFO L85 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2024-11-27 23:31:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:06,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762673615] [2024-11-27 23:31:06,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:31:06,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:06,726 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:31:06,726 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-27 23:31:07,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762673615] [2024-11-27 23:31:07,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762673615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:07,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448209942] [2024-11-27 23:31:07,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:31:07,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:07,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:07,186 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:07,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 23:31:07,253 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:31:07,253 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:07,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 23:31:07,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:07,398 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-27 23:31:07,398 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-27 23:31:07,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448209942] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:07,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:07,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 20 [2024-11-27 23:31:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098614451] [2024-11-27 23:31:07,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:07,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-27 23:31:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:07,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-27 23:31:07,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-27 23:31:07,933 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-27 23:31:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:08,360 INFO L93 Difference]: Finished difference Result 46 states and 83 transitions. [2024-11-27 23:31:08,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 23:31:08,361 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2024-11-27 23:31:08,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:08,363 INFO L225 Difference]: With dead ends: 46 [2024-11-27 23:31:08,363 INFO L226 Difference]: Without dead ends: 42 [2024-11-27 23:31:08,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2024-11-27 23:31:08,364 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:08,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 95 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:31:08,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-27 23:31:08,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2024-11-27 23:31:08,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (20), 7 states have call predecessors, (20), 5 states have call successors, (20) [2024-11-27 23:31:08,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 46 transitions. [2024-11-27 23:31:08,377 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 46 transitions. Word has length 37 [2024-11-27 23:31:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:08,377 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 46 transitions. [2024-11-27 23:31:08,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.388888888888889) internal successors, (43), 17 states have internal predecessors, (43), 10 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-27 23:31:08,377 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 46 transitions. [2024-11-27 23:31:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-27 23:31:08,379 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:08,380 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 8, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:08,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-27 23:31:08,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:08,584 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:08,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:08,584 INFO L85 PathProgramCache]: Analyzing trace with hash 710953508, now seen corresponding path program 3 times [2024-11-27 23:31:08,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:08,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081675694] [2024-11-27 23:31:08,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:31:08,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:08,647 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-27 23:31:08,648 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 167 proven. 27 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-27 23:31:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:08,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081675694] [2024-11-27 23:31:08,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081675694] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:08,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71871237] [2024-11-27 23:31:08,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:31:08,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:08,860 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:08,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 23:31:08,939 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-27 23:31:08,940 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:08,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-27 23:31:08,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:09,016 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-27 23:31:09,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 169 proven. 25 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2024-11-27 23:31:09,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71871237] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:09,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:09,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 13 [2024-11-27 23:31:09,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882865208] [2024-11-27 23:31:09,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:09,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 23:31:09,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:09,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 23:31:09,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-27 23:31:09,738 INFO L87 Difference]: Start difference. First operand 30 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-27 23:31:09,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:09,920 INFO L93 Difference]: Finished difference Result 62 states and 110 transitions. [2024-11-27 23:31:09,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 23:31:09,921 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) Word has length 90 [2024-11-27 23:31:09,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:09,922 INFO L225 Difference]: With dead ends: 62 [2024-11-27 23:31:09,923 INFO L226 Difference]: Without dead ends: 35 [2024-11-27 23:31:09,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 172 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-11-27 23:31:09,925 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:09,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 62 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:31:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-27 23:31:09,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2024-11-27 23:31:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (18), 7 states have call predecessors, (18), 5 states have call successors, (18) [2024-11-27 23:31:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2024-11-27 23:31:09,942 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 90 [2024-11-27 23:31:09,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:09,943 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2024-11-27 23:31:09,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 13 states have internal predecessors, (42), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (13), 4 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-27 23:31:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2024-11-27 23:31:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-27 23:31:09,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:09,945 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:09,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-27 23:31:10,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-27 23:31:10,150 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:10,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:10,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2015531204, now seen corresponding path program 4 times [2024-11-27 23:31:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550587689] [2024-11-27 23:31:10,153 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 23:31:10,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:10,177 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 23:31:10,178 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-27 23:31:10,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550587689] [2024-11-27 23:31:10,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550587689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:10,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137488738] [2024-11-27 23:31:10,374 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 23:31:10,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:10,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:10,376 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:10,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 23:31:10,455 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 23:31:10,455 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:10,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-27 23:31:10,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-27 23:31:10,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-27 23:31:11,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137488738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:11,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:11,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2024-11-27 23:31:11,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597304434] [2024-11-27 23:31:11,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:11,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 23:31:11,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:11,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 23:31:11,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-27 23:31:11,383 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-27 23:31:11,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:11,563 INFO L93 Difference]: Finished difference Result 41 states and 63 transitions. [2024-11-27 23:31:11,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 23:31:11,564 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) Word has length 65 [2024-11-27 23:31:11,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:11,566 INFO L225 Difference]: With dead ends: 41 [2024-11-27 23:31:11,566 INFO L226 Difference]: Without dead ends: 37 [2024-11-27 23:31:11,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 124 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2024-11-27 23:31:11,568 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 27 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:11,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 65 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:31:11,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-27 23:31:11,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-27 23:31:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (27), 9 states have call predecessors, (27), 6 states have call successors, (27) [2024-11-27 23:31:11,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 59 transitions. [2024-11-27 23:31:11,580 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 59 transitions. Word has length 65 [2024-11-27 23:31:11,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:11,580 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 59 transitions. [2024-11-27 23:31:11,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 13 states have internal predecessors, (40), 10 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (13), 5 states have call predecessors, (13), 10 states have call successors, (13) [2024-11-27 23:31:11,581 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 59 transitions. [2024-11-27 23:31:11,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-27 23:31:11,583 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:11,583 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:11,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-27 23:31:11,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:11,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:11,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1108497964, now seen corresponding path program 5 times [2024-11-27 23:31:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:11,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185560450] [2024-11-27 23:31:11,785 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 23:31:11,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:11,810 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-27 23:31:11,810 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 135 proven. 258 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2024-11-27 23:31:12,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:12,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185560450] [2024-11-27 23:31:12,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185560450] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:12,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45761065] [2024-11-27 23:31:12,079 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 23:31:12,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:12,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:12,082 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:12,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-27 23:31:12,166 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2024-11-27 23:31:12,167 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:12,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-27 23:31:12,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 422 proven. 118 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2024-11-27 23:31:12,308 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 133 proven. 274 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-27 23:31:13,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45761065] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:13,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:13,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 14] total 21 [2024-11-27 23:31:13,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033443767] [2024-11-27 23:31:13,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:13,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-27 23:31:13,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:13,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-27 23:31:13,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-11-27 23:31:13,567 INFO L87 Difference]: Start difference. First operand 37 states and 59 transitions. Second operand has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (24), 9 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-27 23:31:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:13,918 INFO L93 Difference]: Finished difference Result 80 states and 141 transitions. [2024-11-27 23:31:13,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-27 23:31:13,919 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (24), 9 states have call predecessors, (24), 13 states have call successors, (24) Word has length 120 [2024-11-27 23:31:13,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:13,921 INFO L225 Difference]: With dead ends: 80 [2024-11-27 23:31:13,921 INFO L226 Difference]: Without dead ends: 46 [2024-11-27 23:31:13,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 228 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=752, Unknown=0, NotChecked=0, Total=1056 [2024-11-27 23:31:13,924 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 49 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:13,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 107 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:31:13,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-27 23:31:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-27 23:31:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2024-11-27 23:31:13,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2024-11-27 23:31:13,945 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 120 [2024-11-27 23:31:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:13,946 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2024-11-27 23:31:13,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.142857142857143) internal successors, (66), 21 states have internal predecessors, (66), 13 states have call successors, (20), 2 states have call predecessors, (20), 8 states have return successors, (24), 9 states have call predecessors, (24), 13 states have call successors, (24) [2024-11-27 23:31:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2024-11-27 23:31:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-27 23:31:13,950 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:13,950 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:13,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-27 23:31:14,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:14,155 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:14,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:14,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1447005449, now seen corresponding path program 6 times [2024-11-27 23:31:14,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:14,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015581928] [2024-11-27 23:31:14,156 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-27 23:31:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:14,192 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-11-27 23:31:14,192 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 55 proven. 317 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-27 23:31:14,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:14,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015581928] [2024-11-27 23:31:14,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015581928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:14,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829196578] [2024-11-27 23:31:14,445 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-27 23:31:14,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:14,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:14,447 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:14,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-27 23:31:14,561 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-11-27 23:31:14,562 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:14,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-27 23:31:14,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2024-11-27 23:31:14,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 352 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2024-11-27 23:31:15,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829196578] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:15,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:15,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 16 [2024-11-27 23:31:15,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908764356] [2024-11-27 23:31:15,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:15,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-27 23:31:15,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:15,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-27 23:31:15,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-27 23:31:15,765 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-27 23:31:15,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:15,908 INFO L93 Difference]: Finished difference Result 55 states and 74 transitions. [2024-11-27 23:31:15,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 23:31:15,908 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) Word has length 133 [2024-11-27 23:31:15,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:15,910 INFO L225 Difference]: With dead ends: 55 [2024-11-27 23:31:15,910 INFO L226 Difference]: Without dead ends: 51 [2024-11-27 23:31:15,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 258 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2024-11-27 23:31:15,912 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:15,912 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 65 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:31:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-27 23:31:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-27 23:31:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 8 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (24), 11 states have call predecessors, (24), 8 states have call successors, (24) [2024-11-27 23:31:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2024-11-27 23:31:15,921 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 133 [2024-11-27 23:31:15,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:15,922 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2024-11-27 23:31:15,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 3.5) internal successors, (49), 16 states have internal predecessors, (49), 12 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-27 23:31:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2024-11-27 23:31:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-27 23:31:15,925 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:15,925 INFO L218 NwaCegarLoop]: trace histogram [35, 35, 28, 17, 17, 17, 17, 17, 17, 17, 11, 7, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:15,935 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-27 23:31:16,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:16,126 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:16,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:16,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1830341289, now seen corresponding path program 7 times [2024-11-27 23:31:16,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:16,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396515333] [2024-11-27 23:31:16,127 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-27 23:31:16,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:16,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 139 proven. 815 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-11-27 23:31:16,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:16,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396515333] [2024-11-27 23:31:16,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396515333] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:16,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416050844] [2024-11-27 23:31:16,608 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-27 23:31:16,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:16,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:16,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:16,613 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-27 23:31:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:16,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-27 23:31:16,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 139 proven. 815 refuted. 0 times theorem prover too weak. 2348 trivial. 0 not checked. [2024-11-27 23:31:16,859 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 139 proven. 855 refuted. 0 times theorem prover too weak. 2308 trivial. 0 not checked. [2024-11-27 23:31:18,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416050844] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:18,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:18,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2024-11-27 23:31:18,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205055994] [2024-11-27 23:31:18,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:18,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-27 23:31:18,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:18,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-27 23:31:18,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2024-11-27 23:31:18,798 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2024-11-27 23:31:19,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:19,025 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2024-11-27 23:31:19,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 23:31:19,026 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) Word has length 242 [2024-11-27 23:31:19,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:19,029 INFO L225 Difference]: With dead ends: 60 [2024-11-27 23:31:19,029 INFO L226 Difference]: Without dead ends: 56 [2024-11-27 23:31:19,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 476 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2024-11-27 23:31:19,030 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 57 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:19,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 86 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:31:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-27 23:31:19,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-27 23:31:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 9 states have call successors, (9), 5 states have call predecessors, (9), 8 states have return successors, (34), 13 states have call predecessors, (34), 9 states have call successors, (34) [2024-11-27 23:31:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2024-11-27 23:31:19,042 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 242 [2024-11-27 23:31:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:19,043 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2024-11-27 23:31:19,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.466666666666667) internal successors, (52), 17 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (19), 7 states have call predecessors, (19), 14 states have call successors, (19) [2024-11-27 23:31:19,044 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2024-11-27 23:31:19,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2024-11-27 23:31:19,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:19,052 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 53, 32, 32, 32, 32, 32, 32, 32, 21, 12, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:19,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-27 23:31:19,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-27 23:31:19,256 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:19,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:19,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2121548198, now seen corresponding path program 8 times [2024-11-27 23:31:19,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:19,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050123606] [2024-11-27 23:31:19,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:31:19,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:19,332 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:31:19,332 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1918 refuted. 0 times theorem prover too weak. 9431 trivial. 0 not checked. [2024-11-27 23:31:20,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:20,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050123606] [2024-11-27 23:31:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050123606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:20,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254235088] [2024-11-27 23:31:20,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:31:20,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:20,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:20,107 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:20,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-27 23:31:20,381 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:31:20,382 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:20,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-27 23:31:20,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:20,516 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1918 refuted. 0 times theorem prover too weak. 9431 trivial. 0 not checked. [2024-11-27 23:31:20,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:23,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11682 backedges. 333 proven. 1975 refuted. 0 times theorem prover too weak. 9374 trivial. 0 not checked. [2024-11-27 23:31:23,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254235088] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:23,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:23,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2024-11-27 23:31:23,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656058941] [2024-11-27 23:31:23,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:23,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-27 23:31:23,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:23,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-27 23:31:23,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-27 23:31:23,929 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-27 23:31:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:24,178 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2024-11-27 23:31:24,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 23:31:24,179 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) Word has length 447 [2024-11-27 23:31:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:24,181 INFO L225 Difference]: With dead ends: 65 [2024-11-27 23:31:24,181 INFO L226 Difference]: Without dead ends: 61 [2024-11-27 23:31:24,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 915 GetRequests, 885 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2024-11-27 23:31:24,183 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 69 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:24,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 89 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:31:24,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-27 23:31:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-27 23:31:24,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 9 states have return successors, (46), 15 states have call predecessors, (46), 10 states have call successors, (46) [2024-11-27 23:31:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 100 transitions. [2024-11-27 23:31:24,209 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 100 transitions. Word has length 447 [2024-11-27 23:31:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:24,212 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 100 transitions. [2024-11-27 23:31:24,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.411764705882353) internal successors, (58), 19 states have internal predecessors, (58), 16 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-27 23:31:24,214 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 100 transitions. [2024-11-27 23:31:24,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2024-11-27 23:31:24,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:24,227 INFO L218 NwaCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:24,240 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-27 23:31:24,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-27 23:31:24,431 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:24,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:24,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1970146836, now seen corresponding path program 9 times [2024-11-27 23:31:24,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:24,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354209039] [2024-11-27 23:31:24,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:31:24,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:24,500 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2024-11-27 23:31:24,500 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1612 proven. 274 refuted. 0 times theorem prover too weak. 14521 trivial. 0 not checked. [2024-11-27 23:31:24,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:24,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354209039] [2024-11-27 23:31:24,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354209039] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:24,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672188645] [2024-11-27 23:31:24,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:31:24,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:24,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:24,828 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:24,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-27 23:31:25,075 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2024-11-27 23:31:25,076 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:25,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-27 23:31:25,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:25,190 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1662 proven. 279 refuted. 0 times theorem prover too weak. 14466 trivial. 0 not checked. [2024-11-27 23:31:25,192 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1668 proven. 305 refuted. 0 times theorem prover too weak. 14434 trivial. 0 not checked. [2024-11-27 23:31:27,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672188645] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:27,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:27,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 17 [2024-11-27 23:31:27,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038549231] [2024-11-27 23:31:27,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:27,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-27 23:31:27,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:27,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-27 23:31:27,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-11-27 23:31:27,691 INFO L87 Difference]: Start difference. First operand 61 states and 100 transitions. Second operand has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-27 23:31:27,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:27,962 INFO L93 Difference]: Finished difference Result 164 states and 358 transitions. [2024-11-27 23:31:27,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 23:31:27,962 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) Word has length 528 [2024-11-27 23:31:27,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:27,967 INFO L225 Difference]: With dead ends: 164 [2024-11-27 23:31:27,967 INFO L226 Difference]: Without dead ends: 105 [2024-11-27 23:31:27,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1073 GetRequests, 1047 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2024-11-27 23:31:27,969 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 81 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:27,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 68 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:31:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-27 23:31:27,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 76. [2024-11-27 23:31:27,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 50 states have internal predecessors, (56), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (63), 18 states have call predecessors, (63), 14 states have call successors, (63) [2024-11-27 23:31:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 133 transitions. [2024-11-27 23:31:27,997 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 133 transitions. Word has length 528 [2024-11-27 23:31:27,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:27,998 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 133 transitions. [2024-11-27 23:31:27,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 17 states have internal predecessors, (50), 9 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 10 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-27 23:31:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 133 transitions. [2024-11-27 23:31:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2024-11-27 23:31:28,003 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:28,003 INFO L218 NwaCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:28,015 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-27 23:31:28,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-27 23:31:28,208 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:28,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:28,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1550468663, now seen corresponding path program 10 times [2024-11-27 23:31:28,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:28,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596838562] [2024-11-27 23:31:28,209 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 23:31:28,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:28,291 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 23:31:28,292 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 2942 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2024-11-27 23:31:28,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:28,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596838562] [2024-11-27 23:31:28,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596838562] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:28,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334953490] [2024-11-27 23:31:28,996 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 23:31:28,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:28,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:28,998 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:29,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-27 23:31:29,280 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 23:31:29,280 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:29,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-27 23:31:29,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 2942 refuted. 0 times theorem prover too weak. 15760 trivial. 0 not checked. [2024-11-27 23:31:29,433 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:33,392 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 401 proven. 3019 refuted. 0 times theorem prover too weak. 15683 trivial. 0 not checked. [2024-11-27 23:31:33,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334953490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:33,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:33,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2024-11-27 23:31:33,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891138412] [2024-11-27 23:31:33,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:33,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-27 23:31:33,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:33,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-27 23:31:33,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2024-11-27 23:31:33,396 INFO L87 Difference]: Start difference. First operand 76 states and 133 transitions. Second operand has 21 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 21 states have internal predecessors, (64), 18 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-27 23:31:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:33,699 INFO L93 Difference]: Finished difference Result 92 states and 170 transitions. [2024-11-27 23:31:33,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:31:33,700 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 21 states have internal predecessors, (64), 18 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 18 states have call successors, (25) Word has length 569 [2024-11-27 23:31:33,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:33,704 INFO L225 Difference]: With dead ends: 92 [2024-11-27 23:31:33,704 INFO L226 Difference]: Without dead ends: 88 [2024-11-27 23:31:33,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1162 GetRequests, 1128 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=518, Unknown=0, NotChecked=0, Total=756 [2024-11-27 23:31:33,705 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 93 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:33,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 90 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:31:33,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-27 23:31:33,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2024-11-27 23:31:33,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 53 states have internal predecessors, (59), 15 states have call successors, (15), 7 states have call predecessors, (15), 11 states have return successors, (76), 20 states have call predecessors, (76), 15 states have call successors, (76) [2024-11-27 23:31:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 150 transitions. [2024-11-27 23:31:33,723 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 150 transitions. Word has length 569 [2024-11-27 23:31:33,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:33,724 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 150 transitions. [2024-11-27 23:31:33,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 21 states have internal predecessors, (64), 18 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 9 states have call predecessors, (25), 18 states have call successors, (25) [2024-11-27 23:31:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 150 transitions. [2024-11-27 23:31:33,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2024-11-27 23:31:33,736 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:33,736 INFO L218 NwaCegarLoop]: trace histogram [163, 163, 131, 81, 81, 81, 81, 81, 81, 81, 50, 32, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:33,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-27 23:31:33,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:33,941 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:33,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:33,942 INFO L85 PathProgramCache]: Analyzing trace with hash -386939895, now seen corresponding path program 11 times [2024-11-27 23:31:33,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:33,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77146214] [2024-11-27 23:31:33,942 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 23:31:33,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:34,161 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2024-11-27 23:31:34,161 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 74287 backedges. 3534 proven. 5404 refuted. 0 times theorem prover too weak. 65349 trivial. 0 not checked. [2024-11-27 23:31:35,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:35,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77146214] [2024-11-27 23:31:35,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77146214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:35,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843361516] [2024-11-27 23:31:35,187 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 23:31:35,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:35,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:35,190 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:35,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-27 23:31:35,671 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2024-11-27 23:31:35,671 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:35,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-27 23:31:35,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 74287 backedges. 40049 proven. 948 refuted. 0 times theorem prover too weak. 33290 trivial. 0 not checked. [2024-11-27 23:31:35,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 74287 backedges. 3521 proven. 5444 refuted. 0 times theorem prover too weak. 65322 trivial. 0 not checked. [2024-11-27 23:31:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843361516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:41,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:41,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 21] total 25 [2024-11-27 23:31:41,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979346449] [2024-11-27 23:31:41,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:41,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-27 23:31:41,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:41,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-27 23:31:41,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2024-11-27 23:31:41,561 INFO L87 Difference]: Start difference. First operand 81 states and 150 transitions. Second operand has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 20 states have call successors, (27), 2 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 20 states have call successors, (36) [2024-11-27 23:31:42,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:42,020 INFO L93 Difference]: Finished difference Result 221 states and 538 transitions. [2024-11-27 23:31:42,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-27 23:31:42,021 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 20 states have call successors, (27), 2 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 20 states have call successors, (36) Word has length 1113 [2024-11-27 23:31:42,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:42,025 INFO L225 Difference]: With dead ends: 221 [2024-11-27 23:31:42,026 INFO L226 Difference]: Without dead ends: 130 [2024-11-27 23:31:42,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2259 GetRequests, 2213 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=382, Invalid=1024, Unknown=0, NotChecked=0, Total=1406 [2024-11-27 23:31:42,029 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:42,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 195 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 23:31:42,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-11-27 23:31:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2024-11-27 23:31:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 86 states have internal predecessors, (94), 24 states have call successors, (24), 18 states have call predecessors, (24), 12 states have return successors, (93), 22 states have call predecessors, (93), 24 states have call successors, (93) [2024-11-27 23:31:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 211 transitions. [2024-11-27 23:31:42,051 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 211 transitions. Word has length 1113 [2024-11-27 23:31:42,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:42,052 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 211 transitions. [2024-11-27 23:31:42,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.44) internal successors, (86), 25 states have internal predecessors, (86), 20 states have call successors, (27), 2 states have call predecessors, (27), 11 states have return successors, (36), 14 states have call predecessors, (36), 20 states have call successors, (36) [2024-11-27 23:31:42,052 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 211 transitions. [2024-11-27 23:31:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2024-11-27 23:31:42,060 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:42,060 INFO L218 NwaCegarLoop]: trace histogram [115, 115, 93, 57, 57, 57, 57, 57, 57, 57, 36, 22, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:42,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-27 23:31:42,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-27 23:31:42,264 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:42,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:42,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1004928639, now seen corresponding path program 12 times [2024-11-27 23:31:42,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:42,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138384656] [2024-11-27 23:31:42,265 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-27 23:31:42,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:42,368 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2024-11-27 23:31:42,369 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:42,751 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 1313 proven. 3454 refuted. 0 times theorem prover too weak. 32115 trivial. 0 not checked. [2024-11-27 23:31:42,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:42,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138384656] [2024-11-27 23:31:42,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138384656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:42,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325728010] [2024-11-27 23:31:42,751 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-27 23:31:42,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:42,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:42,755 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:42,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-27 23:31:43,089 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2024-11-27 23:31:43,090 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:31:43,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-27 23:31:43,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 1313 proven. 3454 refuted. 0 times theorem prover too weak. 32115 trivial. 0 not checked. [2024-11-27 23:31:43,229 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 36882 backedges. 1321 proven. 3523 refuted. 0 times theorem prover too weak. 32038 trivial. 0 not checked. [2024-11-27 23:31:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325728010] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:47,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:47,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 20 [2024-11-27 23:31:47,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259492818] [2024-11-27 23:31:47,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:47,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-27 23:31:47,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:47,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-27 23:31:47,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-27 23:31:47,579 INFO L87 Difference]: Start difference. First operand 127 states and 211 transitions. Second operand has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 20 states have internal predecessors, (64), 16 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 11 states have call predecessors, (25), 16 states have call successors, (25) [2024-11-27 23:31:47,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:47,796 INFO L93 Difference]: Finished difference Result 144 states and 266 transitions. [2024-11-27 23:31:47,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 23:31:47,797 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 20 states have internal predecessors, (64), 16 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 11 states have call predecessors, (25), 16 states have call successors, (25) Word has length 787 [2024-11-27 23:31:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:47,802 INFO L225 Difference]: With dead ends: 144 [2024-11-27 23:31:47,803 INFO L226 Difference]: Without dead ends: 140 [2024-11-27 23:31:47,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1598 GetRequests, 1564 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=467, Unknown=0, NotChecked=0, Total=702 [2024-11-27 23:31:47,804 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 50 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:47,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 90 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:31:47,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-27 23:31:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2024-11-27 23:31:47,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 86 states have internal predecessors, (94), 24 states have call successors, (24), 18 states have call predecessors, (24), 12 states have return successors, (93), 22 states have call predecessors, (93), 24 states have call successors, (93) [2024-11-27 23:31:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 211 transitions. [2024-11-27 23:31:47,838 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 211 transitions. Word has length 787 [2024-11-27 23:31:47,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:47,840 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 211 transitions. [2024-11-27 23:31:47,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 20 states have internal predecessors, (64), 16 states have call successors, (19), 1 states have call predecessors, (19), 9 states have return successors, (25), 11 states have call predecessors, (25), 16 states have call successors, (25) [2024-11-27 23:31:47,841 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 211 transitions. [2024-11-27 23:31:47,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1278 [2024-11-27 23:31:47,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:47,883 INFO L218 NwaCegarLoop]: trace histogram [187, 187, 151, 93, 93, 93, 93, 93, 93, 93, 58, 36, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:47,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-27 23:31:48,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-27 23:31:48,087 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:48,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:48,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1166117185, now seen corresponding path program 13 times [2024-11-27 23:31:48,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:48,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061775020] [2024-11-27 23:31:48,088 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-27 23:31:48,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 98001 backedges. 1015 proven. 7945 refuted. 0 times theorem prover too weak. 89041 trivial. 0 not checked. [2024-11-27 23:31:51,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:31:51,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061775020] [2024-11-27 23:31:51,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061775020] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:31:51,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188979679] [2024-11-27 23:31:51,385 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-27 23:31:51,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:51,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:31:51,388 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:31:51,389 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-27 23:31:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 23:31:51,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 2855 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-27 23:31:51,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:31:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 98001 backedges. 1015 proven. 7945 refuted. 0 times theorem prover too weak. 89041 trivial. 0 not checked. [2024-11-27 23:31:52,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:31:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 98001 backedges. 1015 proven. 8045 refuted. 0 times theorem prover too weak. 88941 trivial. 0 not checked. [2024-11-27 23:31:58,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188979679] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:31:58,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:31:58,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 22 [2024-11-27 23:31:58,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293616776] [2024-11-27 23:31:58,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:31:58,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-27 23:31:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:31:58,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-27 23:31:58,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-27 23:31:58,801 INFO L87 Difference]: Start difference. First operand 127 states and 211 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 19 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (27), 10 states have call predecessors, (27), 19 states have call successors, (27) [2024-11-27 23:31:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:31:59,022 INFO L93 Difference]: Finished difference Result 149 states and 290 transitions. [2024-11-27 23:31:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 23:31:59,023 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 19 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (27), 10 states have call predecessors, (27), 19 states have call successors, (27) Word has length 1277 [2024-11-27 23:31:59,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:31:59,029 INFO L225 Difference]: With dead ends: 149 [2024-11-27 23:31:59,029 INFO L226 Difference]: Without dead ends: 145 [2024-11-27 23:31:59,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2581 GetRequests, 2543 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=291, Invalid=579, Unknown=0, NotChecked=0, Total=870 [2024-11-27 23:31:59,031 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 23:31:59,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 103 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 23:31:59,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-27 23:31:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2024-11-27 23:31:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.043010752688172) internal successors, (97), 89 states have internal predecessors, (97), 25 states have call successors, (25), 18 states have call predecessors, (25), 13 states have return successors, (108), 24 states have call predecessors, (108), 25 states have call successors, (108) [2024-11-27 23:31:59,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 230 transitions. [2024-11-27 23:31:59,051 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 230 transitions. Word has length 1277 [2024-11-27 23:31:59,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:31:59,053 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 230 transitions. [2024-11-27 23:31:59,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 19 states have call successors, (20), 1 states have call predecessors, (20), 10 states have return successors, (27), 10 states have call predecessors, (27), 19 states have call successors, (27) [2024-11-27 23:31:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 230 transitions. [2024-11-27 23:31:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2024-11-27 23:31:59,072 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:31:59,072 INFO L218 NwaCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 68, 42, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:31:59,087 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-27 23:31:59,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:31:59,273 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:31:59,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:31:59,273 INFO L85 PathProgramCache]: Analyzing trace with hash -392467935, now seen corresponding path program 14 times [2024-11-27 23:31:59,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:31:59,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405361806] [2024-11-27 23:31:59,274 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:31:59,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:31:59,686 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:31:59,686 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:32:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 3825 proven. 5982 refuted. 0 times theorem prover too weak. 124797 trivial. 0 not checked. [2024-11-27 23:32:02,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:32:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405361806] [2024-11-27 23:32:02,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405361806] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:32:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48387519] [2024-11-27 23:32:02,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 23:32:02,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:32:02,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:32:02,860 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:32:02,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-27 23:32:03,644 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 23:32:03,644 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:32:03,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 3339 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-27 23:32:03,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:32:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 4460 proven. 7287 refuted. 0 times theorem prover too weak. 122857 trivial. 0 not checked. [2024-11-27 23:32:03,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:32:13,090 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 4462 proven. 7402 refuted. 0 times theorem prover too weak. 122740 trivial. 0 not checked. [2024-11-27 23:32:13,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48387519] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:32:13,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:32:13,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 23] total 27 [2024-11-27 23:32:13,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613304153] [2024-11-27 23:32:13,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:32:13,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-27 23:32:13,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:32:13,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-27 23:32:13,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2024-11-27 23:32:13,094 INFO L87 Difference]: Start difference. First operand 132 states and 230 transitions. Second operand has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (34), 14 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-27 23:32:13,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:32:13,394 INFO L93 Difference]: Finished difference Result 175 states and 387 transitions. [2024-11-27 23:32:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 23:32:13,395 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (34), 14 states have call predecessors, (34), 21 states have call successors, (34) Word has length 1495 [2024-11-27 23:32:13,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:32:13,400 INFO L225 Difference]: With dead ends: 175 [2024-11-27 23:32:13,400 INFO L226 Difference]: Without dead ends: 144 [2024-11-27 23:32:13,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3018 GetRequests, 2973 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=429, Invalid=831, Unknown=0, NotChecked=0, Total=1260 [2024-11-27 23:32:13,402 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 8 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:32:13,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 209 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:32:13,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-27 23:32:13,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2024-11-27 23:32:13,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 97 states have (on average 1.041237113402062) internal successors, (101), 93 states have internal predecessors, (101), 25 states have call successors, (25), 18 states have call predecessors, (25), 15 states have return successors, (99), 26 states have call predecessors, (99), 25 states have call successors, (99) [2024-11-27 23:32:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 225 transitions. [2024-11-27 23:32:13,422 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 225 transitions. Word has length 1495 [2024-11-27 23:32:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:32:13,423 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 225 transitions. [2024-11-27 23:32:13,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (34), 14 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-27 23:32:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 225 transitions. [2024-11-27 23:32:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1237 [2024-11-27 23:32:13,479 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:32:13,479 INFO L218 NwaCegarLoop]: trace histogram [181, 181, 146, 90, 90, 90, 90, 90, 90, 90, 56, 35, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:32:13,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-11-27 23:32:13,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:32:13,680 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:32:13,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:32:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1087141026, now seen corresponding path program 15 times [2024-11-27 23:32:13,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:32:13,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448759510] [2024-11-27 23:32:13,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:32:13,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:32:13,781 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2024-11-27 23:32:13,781 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:32:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 91765 backedges. 6349 proven. 1125 refuted. 0 times theorem prover too weak. 84291 trivial. 0 not checked. [2024-11-27 23:32:14,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:32:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448759510] [2024-11-27 23:32:14,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448759510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:32:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24574801] [2024-11-27 23:32:14,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-27 23:32:14,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:32:14,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:32:14,205 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:32:14,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-27 23:32:14,759 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2024-11-27 23:32:14,759 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:32:14,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-27 23:32:14,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:32:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 91765 backedges. 27815 proven. 189 refuted. 0 times theorem prover too weak. 63761 trivial. 0 not checked. [2024-11-27 23:32:14,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:32:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 91765 backedges. 6349 proven. 1135 refuted. 0 times theorem prover too weak. 84281 trivial. 0 not checked. [2024-11-27 23:32:19,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24574801] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:32:19,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:32:19,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 15] total 19 [2024-11-27 23:32:19,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504856589] [2024-11-27 23:32:19,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:32:19,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-27 23:32:19,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:32:19,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-27 23:32:19,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-11-27 23:32:19,419 INFO L87 Difference]: Start difference. First operand 138 states and 225 transitions. Second operand has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 11 states have call successors, (19), 2 states have call predecessors, (19), 9 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2024-11-27 23:32:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:32:19,797 INFO L93 Difference]: Finished difference Result 292 states and 494 transitions. [2024-11-27 23:32:19,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-27 23:32:19,797 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 11 states have call successors, (19), 2 states have call predecessors, (19), 9 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) Word has length 1236 [2024-11-27 23:32:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:32:19,801 INFO L225 Difference]: With dead ends: 292 [2024-11-27 23:32:19,802 INFO L226 Difference]: Without dead ends: 150 [2024-11-27 23:32:19,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2502 GetRequests, 2461 SyntacticMatches, 7 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=370, Invalid=890, Unknown=0, NotChecked=0, Total=1260 [2024-11-27 23:32:19,804 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 59 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:32:19,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 114 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:32:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-27 23:32:19,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 133. [2024-11-27 23:32:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 94 states have (on average 1.0425531914893618) internal successors, (98), 90 states have internal predecessors, (98), 24 states have call successors, (24), 18 states have call predecessors, (24), 14 states have return successors, (84), 24 states have call predecessors, (84), 24 states have call successors, (84) [2024-11-27 23:32:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 206 transitions. [2024-11-27 23:32:19,824 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 206 transitions. Word has length 1236 [2024-11-27 23:32:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:32:19,825 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 206 transitions. [2024-11-27 23:32:19,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.5789473684210527) internal successors, (68), 19 states have internal predecessors, (68), 11 states have call successors, (19), 2 states have call predecessors, (19), 9 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2024-11-27 23:32:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 206 transitions. [2024-11-27 23:32:19,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1714 [2024-11-27 23:32:19,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:32:19,847 INFO L218 NwaCegarLoop]: trace histogram [251, 251, 203, 125, 125, 125, 125, 125, 125, 125, 78, 48, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:32:19,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-27 23:32:20,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-27 23:32:20,048 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:32:20,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:32:20,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1220236151, now seen corresponding path program 16 times [2024-11-27 23:32:20,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:32:20,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753352465] [2024-11-27 23:32:20,049 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 23:32:20,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:32:20,394 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 23:32:20,394 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:32:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 177003 backedges. 2842 proven. 8453 refuted. 0 times theorem prover too weak. 165708 trivial. 0 not checked. [2024-11-27 23:32:22,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 23:32:22,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753352465] [2024-11-27 23:32:22,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753352465] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 23:32:22,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3540310] [2024-11-27 23:32:22,739 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-27 23:32:22,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:32:22,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 23:32:22,741 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 23:32:22,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-27 23:32:23,469 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-27 23:32:23,469 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 23:32:23,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 3048 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-27 23:32:23,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 23:32:23,691 INFO L134 CoverageAnalysis]: Checked inductivity of 177003 backedges. 3227 proven. 10316 refuted. 0 times theorem prover too weak. 163460 trivial. 0 not checked. [2024-11-27 23:32:23,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 23:32:33,247 INFO L134 CoverageAnalysis]: Checked inductivity of 177003 backedges. 3231 proven. 10429 refuted. 0 times theorem prover too weak. 163343 trivial. 0 not checked. [2024-11-27 23:32:33,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3540310] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 23:32:33,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 23:32:33,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 23] total 27 [2024-11-27 23:32:33,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836407916] [2024-11-27 23:32:33,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 23:32:33,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-27 23:32:33,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 23:32:33,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-27 23:32:33,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2024-11-27 23:32:33,250 INFO L87 Difference]: Start difference. First operand 133 states and 206 transitions. Second operand has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (34), 14 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-27 23:32:33,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 23:32:33,591 INFO L93 Difference]: Finished difference Result 180 states and 308 transitions. [2024-11-27 23:32:33,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 23:32:33,592 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (34), 14 states have call predecessors, (34), 21 states have call successors, (34) Word has length 1713 [2024-11-27 23:32:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 23:32:33,597 INFO L225 Difference]: With dead ends: 180 [2024-11-27 23:32:33,598 INFO L226 Difference]: Without dead ends: 139 [2024-11-27 23:32:33,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3454 GetRequests, 3409 SyntacticMatches, 11 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=429, Invalid=831, Unknown=0, NotChecked=0, Total=1260 [2024-11-27 23:32:33,601 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 23:32:33,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 203 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 23:32:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-27 23:32:33,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2024-11-27 23:32:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 88 states have internal predecessors, (96), 24 states have call successors, (24), 18 states have call predecessors, (24), 13 states have return successors, (68), 23 states have call predecessors, (68), 24 states have call successors, (68) [2024-11-27 23:32:33,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 188 transitions. [2024-11-27 23:32:33,622 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 188 transitions. Word has length 1713 [2024-11-27 23:32:33,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 23:32:33,623 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 188 transitions. [2024-11-27 23:32:33,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.076923076923077) internal successors, (80), 27 states have internal predecessors, (80), 21 states have call successors, (25), 1 states have call predecessors, (25), 11 states have return successors, (34), 14 states have call predecessors, (34), 21 states have call successors, (34) [2024-11-27 23:32:33,624 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 188 transitions. [2024-11-27 23:32:33,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2024-11-27 23:32:33,637 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 23:32:33,638 INFO L218 NwaCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 23:32:33,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-27 23:32:33,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 23:32:33,839 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 23:32:33,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 23:32:33,839 INFO L85 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 17 times [2024-11-27 23:32:33,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 23:32:33,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945379161] [2024-11-27 23:32:33,840 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-27 23:32:33,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 23:32:34,350 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 144 check-sat command(s) [2024-11-27 23:32:34,350 INFO L230 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-27 23:32:34,350 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 23:32:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 23:32:34,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 23:32:34,802 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 23:32:34,803 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 23:32:34,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 23:32:34,808 INFO L422 BasicCegarLoop]: Path program histogram: [17, 1, 1, 1] [2024-11-27 23:32:35,028 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 23:32:35,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:32:35 BoogieIcfgContainer [2024-11-27 23:32:35,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 23:32:35,036 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 23:32:35,036 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 23:32:35,037 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 23:32:35,041 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:31:03" (3/4) ... [2024-11-27 23:32:35,042 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-27 23:32:35,240 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 676. [2024-11-27 23:32:35,560 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 23:32:35,561 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 23:32:35,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 23:32:35,562 INFO L158 Benchmark]: Toolchain (without parser) took 92698.77ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 106.7MB in the beginning and 764.5MB in the end (delta: -657.8MB). Peak memory consumption was 199.7MB. Max. memory is 16.1GB. [2024-11-27 23:32:35,563 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:32:35,563 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.38ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 96.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:32:35,563 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.64ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 94.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:32:35,564 INFO L158 Benchmark]: Boogie Preprocessor took 50.08ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 23:32:35,566 INFO L158 Benchmark]: RCFGBuilder took 340.56ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 83.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 23:32:35,566 INFO L158 Benchmark]: TraceAbstraction took 91415.65ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 83.4MB in the beginning and 802.3MB in the end (delta: -718.8MB). Peak memory consumption was 149.3MB. Max. memory is 16.1GB. [2024-11-27 23:32:35,566 INFO L158 Benchmark]: Witness Printer took 525.09ms. Allocated memory is still 1.0GB. Free memory was 802.3MB in the beginning and 764.5MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-27 23:32:35,570 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.54ms. Allocated memory is still 167.8MB. Free memory is still 104.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.38ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 96.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.64ms. Allocated memory is still 142.6MB. Free memory was 96.0MB in the beginning and 94.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.08ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 93.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 340.56ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 83.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 91415.65ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 83.4MB in the beginning and 802.3MB in the end (delta: -718.8MB). Peak memory consumption was 149.3MB. Max. memory is 16.1GB. * Witness Printer took 525.09ms. Allocated memory is still 1.0GB. Free memory was 802.3MB in the beginning and 764.5MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. 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 - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; VAL [x=10] [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [x=10] [L27] int result = fibo(x); [L28] COND TRUE result == 55 VAL [x=10] [L29] reach_error() VAL [x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 91.1s, OverallIterations: 20, TraceHistogramMax: 251, PathProgramHistogramMax: 17, EmptinessCheckTime: 0.2s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 798 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 694 mSDsluCounter, 1879 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1511 mSDsCounter, 898 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2440 IncrementalHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 898 mSolverCounterUnsat, 368 mSDtfsCounter, 2440 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20163 GetRequests, 19640 SyntacticMatches, 110 SemanticMatches, 413 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2987 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=17, InterpolantAutomatonStates: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 114 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.9s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 73.9s InterpolantComputationTime, 21028 NumberOfCodeBlocks, 15362 NumberOfCodeBlocksAsserted, 514 NumberOfCheckSat, 29665 ConstructedInterpolants, 0 QuantifiedInterpolants, 35454 SizeOfPredicates, 85 NumberOfNonLiveVariables, 15658 ConjunctsInSsa, 239 ConjunctsInUnsatCore, 53 InterpolantComputations, 2 PerfectInterpolantSequences, 1877504/1996131 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-27 23:32:35,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6464c1b-d38c-4d76-bf1d-a106ccbb8b6d/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE