./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 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa --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 --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 22:49:36,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:49:36,430 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:49:36,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:49:36,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:49:36,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:49:36,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:49:36,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:49:36,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:49:36,466 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:49:36,467 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:49:36,468 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:49:36,468 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:49:36,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:49:36,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:49:36,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:49:36,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:49:36,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:49:36,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:49:36,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:49:36,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:49:36,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:49:36,480 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:49:36,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:49:36,484 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:49:36,484 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:49:36,484 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:49:36,485 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:49:36,485 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:49:36,486 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:49:36,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:49:36,487 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:49:36,488 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:49:36,488 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:49:36,489 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:49:36,489 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:49:36,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:49:36,490 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:49:36,490 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:49:36,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:49:36,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:49:36,492 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 22:49:36,510 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:49:36,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:49:36,510 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:49:36,510 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:49:36,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 22:49:36,511 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 22:49:36,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:49:36,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:49:36,512 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:49:36,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:49:36,512 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 22:49:36,512 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:49:36,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 22:49:36,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:49:36,513 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 22:49:36,513 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 22:49:36,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 22:49:36,513 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 22:49:36,513 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 22:49:36,513 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:49:36,513 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 22:49:36,513 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:49:36,514 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:49:36,514 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 22:49:36,514 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:49:36,514 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:49:36,514 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 22:49:36,514 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 22:49:36,514 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 22:49:36,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 22:49:36,515 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 22:49:36,515 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 22:49:36,515 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 22:49:36,515 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:49:36,515 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_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/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_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa 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 [2021-12-06 22:49:36,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:49:36,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:49:36,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:49:36,725 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:49:36,726 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:49:36,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/recursive/Fibonacci05.c [2021-12-06 22:49:36,771 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/data/9017e976f/e130ed8b49be427a9b6eb3586c29d100/FLAGc3748562b [2021-12-06 22:49:37,133 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:49:37,134 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/sv-benchmarks/c/recursive/Fibonacci05.c [2021-12-06 22:49:37,138 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/data/9017e976f/e130ed8b49be427a9b6eb3586c29d100/FLAGc3748562b [2021-12-06 22:49:37,148 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/data/9017e976f/e130ed8b49be427a9b6eb3586c29d100 [2021-12-06 22:49:37,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:49:37,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:49:37,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:49:37,152 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:49:37,154 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:49:37,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:49:37" (1/1) ... [2021-12-06 22:49:37,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d242a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37, skipping insertion in model container [2021-12-06 22:49:37,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:49:37" (1/1) ... [2021-12-06 22:49:37,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:49:37,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:49:37,291 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_e51638e1-8b5e-4156-aa77-cb49243501b1/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-12-06 22:49:37,294 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:49:37,302 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 22:49:37,315 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_e51638e1-8b5e-4156-aa77-cb49243501b1/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-12-06 22:49:37,316 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:49:37,328 INFO L208 MainTranslator]: Completed translation [2021-12-06 22:49:37,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37 WrapperNode [2021-12-06 22:49:37,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:49:37,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 22:49:37,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 22:49:37,330 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 22:49:37,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37" (1/1) ... [2021-12-06 22:49:37,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37" (1/1) ... [2021-12-06 22:49:37,357 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2021-12-06 22:49:37,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 22:49:37,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 22:49:37,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 22:49:37,358 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 22:49:37,366 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37" (1/1) ... [2021-12-06 22:49:37,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37" (1/1) ... [2021-12-06 22:49:37,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37" (1/1) ... [2021-12-06 22:49:37,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37" (1/1) ... [2021-12-06 22:49:37,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37" (1/1) ... [2021-12-06 22:49:37,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37" (1/1) ... [2021-12-06 22:49:37,372 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37" (1/1) ... [2021-12-06 22:49:37,373 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 22:49:37,374 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 22:49:37,374 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 22:49:37,374 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 22:49:37,375 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37" (1/1) ... [2021-12-06 22:49:37,383 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:49:37,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:49:37,403 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 22:49:37,405 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 22:49:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-12-06 22:49:37,433 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-12-06 22:49:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 22:49:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 22:49:37,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 22:49:37,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 22:49:37,482 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 22:49:37,483 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 22:49:37,547 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 22:49:37,551 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 22:49:37,551 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-06 22:49:37,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:49:37 BoogieIcfgContainer [2021-12-06 22:49:37,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 22:49:37,554 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 22:49:37,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 22:49:37,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 22:49:37,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 10:49:37" (1/3) ... [2021-12-06 22:49:37,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547f6804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:49:37, skipping insertion in model container [2021-12-06 22:49:37,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:49:37" (2/3) ... [2021-12-06 22:49:37,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547f6804 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:49:37, skipping insertion in model container [2021-12-06 22:49:37,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:49:37" (3/3) ... [2021-12-06 22:49:37,559 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2021-12-06 22:49:37,563 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 22:49:37,563 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 22:49:37,599 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 22:49:37,604 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-06 22:49:37,604 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 22:49:37,616 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) [2021-12-06 22:49:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-06 22:49:37,620 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:49:37,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:49:37,620 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:49:37,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:49:37,625 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-12-06 22:49:37,632 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:49:37,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247421280] [2021-12-06 22:49:37,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:49:37,633 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:49:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:37,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 22:49:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:37,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:49:37,774 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:49:37,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247421280] [2021-12-06 22:49:37,775 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247421280] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:49:37,775 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:49:37,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:49:37,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240942380] [2021-12-06 22:49:37,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:49:37,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:49:37,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:49:37,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:49:37,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:49:37,803 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) [2021-12-06 22:49:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:49:37,860 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-12-06 22:49:37,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:49:37,862 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 [2021-12-06 22:49:37,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:49:37,868 INFO L225 Difference]: With dead ends: 31 [2021-12-06 22:49:37,869 INFO L226 Difference]: Without dead ends: 18 [2021-12-06 22:49:37,871 INFO L932 BasicCegarLoop]: 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 [2021-12-06 22:49:37,874 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:49:37,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:49:37,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-06 22:49:37,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-06 22:49:37,903 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) [2021-12-06 22:49:37,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-06 22:49:37,905 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-12-06 22:49:37,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:49:37,906 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-06 22:49:37,906 INFO L471 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) [2021-12-06 22:49:37,906 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-06 22:49:37,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-06 22:49:37,907 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:49:37,907 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:49:37,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 22:49:37,908 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:49:37,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:49:37,908 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-12-06 22:49:37,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:49:37,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040602275] [2021-12-06 22:49:37,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:49:37,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:49:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:37,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 22:49:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:37,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:49:37,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:49:37,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040602275] [2021-12-06 22:49:37,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040602275] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:49:37,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:49:37,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-06 22:49:37,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483926777] [2021-12-06 22:49:37,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:49:37,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-06 22:49:37,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:49:37,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-06 22:49:37,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-06 22:49:37,958 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) [2021-12-06 22:49:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:49:37,992 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-12-06 22:49:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-06 22:49:37,993 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 [2021-12-06 22:49:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:49:37,994 INFO L225 Difference]: With dead ends: 24 [2021-12-06 22:49:37,994 INFO L226 Difference]: Without dead ends: 20 [2021-12-06 22:49:37,994 INFO L932 BasicCegarLoop]: 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 [2021-12-06 22:49:37,995 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 22:49:37,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 33 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 22:49:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-06 22:49:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-12-06 22:49:38,000 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) [2021-12-06 22:49:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-06 22:49:38,001 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-12-06 22:49:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:49:38,001 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-06 22:49:38,002 INFO L471 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) [2021-12-06 22:49:38,002 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-06 22:49:38,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-06 22:49:38,003 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:49:38,003 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:49:38,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 22:49:38,003 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:49:38,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:49:38,004 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-12-06 22:49:38,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:49:38,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272948036] [2021-12-06 22:49:38,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:49:38,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:49:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:38,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 22:49:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:38,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:38,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-06 22:49:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:38,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:49:38,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:49:38,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272948036] [2021-12-06 22:49:38,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272948036] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:49:38,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260903744] [2021-12-06 22:49:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:49:38,102 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:49:38,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:49:38,103 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:49:38,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-06 22:49:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:38,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 22:49:38,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:49:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-06 22:49:38,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:49:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-06 22:49:38,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260903744] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:49:38,376 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:49:38,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2021-12-06 22:49:38,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843872659] [2021-12-06 22:49:38,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:49:38,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-06 22:49:38,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:49:38,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-06 22:49:38,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-06 22:49:38,379 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) [2021-12-06 22:49:38,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:49:38,490 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2021-12-06 22:49:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 22:49:38,491 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 [2021-12-06 22:49:38,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:49:38,493 INFO L225 Difference]: With dead ends: 46 [2021-12-06 22:49:38,493 INFO L226 Difference]: Without dead ends: 29 [2021-12-06 22:49:38,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-12-06 22:49:38,496 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:49:38,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 65 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:49:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-06 22:49:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-06 22:49:38,504 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) [2021-12-06 22:49:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2021-12-06 22:49:38,506 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2021-12-06 22:49:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:49:38,506 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2021-12-06 22:49:38,507 INFO L471 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) [2021-12-06 22:49:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2021-12-06 22:49:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-06 22:49:38,510 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:49:38,510 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:49:38,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-06 22:49:38,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:49:38,712 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:49:38,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:49:38,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2021-12-06 22:49:38,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:49:38,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611448760] [2021-12-06 22:49:38,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:49:38,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:49:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:38,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 22:49:38,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:38,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:38,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:38,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:38,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:38,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:38,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-06 22:49:39,009 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:49:39,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611448760] [2021-12-06 22:49:39,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611448760] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:49:39,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719322519] [2021-12-06 22:49:39,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:49:39,010 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:49:39,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:49:39,011 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:49:39,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-06 22:49:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-06 22:49:39,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:49:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-12-06 22:49:39,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:49:39,326 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-06 22:49:39,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719322519] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:49:39,327 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:49:39,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2021-12-06 22:49:39,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791535024] [2021-12-06 22:49:39,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:49:39,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-06 22:49:39,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:49:39,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-06 22:49:39,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-12-06 22:49:39,333 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) [2021-12-06 22:49:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:49:39,463 INFO L93 Difference]: Finished difference Result 73 states and 123 transitions. [2021-12-06 22:49:39,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-06 22:49:39,463 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 [2021-12-06 22:49:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:49:39,466 INFO L225 Difference]: With dead ends: 73 [2021-12-06 22:49:39,466 INFO L226 Difference]: Without dead ends: 44 [2021-12-06 22:49:39,467 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2021-12-06 22:49:39,468 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:49:39,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 94 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:49:39,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-06 22:49:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-06 22:49:39,476 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) [2021-12-06 22:49:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2021-12-06 22:49:39,477 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2021-12-06 22:49:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:49:39,478 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2021-12-06 22:49:39,478 INFO L471 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) [2021-12-06 22:49:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2021-12-06 22:49:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-12-06 22:49:39,482 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:49:39,482 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:49:39,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-06 22:49:39,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:49:39,684 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:49:39,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:49:39,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1389805118, now seen corresponding path program 2 times [2021-12-06 22:49:39,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:49:39,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901038082] [2021-12-06 22:49:39,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:49:39,688 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:49:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 22:49:39,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 22:49:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-06 22:49:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:39,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:39,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 22:49:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:40,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:40,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:40,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:40,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-06 22:49:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:40,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2021-12-06 22:49:40,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:49:40,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901038082] [2021-12-06 22:49:40,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901038082] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:49:40,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981129142] [2021-12-06 22:49:40,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 22:49:40,037 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:49:40,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:49:40,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:49:40,040 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-06 22:49:40,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 22:49:40,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:49:40,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 22:49:40,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:49:40,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2021-12-06 22:49:40,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:49:40,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2021-12-06 22:49:40,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981129142] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:49:40,895 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:49:40,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2021-12-06 22:49:40,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278529332] [2021-12-06 22:49:40,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:49:40,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-06 22:49:40,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:49:40,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-06 22:49:40,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-12-06 22:49:40,897 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) [2021-12-06 22:49:41,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:49:41,244 INFO L93 Difference]: Finished difference Result 119 states and 223 transitions. [2021-12-06 22:49:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-06 22:49:41,245 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 [2021-12-06 22:49:41,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:49:41,247 INFO L225 Difference]: With dead ends: 119 [2021-12-06 22:49:41,247 INFO L226 Difference]: Without dead ends: 76 [2021-12-06 22:49:41,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2021-12-06 22:49:41,250 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 148 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-06 22:49:41,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 109 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-06 22:49:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-06 22:49:41,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2021-12-06 22:49:41,263 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) [2021-12-06 22:49:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2021-12-06 22:49:41,265 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2021-12-06 22:49:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:49:41,266 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2021-12-06 22:49:41,266 INFO L471 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) [2021-12-06 22:49:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2021-12-06 22:49:41,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-12-06 22:49:41,274 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:49:41,275 INFO L514 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:49:41,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-06 22:49:41,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:49:41,477 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:49:41,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:49:41,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1020156483, now seen corresponding path program 3 times [2021-12-06 22:49:41,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:49:41,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063049] [2021-12-06 22:49:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:49:41,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:49:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 22:49:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-06 22:49:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:41,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 22:49:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-06 22:49:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-06 22:49:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:41,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-06 22:49:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:42,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-06 22:49:42,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 22:49:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-06 22:49:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-06 22:49:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2021-12-06 22:49:42,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:49:42,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063049] [2021-12-06 22:49:42,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063049] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:49:42,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292245701] [2021-12-06 22:49:42,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-06 22:49:42,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:49:42,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:49:42,165 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:49:42,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-06 22:49:42,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2021-12-06 22:49:42,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:49:42,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-06 22:49:42,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:49:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2021-12-06 22:49:42,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:49:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2021-12-06 22:49:43,653 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292245701] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:49:43,653 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:49:43,653 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2021-12-06 22:49:43,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514005301] [2021-12-06 22:49:43,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:49:43,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-06 22:49:43,655 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:49:43,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-06 22:49:43,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2021-12-06 22:49:43,656 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) [2021-12-06 22:49:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:49:43,954 INFO L93 Difference]: Finished difference Result 172 states and 339 transitions. [2021-12-06 22:49:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 22:49:43,955 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 [2021-12-06 22:49:43,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:49:43,959 INFO L225 Difference]: With dead ends: 172 [2021-12-06 22:49:43,959 INFO L226 Difference]: Without dead ends: 109 [2021-12-06 22:49:43,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 794 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2021-12-06 22:49:43,962 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 187 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 22:49:43,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 172 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 22:49:43,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-06 22:49:43,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2021-12-06 22:49:43,975 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) [2021-12-06 22:49:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2021-12-06 22:49:43,977 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 351 [2021-12-06 22:49:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:49:43,978 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2021-12-06 22:49:43,978 INFO L471 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) [2021-12-06 22:49:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2021-12-06 22:49:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-12-06 22:49:43,988 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:49:43,988 INFO L514 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:49:44,008 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2021-12-06 22:49:44,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-12-06 22:49:44,190 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:49:44,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:49:44,191 INFO L85 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 4 times [2021-12-06 22:49:44,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:49:44,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602756799] [2021-12-06 22:49:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:49:44,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:49:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-06 22:49:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-06 22:49:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 22:49:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-06 22:49:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-06 22:49:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-06 22:49:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-06 22:49:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 22:49:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-06 22:49:44,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:44,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:44,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:45,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-06 22:49:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-06 22:49:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-06 22:49:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:45,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-06 22:49:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-06 22:49:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-06 22:49:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-06 22:49:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-06 22:49:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:49:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:49:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2021-12-06 22:49:45,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:49:45,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602756799] [2021-12-06 22:49:45,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602756799] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 22:49:45,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766348602] [2021-12-06 22:49:45,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-06 22:49:45,199 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:49:45,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:49:45,200 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-06 22:49:45,201 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-06 22:49:45,312 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-06 22:49:45,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 22:49:45,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-06 22:49:45,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 22:49:45,777 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3346 refuted. 0 times theorem prover too weak. 11122 trivial. 0 not checked. [2021-12-06 22:49:45,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 22:49:48,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3454 refuted. 0 times theorem prover too weak. 11014 trivial. 0 not checked. [2021-12-06 22:49:48,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766348602] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 22:49:48,223 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-06 22:49:48,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 31] total 45 [2021-12-06 22:49:48,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257178483] [2021-12-06 22:49:48,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-06 22:49:48,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-06 22:49:48,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:49:48,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-06 22:49:48,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2021-12-06 22:49:48,227 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) [2021-12-06 22:49:48,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:49:48,744 INFO L93 Difference]: Finished difference Result 217 states and 398 transitions. [2021-12-06 22:49:48,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-06 22:49:48,745 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 [2021-12-06 22:49:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:49:48,748 INFO L225 Difference]: With dead ends: 217 [2021-12-06 22:49:48,748 INFO L226 Difference]: Without dead ends: 129 [2021-12-06 22:49:48,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1197 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2021-12-06 22:49:48,751 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 244 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:49:48,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 268 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 22:49:48,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-06 22:49:48,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2021-12-06 22:49:48,762 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) [2021-12-06 22:49:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2021-12-06 22:49:48,763 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 528 [2021-12-06 22:49:48,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:49:48,764 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2021-12-06 22:49:48,765 INFO L471 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) [2021-12-06 22:49:48,765 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2021-12-06 22:49:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-12-06 22:49:48,767 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:49:48,767 INFO L514 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:49:48,786 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-12-06 22:49:48,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-06 22:49:48,968 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:49:48,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:49:48,970 INFO L85 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 5 times [2021-12-06 22:49:48,970 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:49:48,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033243065] [2021-12-06 22:49:48,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:49:48,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:49:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:49:49,038 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:49:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:49:49,122 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:49:49,123 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 22:49:49,123 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 22:49:49,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-06 22:49:49,127 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2021-12-06 22:49:49,130 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 22:49:49,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 10:49:49 BoogieIcfgContainer [2021-12-06 22:49:49,220 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 22:49:49,220 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 22:49:49,220 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 22:49:49,221 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 22:49:49,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:49:37" (3/4) ... [2021-12-06 22:49:49,222 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 22:49:49,286 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 22:49:49,286 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 22:49:49,287 INFO L158 Benchmark]: Toolchain (without parser) took 12136.49ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 70.8MB in the beginning and 144.1MB in the end (delta: -73.3MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2021-12-06 22:49:49,287 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 22:49:49,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 177.24ms. Allocated memory is still 107.0MB. Free memory was 70.6MB in the beginning and 82.8MB in the end (delta: -12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-06 22:49:49,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.50ms. Allocated memory is still 107.0MB. Free memory was 82.8MB in the beginning and 81.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 22:49:49,288 INFO L158 Benchmark]: Boogie Preprocessor took 15.81ms. Allocated memory is still 107.0MB. Free memory was 81.3MB in the beginning and 80.6MB in the end (delta: 638.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 22:49:49,288 INFO L158 Benchmark]: RCFGBuilder took 178.53ms. Allocated memory is still 107.0MB. Free memory was 80.6MB in the beginning and 71.8MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 22:49:49,289 INFO L158 Benchmark]: TraceAbstraction took 11666.15ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 71.3MB in the beginning and 155.7MB in the end (delta: -84.4MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. [2021-12-06 22:49:49,289 INFO L158 Benchmark]: Witness Printer took 66.18ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 144.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-06 22:49:49,290 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.14ms. Allocated memory is still 107.0MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 177.24ms. Allocated memory is still 107.0MB. Free memory was 70.6MB in the beginning and 82.8MB in the end (delta: -12.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.50ms. Allocated memory is still 107.0MB. Free memory was 82.8MB in the beginning and 81.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.81ms. Allocated memory is still 107.0MB. Free memory was 81.3MB in the beginning and 80.6MB in the end (delta: 638.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 178.53ms. Allocated memory is still 107.0MB. Free memory was 80.6MB in the beginning and 71.8MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 11666.15ms. Allocated memory was 107.0MB in the beginning and 188.7MB in the end (delta: 81.8MB). Free memory was 71.3MB in the beginning and 155.7MB in the end (delta: -84.4MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. * Witness Printer took 66.18ms. Allocated memory is still 188.7MB. Free memory was 155.7MB in the beginning and 144.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 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: 11.5s, OverallIterations: 8, TraceHistogramMax: 77, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 782 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 641 mSDsCounter, 1148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1799 IncrementalHoareTripleChecker+Invalid, 2947 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1148 mSolverCounterUnsat, 141 mSDtfsCounter, 1799 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2787 GetRequests, 2573 SyntacticMatches, 5 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 1.2s 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 2757 NumberOfCodeBlocks, 2580 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3418 ConstructedInterpolants, 0 QuantifiedInterpolants, 5454 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! [2021-12-06 22:49:49,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e51638e1-8b5e-4156-aa77-cb49243501b1/bin/uautomizer-DrprNOufMa/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