./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ --witnessprinter.witness.filename witness.graphml --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 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-dbf71c6-m [2022-10-17 10:53:35,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:53:35,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:53:35,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:53:35,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:53:35,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:53:35,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:53:35,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:53:35,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:53:35,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:53:35,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:53:35,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:53:35,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:53:35,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:53:35,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:53:35,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:53:35,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:53:35,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:53:35,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:53:35,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:53:35,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:53:35,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:53:35,185 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:53:35,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:53:35,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:53:35,192 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:53:35,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:53:35,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:53:35,194 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:53:35,195 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:53:35,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:53:35,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:53:35,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:53:35,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:53:35,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:53:35,200 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:53:35,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:53:35,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:53:35,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:53:35,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:53:35,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:53:35,205 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:53:35,231 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:53:35,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:53:35,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:53:35,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:53:35,232 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:53:35,232 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:53:35,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:53:35,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:53:35,233 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:53:35,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:53:35,234 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:53:35,234 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:53:35,234 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:53:35,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:53:35,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:53:35,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:53:35,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:53:35,240 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:53:35,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:53:35,241 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:53:35,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:53:35,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:53:35,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:53:35,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:53:35,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:53:35,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:53:35,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:53:35,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:53:35,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:53:35,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:53:35,243 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:53:35,243 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:53:35,243 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:53:35,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2022-10-17 10:53:35,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:53:35,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:53:35,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:53:35,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:53:35,519 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:53:35,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/recursive/Fibonacci05.c [2022-10-17 10:53:35,591 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/data/c204628c4/4aa6498ce7ee4a689faed0417bfaf176/FLAG4d34fc314 [2022-10-17 10:53:36,011 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:53:36,011 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/sv-benchmarks/c/recursive/Fibonacci05.c [2022-10-17 10:53:36,017 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/data/c204628c4/4aa6498ce7ee4a689faed0417bfaf176/FLAG4d34fc314 [2022-10-17 10:53:36,436 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/data/c204628c4/4aa6498ce7ee4a689faed0417bfaf176 [2022-10-17 10:53:36,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:53:36,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:53:36,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:53:36,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:53:36,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:53:36,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42397d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36, skipping insertion in model container [2022-10-17 10:53:36,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:53:36,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:53:36,658 WARN L230 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_29a8c397-0aba-41c8-be18-99372b9cf309/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-10-17 10:53:36,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:53:36,670 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:53:36,685 WARN L230 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_29a8c397-0aba-41c8-be18-99372b9cf309/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-10-17 10:53:36,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:53:36,698 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:53:36,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36 WrapperNode [2022-10-17 10:53:36,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:53:36,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:53:36,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:53:36,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:53:36,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,713 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,730 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-10-17 10:53:36,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:53:36,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:53:36,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:53:36,731 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:53:36,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,746 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,747 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:53:36,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:53:36,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:53:36,754 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:53:36,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36" (1/1) ... [2022-10-17 10:53:36,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:53:36,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:53:36,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:53:36,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:53:36,846 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-10-17 10:53:36,847 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-10-17 10:53:36,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:53:36,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:53:36,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:53:36,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:53:36,906 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:53:36,908 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:53:37,007 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:53:37,014 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:53:37,014 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 10:53:37,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:53:37 BoogieIcfgContainer [2022-10-17 10:53:37,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:53:37,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:53:37,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:53:37,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:53:37,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:53:36" (1/3) ... [2022-10-17 10:53:37,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e955a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:53:37, skipping insertion in model container [2022-10-17 10:53:37,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:53:36" (2/3) ... [2022-10-17 10:53:37,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e955a44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:53:37, skipping insertion in model container [2022-10-17 10:53:37,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:53:37" (3/3) ... [2022-10-17 10:53:37,027 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2022-10-17 10:53:37,045 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:53:37,046 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-10-17 10:53:37,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:53:37,108 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@527305fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:53:37,109 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-10-17 10:53:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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) [2022-10-17 10:53:37,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-17 10:53:37,122 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:53:37,123 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:53:37,123 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:53:37,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:53:37,129 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2022-10-17 10:53:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:53:37,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900524448] [2022-10-17 10:53:37,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:53:37,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:53:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:37,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:53:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:37,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:53:37,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:53:37,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900524448] [2022-10-17 10:53:37,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900524448] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:53:37,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:53:37,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:53:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601261343] [2022-10-17 10:53:37,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:53:37,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:53:37,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:53:37,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:53:37,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:53:37,418 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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), 5 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) [2022-10-17 10:53:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:53:37,574 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-10-17 10:53:37,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:53:37,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-17 10:53:37,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:53:37,585 INFO L225 Difference]: With dead ends: 31 [2022-10-17 10:53:37,585 INFO L226 Difference]: Without dead ends: 18 [2022-10-17 10:53:37,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:53:37,601 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:53:37,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 40 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:53:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-10-17 10:53:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-10-17 10:53:37,663 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) [2022-10-17 10:53:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-10-17 10:53:37,667 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-10-17 10:53:37,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:53:37,668 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-10-17 10:53:37,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-17 10:53:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-10-17 10:53:37,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-17 10:53:37,672 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:53:37,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:53:37,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:53:37,673 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:53:37,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:53:37,675 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2022-10-17 10:53:37,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:53:37,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311562547] [2022-10-17 10:53:37,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:53:37,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:53:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:37,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:53:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:53:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:53:37,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311562547] [2022-10-17 10:53:37,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311562547] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:53:37,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:53:37,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-17 10:53:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687786308] [2022-10-17 10:53:37,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:53:37,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-17 10:53:37,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:53:37,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-17 10:53:37,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-17 10:53:37,902 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), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-17 10:53:37,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:53:37,964 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-10-17 10:53:37,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-17 10:53:37,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-10-17 10:53:37,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:53:37,966 INFO L225 Difference]: With dead ends: 24 [2022-10-17 10:53:37,966 INFO L226 Difference]: Without dead ends: 20 [2022-10-17 10:53:37,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:53:37,969 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-17 10:53:37,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-17 10:53:37,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-10-17 10:53:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-10-17 10:53:37,976 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) [2022-10-17 10:53:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-10-17 10:53:37,977 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-10-17 10:53:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:53:37,978 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-10-17 10:53:37,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-17 10:53:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-10-17 10:53:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-17 10:53:37,979 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:53:37,980 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:53:37,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:53:37,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:53:37,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:53:37,981 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2022-10-17 10:53:37,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:53:37,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548692857] [2022-10-17 10:53:37,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:53:37,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:53:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:53:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:38,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:38,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-17 10:53:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:38,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-17 10:53:38,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:53:38,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548692857] [2022-10-17 10:53:38,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548692857] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:53:38,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811840605] [2022-10-17 10:53:38,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:53:38,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:53:38,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:53:38,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:53:38,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-17 10:53:38,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:38,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-17 10:53:38,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:53:38,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-17 10:53:38,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:53:38,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-17 10:53:38,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811840605] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:53:38,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:53:38,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2022-10-17 10:53:38,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980539427] [2022-10-17 10:53:38,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:53:38,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-17 10:53:38,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:53:38,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-17 10:53:38,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-10-17 10:53:38,764 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-10-17 10:53:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:53:39,034 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2022-10-17 10:53:39,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-17 10:53:39,035 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2022-10-17 10:53:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:53:39,037 INFO L225 Difference]: With dead ends: 46 [2022-10-17 10:53:39,037 INFO L226 Difference]: Without dead ends: 29 [2022-10-17 10:53:39,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-10-17 10:53:39,040 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-17 10:53:39,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 63 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-17 10:53:39,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-10-17 10:53:39,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-10-17 10:53:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-10-17 10:53:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-10-17 10:53:39,065 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2022-10-17 10:53:39,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:53:39,065 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2022-10-17 10:53:39,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-10-17 10:53:39,066 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2022-10-17 10:53:39,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-17 10:53:39,070 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:53:39,070 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:53:39,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-17 10:53:39,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:53:39,288 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:53:39,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:53:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2022-10-17 10:53:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:53:39,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362820283] [2022-10-17 10:53:39,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:53:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:53:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:39,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:53:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:39,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:39,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:39,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:39,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:39,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:39,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:39,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:39,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:39,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:39,851 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-10-17 10:53:39,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:53:39,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362820283] [2022-10-17 10:53:39,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362820283] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:53:39,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600484774] [2022-10-17 10:53:39,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:53:39,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:53:39,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:53:39,854 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:53:39,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-17 10:53:39,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:39,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-17 10:53:39,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:53:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-10-17 10:53:40,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:53:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-17 10:53:40,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600484774] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:53:40,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:53:40,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2022-10-17 10:53:40,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849671371] [2022-10-17 10:53:40,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:53:40,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-17 10:53:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:53:40,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-17 10:53:40,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-10-17 10:53:40,575 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-10-17 10:53:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:53:40,842 INFO L93 Difference]: Finished difference Result 73 states and 123 transitions. [2022-10-17 10:53:40,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-17 10:53:40,844 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 65 [2022-10-17 10:53:40,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:53:40,858 INFO L225 Difference]: With dead ends: 73 [2022-10-17 10:53:40,858 INFO L226 Difference]: Without dead ends: 44 [2022-10-17 10:53:40,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2022-10-17 10:53:40,865 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-17 10:53:40,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 93 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-17 10:53:40,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-17 10:53:40,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-10-17 10:53:40,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2022-10-17 10:53:40,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2022-10-17 10:53:40,896 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2022-10-17 10:53:40,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:53:40,897 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2022-10-17 10:53:40,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-10-17 10:53:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2022-10-17 10:53:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-10-17 10:53:40,907 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:53:40,907 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:53:40,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-17 10:53:41,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:53:41,133 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:53:41,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:53:41,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1389805118, now seen corresponding path program 2 times [2022-10-17 10:53:41,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:53:41,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006628854] [2022-10-17 10:53:41,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:53:41,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:53:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:41,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:53:41,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:41,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:41,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:41,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:41,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:42,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-17 10:53:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-17 10:53:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:42,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:42,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-17 10:53:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-17 10:53:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-10-17 10:53:42,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:53:42,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006628854] [2022-10-17 10:53:42,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006628854] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:53:42,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331989966] [2022-10-17 10:53:42,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-17 10:53:42,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:53:42,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:53:42,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:53:42,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-17 10:53:42,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-17 10:53:42,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 10:53:42,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-17 10:53:42,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:53:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2022-10-17 10:53:42,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:53:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2022-10-17 10:53:43,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331989966] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:53:43,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:53:43,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2022-10-17 10:53:43,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960227984] [2022-10-17 10:53:43,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:53:43,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-17 10:53:43,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:53:43,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-17 10:53:43,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-10-17 10:53:43,796 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2022-10-17 10:53:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:53:44,428 INFO L93 Difference]: Finished difference Result 119 states and 223 transitions. [2022-10-17 10:53:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-17 10:53:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 171 [2022-10-17 10:53:44,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:53:44,431 INFO L225 Difference]: With dead ends: 119 [2022-10-17 10:53:44,431 INFO L226 Difference]: Without dead ends: 76 [2022-10-17 10:53:44,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 384 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2022-10-17 10:53:44,435 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 148 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-17 10:53:44,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 108 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-17 10:53:44,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-17 10:53:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-10-17 10:53:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (37), 13 states have call predecessors, (37), 12 states have call successors, (37) [2022-10-17 10:53:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2022-10-17 10:53:44,452 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2022-10-17 10:53:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:53:44,453 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2022-10-17 10:53:44,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2022-10-17 10:53:44,453 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2022-10-17 10:53:44,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2022-10-17 10:53:44,467 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:53:44,467 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:53:44,500 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-17 10:53:44,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:53:44,683 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:53:44,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:53:44,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1020156483, now seen corresponding path program 3 times [2022-10-17 10:53:44,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:53:44,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288902971] [2022-10-17 10:53:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:53:44,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:53:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:45,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:53:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:45,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-17 10:53:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-17 10:53:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-17 10:53:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-17 10:53:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-10-17 10:53:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-17 10:53:46,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-17 10:53:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:46,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-17 10:53:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:47,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-17 10:53:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:47,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2022-10-17 10:53:47,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:53:47,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288902971] [2022-10-17 10:53:47,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288902971] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:53:47,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775452187] [2022-10-17 10:53:47,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-17 10:53:47,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:53:47,083 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:53:47,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:53:47,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-17 10:53:47,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2022-10-17 10:53:47,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 10:53:47,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-17 10:53:47,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:53:47,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2022-10-17 10:53:47,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:53:49,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2022-10-17 10:53:49,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775452187] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:53:49,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:53:49,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2022-10-17 10:53:49,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024328268] [2022-10-17 10:53:49,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:53:49,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-10-17 10:53:49,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:53:49,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-10-17 10:53:49,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2022-10-17 10:53:49,665 INFO L87 Difference]: Start difference. First operand 66 states and 105 transitions. Second operand has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2022-10-17 10:53:50,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:53:50,278 INFO L93 Difference]: Finished difference Result 172 states and 339 transitions. [2022-10-17 10:53:50,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-10-17 10:53:50,279 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) Word has length 351 [2022-10-17 10:53:50,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:53:50,284 INFO L225 Difference]: With dead ends: 172 [2022-10-17 10:53:50,284 INFO L226 Difference]: Without dead ends: 109 [2022-10-17 10:53:50,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 787 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2022-10-17 10:53:50,289 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 187 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-17 10:53:50,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 171 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-17 10:53:50,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-10-17 10:53:50,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2022-10-17 10:53:50,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.109375) internal successors, (71), 62 states have internal predecessors, (71), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) [2022-10-17 10:53:50,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2022-10-17 10:53:50,308 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 351 [2022-10-17 10:53:50,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:53:50,309 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2022-10-17 10:53:50,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2022-10-17 10:53:50,310 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2022-10-17 10:53:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2022-10-17 10:53:50,322 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:53:50,323 INFO L195 NwaCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:53:50,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-17 10:53:50,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-10-17 10:53:50,538 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:53:50,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:53:50,539 INFO L85 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 4 times [2022-10-17 10:53:50,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:53:50,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331367619] [2022-10-17 10:53:50,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:53:50,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:53:50,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:51,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-17 10:53:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:52,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:52,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-17 10:53:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-17 10:53:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:53,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-17 10:53:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-17 10:53:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-10-17 10:53:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-17 10:53:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-17 10:53:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-10-17 10:53:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:53,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:54,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-17 10:53:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-17 10:53:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-17 10:53:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:54,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-17 10:53:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-10-17 10:53:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-17 10:53:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-17 10:53:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-17 10:53:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-17 10:53:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:53:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2022-10-17 10:53:54,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:53:54,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331367619] [2022-10-17 10:53:54,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331367619] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-17 10:53:54,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298266456] [2022-10-17 10:53:54,367 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-17 10:53:54,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-17 10:53:54,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:53:54,371 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-17 10:53:54,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-17 10:53:54,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-17 10:53:54,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-17 10:53:54,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-17 10:53:54,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-17 10:53:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3346 refuted. 0 times theorem prover too weak. 11122 trivial. 0 not checked. [2022-10-17 10:53:54,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-17 10:53:59,726 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3454 refuted. 0 times theorem prover too weak. 11014 trivial. 0 not checked. [2022-10-17 10:53:59,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298266456] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-17 10:53:59,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-17 10:53:59,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 31] total 45 [2022-10-17 10:53:59,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120537279] [2022-10-17 10:53:59,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-17 10:53:59,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-10-17 10:53:59,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:53:59,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-10-17 10:53:59,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2022-10-17 10:53:59,736 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2022-10-17 10:54:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-17 10:54:00,696 INFO L93 Difference]: Finished difference Result 217 states and 398 transitions. [2022-10-17 10:54:00,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-10-17 10:54:00,697 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) Word has length 528 [2022-10-17 10:54:00,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-17 10:54:00,701 INFO L225 Difference]: With dead ends: 217 [2022-10-17 10:54:00,701 INFO L226 Difference]: Without dead ends: 129 [2022-10-17 10:54:00,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1184 SyntacticMatches, 15 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2004 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2022-10-17 10:54:00,707 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 244 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-17 10:54:00,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 268 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-17 10:54:00,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-10-17 10:54:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2022-10-17 10:54:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 17 states have call predecessors, (21), 9 states have return successors, (51), 16 states have call predecessors, (51), 21 states have call successors, (51) [2022-10-17 10:54:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2022-10-17 10:54:00,734 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 528 [2022-10-17 10:54:00,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-17 10:54:00,739 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2022-10-17 10:54:00,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2022-10-17 10:54:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2022-10-17 10:54:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2022-10-17 10:54:00,756 INFO L187 NwaCegarLoop]: Found error trace [2022-10-17 10:54:00,756 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:54:00,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-17 10:54:00,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-10-17 10:54:00,983 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-10-17 10:54:00,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:54:00,983 INFO L85 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 5 times [2022-10-17 10:54:00,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:54:00,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804137711] [2022-10-17 10:54:00,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:54:00,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:54:01,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:54:01,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:54:01,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:54:01,222 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:54:01,223 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 10:54:01,224 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-10-17 10:54:01,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:54:01,228 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2022-10-17 10:54:01,235 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 10:54:01,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 10:54:01 BoogieIcfgContainer [2022-10-17 10:54:01,393 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 10:54:01,393 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:54:01,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:54:01,394 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:54:01,394 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:53:37" (3/4) ... [2022-10-17 10:54:01,396 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 10:54:01,510 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:54:01,510 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:54:01,511 INFO L158 Benchmark]: Toolchain (without parser) took 25070.63ms. Allocated memory was 75.5MB in the beginning and 339.7MB in the end (delta: 264.2MB). Free memory was 33.6MB in the beginning and 196.5MB in the end (delta: -162.9MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. [2022-10-17 10:54:01,512 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 75.5MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:54:01,512 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.97ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 33.4MB in the beginning and 68.1MB in the end (delta: -34.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-10-17 10:54:01,512 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.05ms. Allocated memory is still 92.3MB. Free memory was 67.9MB in the beginning and 66.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:54:01,513 INFO L158 Benchmark]: Boogie Preprocessor took 20.25ms. Allocated memory is still 92.3MB. Free memory was 66.5MB in the beginning and 65.5MB in the end (delta: 986.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:54:01,513 INFO L158 Benchmark]: RCFGBuilder took 264.48ms. Allocated memory is still 92.3MB. Free memory was 65.5MB in the beginning and 56.2MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-10-17 10:54:01,513 INFO L158 Benchmark]: TraceAbstraction took 24373.60ms. Allocated memory was 92.3MB in the beginning and 339.7MB in the end (delta: 247.5MB). Free memory was 55.5MB in the beginning and 207.0MB in the end (delta: -151.5MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. [2022-10-17 10:54:01,514 INFO L158 Benchmark]: Witness Printer took 117.28ms. Allocated memory is still 339.7MB. Free memory was 207.0MB in the beginning and 196.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-10-17 10:54:01,516 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 75.5MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.97ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 33.4MB in the beginning and 68.1MB in the end (delta: -34.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.05ms. Allocated memory is still 92.3MB. Free memory was 67.9MB in the beginning and 66.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.25ms. Allocated memory is still 92.3MB. Free memory was 66.5MB in the beginning and 65.5MB in the end (delta: 986.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 264.48ms. Allocated memory is still 92.3MB. Free memory was 65.5MB in the beginning and 56.2MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 24373.60ms. Allocated memory was 92.3MB in the beginning and 339.7MB in the end (delta: 247.5MB). Free memory was 55.5MB in the beginning and 207.0MB in the end (delta: -151.5MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. * Witness Printer took 117.28ms. Allocated memory is still 339.7MB. Free memory was 207.0MB in the beginning and 196.5MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.1s, OverallIterations: 8, TraceHistogramMax: 77, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 775 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 634 mSDsCounter, 1163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1799 IncrementalHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1163 mSolverCounterUnsat, 141 mSDtfsCounter, 1799 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2787 GetRequests, 2548 SyntacticMatches, 30 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3419 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 2757 NumberOfCodeBlocks, 2580 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3418 ConstructedInterpolants, 0 QuantifiedInterpolants, 5479 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2170 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 60175/75984 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 RESULT: Ultimate proved your program to be incorrect! [2022-10-17 10:54:01,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_29a8c397-0aba-41c8-be18-99372b9cf309/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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