./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 e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive/Fibonacci05.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be --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 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-21 19:57:45,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 19:57:45,032 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 19:57:45,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 19:57:45,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 19:57:45,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 19:57:45,113 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 19:57:45,119 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 19:57:45,122 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 19:57:45,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 19:57:45,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 19:57:45,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 19:57:45,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 19:57:45,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 19:57:45,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 19:57:45,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 19:57:45,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 19:57:45,151 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 19:57:45,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 19:57:45,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 19:57:45,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 19:57:45,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 19:57:45,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 19:57:45,173 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 19:57:45,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 19:57:45,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 19:57:45,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 19:57:45,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 19:57:45,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 19:57:45,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 19:57:45,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 19:57:45,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 19:57:45,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 19:57:45,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 19:57:45,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 19:57:45,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 19:57:45,200 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 19:57:45,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 19:57:45,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 19:57:45,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 19:57:45,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 19:57:45,204 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 19:57:45,262 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 19:57:45,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 19:57:45,264 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 19:57:45,264 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 19:57:45,274 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 19:57:45,274 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 19:57:45,275 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 19:57:45,275 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 19:57:45,275 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 19:57:45,276 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 19:57:45,277 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 19:57:45,277 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 19:57:45,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 19:57:45,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 19:57:45,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 19:57:45,278 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 19:57:45,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 19:57:45,279 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 19:57:45,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 19:57:45,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 19:57:45,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 19:57:45,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 19:57:45,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:57:45,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 19:57:45,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 19:57:45,282 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 19:57:45,282 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 19:57:45,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 19:57:45,283 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 19:57:45,284 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 19:57:45,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 19:57:45,285 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 19:57:45,285 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_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/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_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be 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-10-21 19:57:45,688 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 19:57:45,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 19:57:45,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 19:57:45,742 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 19:57:45,743 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 19:57:45,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/recursive/Fibonacci05.c [2021-10-21 19:57:45,839 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/data/93ba29329/1ce4310fe12849fd89a9756bd21e21e9/FLAGbcd3ea1a5 [2021-10-21 19:57:46,490 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 19:57:46,490 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/sv-benchmarks/c/recursive/Fibonacci05.c [2021-10-21 19:57:46,508 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/data/93ba29329/1ce4310fe12849fd89a9756bd21e21e9/FLAGbcd3ea1a5 [2021-10-21 19:57:46,859 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/data/93ba29329/1ce4310fe12849fd89a9756bd21e21e9 [2021-10-21 19:57:46,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 19:57:46,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 19:57:46,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 19:57:46,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 19:57:46,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 19:57:46,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:57:46" (1/1) ... [2021-10-21 19:57:46,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6be9db9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:46, skipping insertion in model container [2021-10-21 19:57:46,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 07:57:46" (1/1) ... [2021-10-21 19:57:46,893 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 19:57:46,911 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 19:57:47,144 WARN L228 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_f73e82bb-cebe-483c-bb23-f1129b81bb70/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-10-21 19:57:47,160 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:57:47,175 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 19:57:47,197 WARN L228 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_f73e82bb-cebe-483c-bb23-f1129b81bb70/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-10-21 19:57:47,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 19:57:47,216 INFO L208 MainTranslator]: Completed translation [2021-10-21 19:57:47,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:47 WrapperNode [2021-10-21 19:57:47,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 19:57:47,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 19:57:47,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 19:57:47,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 19:57:47,232 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:47" (1/1) ... [2021-10-21 19:57:47,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:47" (1/1) ... [2021-10-21 19:57:47,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 19:57:47,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 19:57:47,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 19:57:47,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 19:57:47,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:47" (1/1) ... [2021-10-21 19:57:47,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:47" (1/1) ... [2021-10-21 19:57:47,291 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:47" (1/1) ... [2021-10-21 19:57:47,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:47" (1/1) ... [2021-10-21 19:57:47,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:47" (1/1) ... [2021-10-21 19:57:47,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:47" (1/1) ... [2021-10-21 19:57:47,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:47" (1/1) ... [2021-10-21 19:57:47,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 19:57:47,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 19:57:47,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 19:57:47,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 19:57:47,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:47" (1/1) ... [2021-10-21 19:57:47,324 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 19:57:47,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:57:47,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 19:57:47,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 19:57:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-10-21 19:57:47,423 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-10-21 19:57:47,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 19:57:47,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 19:57:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 19:57:47,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 19:57:47,669 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 19:57:47,669 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-21 19:57:47,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:57:47 BoogieIcfgContainer [2021-10-21 19:57:47,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 19:57:47,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 19:57:47,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 19:57:47,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 19:57:47,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 07:57:46" (1/3) ... [2021-10-21 19:57:47,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39288edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:57:47, skipping insertion in model container [2021-10-21 19:57:47,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 07:57:47" (2/3) ... [2021-10-21 19:57:47,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39288edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 07:57:47, skipping insertion in model container [2021-10-21 19:57:47,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:57:47" (3/3) ... [2021-10-21 19:57:47,682 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2021-10-21 19:57:47,688 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 19:57:47,689 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-21 19:57:47,793 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 19:57:47,821 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-10-21 19:57:47,821 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-21 19:57:47,848 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-10-21 19:57:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-21 19:57:47,854 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:57:47,855 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:57:47,856 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:57:47,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:57:47,874 INFO L82 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-10-21 19:57:47,893 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:57:47,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138043899] [2021-10-21 19:57:47,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:57:47,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:57:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:48,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:57:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:48,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:57:48,294 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:57:48,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138043899] [2021-10-21 19:57:48,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138043899] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:57:48,296 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:57:48,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:57:48,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416291688] [2021-10-21 19:57:48,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:57:48,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:57:48,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:57:48,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:57:48,346 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-10-21 19:57:48,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:57:48,476 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-10-21 19:57:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:57:48,478 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-10-21 19:57:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:57:48,490 INFO L225 Difference]: With dead ends: 31 [2021-10-21 19:57:48,490 INFO L226 Difference]: Without dead ends: 18 [2021-10-21 19:57:48,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 61.6ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:57:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-10-21 19:57:48,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-10-21 19:57:48,544 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-10-21 19:57:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-10-21 19:57:48,549 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-10-21 19:57:48,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:57:48,550 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-10-21 19:57:48,550 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-10-21 19:57:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-10-21 19:57:48,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-21 19:57:48,553 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:57:48,553 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:57:48,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 19:57:48,554 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:57:48,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:57:48,555 INFO L82 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-10-21 19:57:48,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:57:48,556 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407804858] [2021-10-21 19:57:48,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:57:48,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:57:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:48,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:57:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 19:57:48,687 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:57:48,687 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407804858] [2021-10-21 19:57:48,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407804858] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 19:57:48,688 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 19:57:48,688 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 19:57:48,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311099050] [2021-10-21 19:57:48,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 19:57:48,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:57:48,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 19:57:48,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 19:57:48,692 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-10-21 19:57:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:57:48,763 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-10-21 19:57:48,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 19:57:48,764 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-10-21 19:57:48,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:57:48,766 INFO L225 Difference]: With dead ends: 24 [2021-10-21 19:57:48,767 INFO L226 Difference]: Without dead ends: 20 [2021-10-21 19:57:48,768 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-21 19:57:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-21 19:57:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-10-21 19:57:48,774 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-10-21 19:57:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-10-21 19:57:48,776 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-10-21 19:57:48,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:57:48,777 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-10-21 19:57:48,777 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-10-21 19:57:48,777 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-10-21 19:57:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-21 19:57:48,779 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:57:48,779 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:57:48,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 19:57:48,780 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:57:48,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:57:48,781 INFO L82 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-10-21 19:57:48,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:57:48,782 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027339020] [2021-10-21 19:57:48,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:57:48,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:57:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:48,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:57:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:48,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:48,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-10-21 19:57:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-21 19:57:48,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:57:48,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027339020] [2021-10-21 19:57:48,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027339020] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:57:48,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073117532] [2021-10-21 19:57:48,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:57:48,913 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:57:48,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:57:48,928 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:57:48,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-21 19:57:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:49,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-21 19:57:49,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:57:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-21 19:57:49,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073117532] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:57:49,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:57:49,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2021-10-21 19:57:49,276 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79254998] [2021-10-21 19:57:49,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-21 19:57:49,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:57:49,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-21 19:57:49,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:57:49,279 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-10-21 19:57:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:57:49,440 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2021-10-21 19:57:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:57:49,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 23 [2021-10-21 19:57:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:57:49,442 INFO L225 Difference]: With dead ends: 35 [2021-10-21 19:57:49,442 INFO L226 Difference]: Without dead ends: 20 [2021-10-21 19:57:49,444 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 123.3ms TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:57:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-21 19:57:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-21 19:57:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-10-21 19:57:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2021-10-21 19:57:49,452 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2021-10-21 19:57:49,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:57:49,452 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2021-10-21 19:57:49,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 5 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2021-10-21 19:57:49,453 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2021-10-21 19:57:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-21 19:57:49,455 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:57:49,455 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:57:49,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-21 19:57:49,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-10-21 19:57:49,656 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:57:49,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:57:49,657 INFO L82 PathProgramCache]: Analyzing trace with hash 187716987, now seen corresponding path program 1 times [2021-10-21 19:57:49,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:57:49,658 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8271594] [2021-10-21 19:57:49,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:57:49,659 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:57:49,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:57:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:49,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:49,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-21 19:57:49,927 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:57:49,928 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8271594] [2021-10-21 19:57:49,928 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8271594] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:57:49,929 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316122190] [2021-10-21 19:57:49,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:57:49,929 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:57:49,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:57:49,937 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:57:49,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-10-21 19:57:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:50,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-21 19:57:50,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:57:50,265 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-10-21 19:57:50,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316122190] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:57:50,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:57:50,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-10-21 19:57:50,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183122881] [2021-10-21 19:57:50,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-21 19:57:50,268 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:57:50,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-21 19:57:50,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-21 19:57:50,269 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-10-21 19:57:50,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:57:50,413 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2021-10-21 19:57:50,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-21 19:57:50,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 24 [2021-10-21 19:57:50,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:57:50,421 INFO L225 Difference]: With dead ends: 38 [2021-10-21 19:57:50,424 INFO L226 Difference]: Without dead ends: 34 [2021-10-21 19:57:50,427 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 60.9ms TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2021-10-21 19:57:50,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-10-21 19:57:50,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2021-10-21 19:57:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2021-10-21 19:57:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2021-10-21 19:57:50,449 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2021-10-21 19:57:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:57:50,449 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2021-10-21 19:57:50,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 5 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2021-10-21 19:57:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2021-10-21 19:57:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-21 19:57:50,457 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:57:50,457 INFO L512 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:57:50,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-10-21 19:57:50,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:57:50,673 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:57:50,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:57:50,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1151618030, now seen corresponding path program 2 times [2021-10-21 19:57:50,674 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:57:50,674 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296170711] [2021-10-21 19:57:50,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:57:50,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:57:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:50,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:57:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:50,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-10-21 19:57:50,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:57:50,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296170711] [2021-10-21 19:57:50,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296170711] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:57:50,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002688927] [2021-10-21 19:57:50,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-21 19:57:50,860 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:57:50,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:57:50,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:57:50,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-10-21 19:57:50,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-21 19:57:50,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:57:50,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-21 19:57:50,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:57:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-10-21 19:57:51,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002688927] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:57:51,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:57:51,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2021-10-21 19:57:51,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916124918] [2021-10-21 19:57:51,227 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-21 19:57:51,227 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:57:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-21 19:57:51,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2021-10-21 19:57:51,228 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-10-21 19:57:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:57:51,483 INFO L93 Difference]: Finished difference Result 68 states and 103 transitions. [2021-10-21 19:57:51,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 19:57:51,484 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Word has length 37 [2021-10-21 19:57:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:57:51,487 INFO L225 Difference]: With dead ends: 68 [2021-10-21 19:57:51,488 INFO L226 Difference]: Without dead ends: 35 [2021-10-21 19:57:51,495 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 152.1ms TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2021-10-21 19:57:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2021-10-21 19:57:51,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2021-10-21 19:57:51,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2021-10-21 19:57:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2021-10-21 19:57:51,515 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 37 [2021-10-21 19:57:51,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:57:51,516 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2021-10-21 19:57:51,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2021-10-21 19:57:51,517 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2021-10-21 19:57:51,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2021-10-21 19:57:51,530 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:57:51,531 INFO L512 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:57:51,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-10-21 19:57:51,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:57:51,753 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:57:51,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:57:51,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1916996739, now seen corresponding path program 3 times [2021-10-21 19:57:51,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:57:51,755 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981115258] [2021-10-21 19:57:51,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:57:51,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:57:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:51,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:57:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:51,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:51,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:52,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:52,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:52,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:52,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:52,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-21 19:57:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:52,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:52,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:52,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:52,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-10-21 19:57:52,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:57:52,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981115258] [2021-10-21 19:57:52,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981115258] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:57:52,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844400635] [2021-10-21 19:57:52,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-10-21 19:57:52,159 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:57:52,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:57:52,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:57:52,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-10-21 19:57:52,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-10-21 19:57:52,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:57:52,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-21 19:57:52,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:57:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2021-10-21 19:57:52,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844400635] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:57:52,592 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:57:52,593 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2021-10-21 19:57:52,593 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014686450] [2021-10-21 19:57:52,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-21 19:57:52,594 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:57:52,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-21 19:57:52,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-10-21 19:57:52,596 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2021-10-21 19:57:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:57:52,811 INFO L93 Difference]: Finished difference Result 93 states and 139 transitions. [2021-10-21 19:57:52,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-21 19:57:52,813 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) Word has length 79 [2021-10-21 19:57:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:57:52,825 INFO L225 Difference]: With dead ends: 93 [2021-10-21 19:57:52,825 INFO L226 Difference]: Without dead ends: 87 [2021-10-21 19:57:52,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 100.4ms TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:57:52,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-10-21 19:57:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 81. [2021-10-21 19:57:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.169811320754717) internal successors, (62), 53 states have internal predecessors, (62), 16 states have call successors, (16), 6 states have call predecessors, (16), 11 states have return successors, (43), 21 states have call predecessors, (43), 16 states have call successors, (43) [2021-10-21 19:57:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 121 transitions. [2021-10-21 19:57:52,872 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 121 transitions. Word has length 79 [2021-10-21 19:57:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:57:52,874 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 121 transitions. [2021-10-21 19:57:52,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 6 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (13), 11 states have call predecessors, (13), 6 states have call successors, (13) [2021-10-21 19:57:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 121 transitions. [2021-10-21 19:57:52,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2021-10-21 19:57:52,889 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:57:52,889 INFO L512 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:57:52,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-10-21 19:57:53,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2021-10-21 19:57:53,117 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:57:53,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:57:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1766942948, now seen corresponding path program 4 times [2021-10-21 19:57:53,118 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:57:53,118 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662326763] [2021-10-21 19:57:53,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:57:53,118 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:57:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:57:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:53,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:53,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:53,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-21 19:57:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:53,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-21 19:57:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:53,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:53,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:53,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-21 19:57:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-21 19:57:53,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:53,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-10-21 19:57:53,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:57:53,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662326763] [2021-10-21 19:57:53,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662326763] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:57:53,706 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592979890] [2021-10-21 19:57:53,707 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-10-21 19:57:53,707 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:57:53,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:57:53,708 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:57:53,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-10-21 19:57:53,928 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-10-21 19:57:53,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:57:53,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-21 19:57:53,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:57:54,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2021-10-21 19:57:54,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592979890] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:57:54,485 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:57:54,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 16 [2021-10-21 19:57:54,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354459286] [2021-10-21 19:57:54,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-10-21 19:57:54,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:57:54,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-10-21 19:57:54,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-10-21 19:57:54,489 INFO L87 Difference]: Start difference. First operand 81 states and 121 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) [2021-10-21 19:57:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:57:54,777 INFO L93 Difference]: Finished difference Result 205 states and 344 transitions. [2021-10-21 19:57:54,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-21 19:57:54,778 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) Word has length 174 [2021-10-21 19:57:54,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:57:54,785 INFO L225 Difference]: With dead ends: 205 [2021-10-21 19:57:54,785 INFO L226 Difference]: Without dead ends: 201 [2021-10-21 19:57:54,787 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 127.7ms TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2021-10-21 19:57:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2021-10-21 19:57:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 189. [2021-10-21 19:57:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 121 states have (on average 1.1900826446280992) internal successors, (144), 121 states have internal predecessors, (144), 42 states have call successors, (42), 13 states have call predecessors, (42), 25 states have return successors, (137), 54 states have call predecessors, (137), 42 states have call successors, (137) [2021-10-21 19:57:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 323 transitions. [2021-10-21 19:57:54,828 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 323 transitions. Word has length 174 [2021-10-21 19:57:54,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:57:54,829 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 323 transitions. [2021-10-21 19:57:54,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 16 states have internal predecessors, (42), 13 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (23), 12 states have call predecessors, (23), 13 states have call successors, (23) [2021-10-21 19:57:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 323 transitions. [2021-10-21 19:57:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2021-10-21 19:57:54,847 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:57:54,848 INFO L512 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:57:54,873 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-10-21 19:57:55,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-10-21 19:57:55,057 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:57:55,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:57:55,057 INFO L82 PathProgramCache]: Analyzing trace with hash -778425254, now seen corresponding path program 5 times [2021-10-21 19:57:55,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:57:55,058 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28531048] [2021-10-21 19:57:55,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:57:55,058 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:57:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:57:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-21 19:57:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-21 19:57:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-21 19:57:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-21 19:57:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:55,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-21 19:57:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-21 19:57:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-21 19:57:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2021-10-21 19:57:56,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:57:56,099 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28531048] [2021-10-21 19:57:56,100 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28531048] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:57:56,100 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189214888] [2021-10-21 19:57:56,100 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-10-21 19:57:56,100 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:57:56,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:57:56,102 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:57:56,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-10-21 19:57:56,452 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2021-10-21 19:57:56,453 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:57:56,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 14 conjunts are in the unsatisfiable core [2021-10-21 19:57:56,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:57:57,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 801 proven. 327 refuted. 0 times theorem prover too weak. 3440 trivial. 0 not checked. [2021-10-21 19:57:57,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189214888] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:57:57,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:57:57,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 19 [2021-10-21 19:57:57,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857392765] [2021-10-21 19:57:57,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2021-10-21 19:57:57,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:57:57,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-10-21 19:57:57,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2021-10-21 19:57:57,507 INFO L87 Difference]: Start difference. First operand 189 states and 323 transitions. Second operand has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (24), 15 states have call predecessors, (24), 12 states have call successors, (24) [2021-10-21 19:57:57,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:57:57,836 INFO L93 Difference]: Finished difference Result 297 states and 574 transitions. [2021-10-21 19:57:57,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-21 19:57:57,837 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (24), 15 states have call predecessors, (24), 12 states have call successors, (24) Word has length 283 [2021-10-21 19:57:57,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:57:57,841 INFO L225 Difference]: With dead ends: 297 [2021-10-21 19:57:57,841 INFO L226 Difference]: Without dead ends: 100 [2021-10-21 19:57:57,844 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 165.8ms TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2021-10-21 19:57:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-10-21 19:57:57,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 71. [2021-10-21 19:57:57,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (43), 15 states have call predecessors, (43), 13 states have call successors, (43) [2021-10-21 19:57:57,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 115 transitions. [2021-10-21 19:57:57,884 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 115 transitions. Word has length 283 [2021-10-21 19:57:57,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:57:57,886 INFO L470 AbstractCegarLoop]: Abstraction has 71 states and 115 transitions. [2021-10-21 19:57:57,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (15), 1 states have call predecessors, (15), 9 states have return successors, (24), 15 states have call predecessors, (24), 12 states have call successors, (24) [2021-10-21 19:57:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 115 transitions. [2021-10-21 19:57:57,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-10-21 19:57:57,901 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:57:57,902 INFO L512 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:57:57,952 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-10-21 19:57:58,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:57:58,128 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:57:58,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:57:58,129 INFO L82 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 6 times [2021-10-21 19:57:58,129 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:57:58,129 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287486277] [2021-10-21 19:57:58,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:57:58,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:57:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:58,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-10-21 19:57:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:59,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:59,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-21 19:57:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-21 19:57:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-21 19:57:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-21 19:57:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-21 19:57:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-21 19:57:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-21 19:57:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:57:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:57:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-10-21 19:57:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:57:59,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:57:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:58:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:58:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-21 19:58:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:58:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-10-21 19:58:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:58:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:58:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-10-21 19:58:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:58:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:58:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-21 19:58:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:58:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-10-21 19:58:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:58:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-10-21 19:58:00,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-10-21 19:58:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-10-21 19:58:00,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-10-21 19:58:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 19:58:00,330 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2021-10-21 19:58:00,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 19:58:00,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287486277] [2021-10-21 19:58:00,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287486277] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:58:00,331 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113745124] [2021-10-21 19:58:00,331 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-10-21 19:58:00,332 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:58:00,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 19:58:00,337 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-21 19:58:00,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-10-21 19:58:01,153 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2021-10-21 19:58:01,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-21 19:58:01,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 16 conjunts are in the unsatisfiable core [2021-10-21 19:58:01,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-21 19:58:02,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2668 proven. 293 refuted. 0 times theorem prover too weak. 13446 trivial. 0 not checked. [2021-10-21 19:58:02,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113745124] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-21 19:58:02,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-10-21 19:58:02,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 12] total 30 [2021-10-21 19:58:02,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079488625] [2021-10-21 19:58:02,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-10-21 19:58:02,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 19:58:02,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-10-21 19:58:02,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2021-10-21 19:58:02,835 INFO L87 Difference]: Start difference. First operand 71 states and 115 transitions. Second operand has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 16 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (36), 26 states have call predecessors, (36), 16 states have call successors, (36) [2021-10-21 19:58:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 19:58:03,886 INFO L93 Difference]: Finished difference Result 189 states and 398 transitions. [2021-10-21 19:58:03,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2021-10-21 19:58:03,887 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 16 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (36), 26 states have call predecessors, (36), 16 states have call successors, (36) Word has length 528 [2021-10-21 19:58:03,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 19:58:03,890 INFO L225 Difference]: With dead ends: 189 [2021-10-21 19:58:03,890 INFO L226 Difference]: Without dead ends: 121 [2021-10-21 19:58:03,895 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 742 GetRequests, 686 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 661.5ms TimeCoverageRelationStatistics Valid=649, Invalid=2543, Unknown=0, NotChecked=0, Total=3192 [2021-10-21 19:58:03,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-10-21 19:58:03,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2021-10-21 19:58:03,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 80 states have (on average 1.075) internal successors, (86), 75 states have internal predecessors, (86), 21 states have call successors, (21), 18 states have call predecessors, (21), 9 states have return successors, (46), 17 states have call predecessors, (46), 21 states have call successors, (46) [2021-10-21 19:58:03,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 153 transitions. [2021-10-21 19:58:03,919 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 153 transitions. Word has length 528 [2021-10-21 19:58:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 19:58:03,920 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 153 transitions. [2021-10-21 19:58:03,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2666666666666666) internal successors, (68), 30 states have internal predecessors, (68), 16 states have call successors, (22), 1 states have call predecessors, (22), 15 states have return successors, (36), 26 states have call predecessors, (36), 16 states have call successors, (36) [2021-10-21 19:58:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 153 transitions. [2021-10-21 19:58:03,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-10-21 19:58:03,935 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 19:58:03,936 INFO L512 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 19:58:03,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-10-21 19:58:04,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-21 19:58:04,156 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 19:58:04,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 19:58:04,156 INFO L82 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 7 times [2021-10-21 19:58:04,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 19:58:04,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883216472] [2021-10-21 19:58:04,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 19:58:04,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 19:58:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:58:04,255 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 19:58:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 19:58:04,508 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 19:58:04,508 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 19:58:04,510 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 19:58:04,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 19:58:04,524 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 19:58:04,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 07:58:04 BoogieIcfgContainer [2021-10-21 19:58:04,748 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 19:58:04,748 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 19:58:04,748 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 19:58:04,749 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 19:58:04,749 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 07:57:47" (3/4) ... [2021-10-21 19:58:04,751 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 19:58:04,905 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 19:58:04,905 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 19:58:04,907 INFO L168 Benchmark]: Toolchain (without parser) took 18037.49 ms. Allocated memory was 98.6 MB in the beginning and 195.0 MB in the end (delta: 96.5 MB). Free memory was 70.0 MB in the beginning and 126.2 MB in the end (delta: -56.2 MB). Peak memory consumption was 39.0 MB. Max. memory is 16.1 GB. [2021-10-21 19:58:04,907 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 98.6 MB. Free memory is still 51.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:58:04,908 INFO L168 Benchmark]: CACSL2BoogieTranslator took 344.55 ms. Allocated memory is still 98.6 MB. Free memory was 69.8 MB in the beginning and 73.5 MB in the end (delta: -3.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:58:04,908 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.36 ms. Allocated memory is still 98.6 MB. Free memory was 73.5 MB in the beginning and 72.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 19:58:04,909 INFO L168 Benchmark]: Boogie Preprocessor took 42.80 ms. Allocated memory is still 98.6 MB. Free memory was 72.1 MB in the beginning and 71.2 MB in the end (delta: 948.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 19:58:04,910 INFO L168 Benchmark]: RCFGBuilder took 360.59 ms. Allocated memory is still 98.6 MB. Free memory was 70.9 MB in the beginning and 61.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-21 19:58:04,910 INFO L168 Benchmark]: TraceAbstraction took 17074.06 ms. Allocated memory was 98.6 MB in the beginning and 195.0 MB in the end (delta: 96.5 MB). Free memory was 61.4 MB in the beginning and 145.1 MB in the end (delta: -83.7 MB). Peak memory consumption was 109.9 MB. Max. memory is 16.1 GB. [2021-10-21 19:58:04,911 INFO L168 Benchmark]: Witness Printer took 157.17 ms. Allocated memory is still 195.0 MB. Free memory was 145.1 MB in the beginning and 126.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2021-10-21 19:58:04,913 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.30 ms. Allocated memory is still 98.6 MB. Free memory is still 51.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 344.55 ms. Allocated memory is still 98.6 MB. Free memory was 69.8 MB in the beginning and 73.5 MB in the end (delta: -3.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.36 ms. Allocated memory is still 98.6 MB. Free memory was 73.5 MB in the beginning and 72.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.80 ms. Allocated memory is still 98.6 MB. Free memory was 72.1 MB in the beginning and 71.2 MB in the end (delta: 948.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 360.59 ms. Allocated memory is still 98.6 MB. Free memory was 70.9 MB in the beginning and 61.8 MB in the end (delta: 9.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17074.06 ms. Allocated memory was 98.6 MB in the beginning and 195.0 MB in the end (delta: 96.5 MB). Free memory was 61.4 MB in the beginning and 145.1 MB in the end (delta: -83.7 MB). Peak memory consumption was 109.9 MB. Max. memory is 16.1 GB. * Witness Printer took 157.17 ms. Allocated memory is still 195.0 MB. Free memory was 145.1 MB in the beginning and 126.2 MB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms 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) [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) [L33] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16728.1ms, OverallIterations: 10, TraceHistogramMax: 77, EmptinessCheckTime: 98.4ms, AutomataDifference: 2766.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 21.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 155 SDtfs, 571 SDslu, 509 SDs, 0 SdLazy, 1301 SolverSat, 733 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1295.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1629 GetRequests, 1480 SyntacticMatches, 3 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1274 ImplicationChecksByTransitivity, 1474.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=7, InterpolantAutomatonStates: 124, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 236.9ms AutomataMinimizationTime, 9 MinimizatonAttempts, 59 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 212.8ms SsaConstructionTime, 1245.8ms SatisfiabilityAnalysisTime, 9045.1ms InterpolantComputationTime, 2777 NumberOfCodeBlocks, 2691 NumberOfCodeBlocksAsserted, 125 NumberOfCheckSat, 2301 ConstructedInterpolants, 0 QuantifiedInterpolants, 3541 SizeOfPredicates, 29 NumberOfNonLiveVariables, 2577 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 40160/45994 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-10-21 19:58:04,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73e82bb-cebe-483c-bb23-f1129b81bb70/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...