/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:18:36,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:18:36,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:18:36,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:18:36,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:18:36,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:18:36,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:18:36,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:18:36,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:18:36,543 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:18:36,544 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:18:36,545 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:18:36,546 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:18:36,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:18:36,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:18:36,552 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:18:36,553 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:18:36,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:18:36,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:18:36,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:18:36,580 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:18:36,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:18:36,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:18:36,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:18:36,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:18:36,591 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:18:36,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:18:36,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:18:36,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:18:36,603 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:18:36,603 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:18:36,604 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:18:36,605 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:18:36,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:18:36,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:18:36,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:18:36,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:18:36,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:18:36,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:18:36,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:18:36,614 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:18:36,616 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:18:36,680 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:18:36,681 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:18:36,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:18:36,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:18:36,687 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:18:36,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:18:36,688 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:18:36,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:18:36,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:18:36,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:18:36,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:18:36,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:18:36,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:18:36,691 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:18:36,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:18:36,691 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:18:36,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:18:36,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:18:36,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:18:36,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:18:36,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:18:36,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:18:36,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:18:36,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:18:36,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:18:36,694 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:18:36,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:18:36,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:18:36,695 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:18:36,695 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-11-06 22:18:37,108 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:18:37,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:18:37,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:18:37,156 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:18:37,156 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:18:37,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-11-06 22:18:37,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f2b9b3f/f292ecf52e06404b808411297f107053/FLAG30993c5ee [2020-11-06 22:18:37,834 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:18:37,834 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_7-2.c [2020-11-06 22:18:37,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f2b9b3f/f292ecf52e06404b808411297f107053/FLAG30993c5ee [2020-11-06 22:18:38,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80f2b9b3f/f292ecf52e06404b808411297f107053 [2020-11-06 22:18:38,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:18:38,209 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:18:38,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:18:38,211 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:18:38,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:18:38,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:18:38" (1/1) ... [2020-11-06 22:18:38,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae616f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:38, skipping insertion in model container [2020-11-06 22:18:38,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:18:38" (1/1) ... [2020-11-06 22:18:38,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:18:38,241 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:18:38,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:18:38,400 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:18:38,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:18:38,434 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:18:38,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:38 WrapperNode [2020-11-06 22:18:38,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:18:38,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:18:38,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:18:38,436 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:18:38,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:38" (1/1) ... [2020-11-06 22:18:38,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:38" (1/1) ... [2020-11-06 22:18:38,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:38" (1/1) ... [2020-11-06 22:18:38,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:38" (1/1) ... [2020-11-06 22:18:38,463 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:38" (1/1) ... [2020-11-06 22:18:38,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:38" (1/1) ... [2020-11-06 22:18:38,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:38" (1/1) ... [2020-11-06 22:18:38,468 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:18:38,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:18:38,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:18:38,469 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:18:38,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:18:38,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:18:38,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:18:38,552 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:18:38,552 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-11-06 22:18:38,552 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:18:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:18:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:18:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:18:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:18:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:18:38,553 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-11-06 22:18:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:18:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:18:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:18:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:18:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:18:38,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:18:38,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:18:38,958 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:18:38,959 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-06 22:18:38,961 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:38 BoogieIcfgContainer [2020-11-06 22:18:38,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:18:38,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:18:38,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:18:38,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:18:38,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:18:38" (1/3) ... [2020-11-06 22:18:38,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceb829e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:18:38, skipping insertion in model container [2020-11-06 22:18:38,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:18:38" (2/3) ... [2020-11-06 22:18:38,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ceb829e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:18:38, skipping insertion in model container [2020-11-06 22:18:38,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:18:38" (3/3) ... [2020-11-06 22:18:38,976 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-11-06 22:18:39,002 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:18:39,005 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:18:39,021 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:18:39,062 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:18:39,063 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:18:39,063 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:18:39,063 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:18:39,063 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:18:39,063 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:18:39,064 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:18:39,064 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:18:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-11-06 22:18:39,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-06 22:18:39,094 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:18:39,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:18:39,095 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:18:39,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:18:39,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1708859500, now seen corresponding path program 1 times [2020-11-06 22:18:39,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:18:39,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173009206] [2020-11-06 22:18:39,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:18:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:39,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:18:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:39,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:18:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:18:39,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173009206] [2020-11-06 22:18:39,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:18:39,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:18:39,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939274195] [2020-11-06 22:18:39,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:18:39,471 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:18:39,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:18:39,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:18:39,488 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 6 states. [2020-11-06 22:18:39,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:18:39,959 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-11-06 22:18:39,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:18:39,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-06 22:18:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:18:39,971 INFO L225 Difference]: With dead ends: 44 [2020-11-06 22:18:39,971 INFO L226 Difference]: Without dead ends: 23 [2020-11-06 22:18:39,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:18:39,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-11-06 22:18:40,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-11-06 22:18:40,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-06 22:18:40,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-11-06 22:18:40,025 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2020-11-06 22:18:40,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:18:40,025 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-11-06 22:18:40,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:18:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-11-06 22:18:40,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-06 22:18:40,028 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:18:40,028 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:18:40,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:18:40,028 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:18:40,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:18:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash 2119969838, now seen corresponding path program 1 times [2020-11-06 22:18:40,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:18:40,030 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494724198] [2020-11-06 22:18:40,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:18:40,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:40,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:18:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:40,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:18:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:18:40,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494724198] [2020-11-06 22:18:40,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:18:40,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:18:40,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126216094] [2020-11-06 22:18:40,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:18:40,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:18:40,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:18:40,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:18:40,345 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-11-06 22:18:40,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:18:40,573 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-11-06 22:18:40,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:18:40,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-06 22:18:40,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:18:40,576 INFO L225 Difference]: With dead ends: 30 [2020-11-06 22:18:40,576 INFO L226 Difference]: Without dead ends: 25 [2020-11-06 22:18:40,577 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:18:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-11-06 22:18:40,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-11-06 22:18:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-06 22:18:40,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-11-06 22:18:40,588 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2020-11-06 22:18:40,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:18:40,588 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-11-06 22:18:40,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:18:40,588 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-11-06 22:18:40,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:18:40,590 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:18:40,590 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:18:40,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:18:40,590 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:18:40,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:18:40,591 INFO L82 PathProgramCache]: Analyzing trace with hash -308126725, now seen corresponding path program 1 times [2020-11-06 22:18:40,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:18:40,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863130345] [2020-11-06 22:18:40,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:18:40,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:40,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:18:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:40,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:18:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:40,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:40,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-06 22:18:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:18:40,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863130345] [2020-11-06 22:18:40,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691341502] [2020-11-06 22:18:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:18:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:40,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-06 22:18:40,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:18:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:18:41,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:18:41,008 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-11-06 22:18:41,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173222559] [2020-11-06 22:18:41,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:18:41,009 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:18:41,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:18:41,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:18:41,010 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2020-11-06 22:18:41,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:18:41,360 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2020-11-06 22:18:41,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:18:41,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-11-06 22:18:41,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:18:41,362 INFO L225 Difference]: With dead ends: 41 [2020-11-06 22:18:41,362 INFO L226 Difference]: Without dead ends: 25 [2020-11-06 22:18:41,363 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2020-11-06 22:18:41,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-11-06 22:18:41,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-11-06 22:18:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-06 22:18:41,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-11-06 22:18:41,373 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 28 [2020-11-06 22:18:41,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:18:41,373 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-11-06 22:18:41,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:18:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-11-06 22:18:41,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:18:41,375 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:18:41,375 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:18:41,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-06 22:18:41,590 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:18:41,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:18:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1144313053, now seen corresponding path program 1 times [2020-11-06 22:18:41,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:18:41,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119475875] [2020-11-06 22:18:41,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:18:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:41,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:18:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:41,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:18:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:41,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:41,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:18:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-06 22:18:41,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119475875] [2020-11-06 22:18:41,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717059971] [2020-11-06 22:18:41,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:18:41,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:41,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-06 22:18:41,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:18:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-06 22:18:41,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:18:41,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-11-06 22:18:41,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971733882] [2020-11-06 22:18:41,812 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:18:41,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:18:41,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:18:41,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:18:41,813 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2020-11-06 22:18:42,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:18:42,113 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2020-11-06 22:18:42,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:18:42,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-11-06 22:18:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:18:42,116 INFO L225 Difference]: With dead ends: 44 [2020-11-06 22:18:42,116 INFO L226 Difference]: Without dead ends: 39 [2020-11-06 22:18:42,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:18:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-06 22:18:42,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-06 22:18:42,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-06 22:18:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-11-06 22:18:42,129 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 29 [2020-11-06 22:18:42,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:18:42,130 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-11-06 22:18:42,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:18:42,130 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2020-11-06 22:18:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-06 22:18:42,132 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:18:42,132 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:18:42,345 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:18:42,346 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:18:42,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:18:42,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1249611306, now seen corresponding path program 2 times [2020-11-06 22:18:42,348 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:18:42,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075614010] [2020-11-06 22:18:42,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:18:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:42,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:18:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:42,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:18:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:42,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:42,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:42,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:18:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:42,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:18:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-06 22:18:42,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075614010] [2020-11-06 22:18:42,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905201689] [2020-11-06 22:18:42,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:18:42,612 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:18:42,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:18:42,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-06 22:18:42,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:18:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-06 22:18:42,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:18:42,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-11-06 22:18:42,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981552416] [2020-11-06 22:18:42,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:18:42,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:18:42,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:18:42,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:18:42,711 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand 13 states. [2020-11-06 22:18:43,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:18:43,514 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2020-11-06 22:18:43,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-06 22:18:43,515 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2020-11-06 22:18:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:18:43,516 INFO L225 Difference]: With dead ends: 75 [2020-11-06 22:18:43,517 INFO L226 Difference]: Without dead ends: 43 [2020-11-06 22:18:43,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2020-11-06 22:18:43,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-11-06 22:18:43,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-11-06 22:18:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-06 22:18:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2020-11-06 22:18:43,528 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 42 [2020-11-06 22:18:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:18:43,528 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2020-11-06 22:18:43,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:18:43,529 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2020-11-06 22:18:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-06 22:18:43,532 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:18:43,532 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:18:43,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:18:43,747 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:18:43,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:18:43,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1158728484, now seen corresponding path program 3 times [2020-11-06 22:18:43,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:18:43,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469678451] [2020-11-06 22:18:43,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:18:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:18:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:18:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:18:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:18:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:18:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:18:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:18:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:43,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:18:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-11-06 22:18:44,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469678451] [2020-11-06 22:18:44,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088675469] [2020-11-06 22:18:44,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:18:44,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-11-06 22:18:44,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:18:44,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-06 22:18:44,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:18:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2020-11-06 22:18:44,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:18:44,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-11-06 22:18:44,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225813682] [2020-11-06 22:18:44,182 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-06 22:18:44,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:18:44,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-06 22:18:44,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:18:44,183 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 14 states. [2020-11-06 22:18:45,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:18:45,335 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions. [2020-11-06 22:18:45,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-06 22:18:45,335 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2020-11-06 22:18:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:18:45,338 INFO L225 Difference]: With dead ends: 95 [2020-11-06 22:18:45,339 INFO L226 Difference]: Without dead ends: 58 [2020-11-06 22:18:45,341 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2020-11-06 22:18:45,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-11-06 22:18:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-11-06 22:18:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-11-06 22:18:45,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2020-11-06 22:18:45,355 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 98 [2020-11-06 22:18:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:18:45,355 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2020-11-06 22:18:45,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-06 22:18:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2020-11-06 22:18:45,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-06 22:18:45,358 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:18:45,358 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:18:45,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:18:45,573 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:18:45,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:18:45,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1296121057, now seen corresponding path program 4 times [2020-11-06 22:18:45,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:18:45,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736766186] [2020-11-06 22:18:45,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:18:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:18:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:18:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:45,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:18:45,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:18:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:18:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:18:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:18:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:18:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:18:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-11-06 22:18:45,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736766186] [2020-11-06 22:18:45,925 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845678711] [2020-11-06 22:18:45,926 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:18:45,993 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-06 22:18:45,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:18:45,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2020-11-06 22:18:46,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:18:46,067 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-11-06 22:18:46,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:18:46,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-11-06 22:18:46,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950162971] [2020-11-06 22:18:46,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:18:46,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:18:46,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:18:46,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:18:46,070 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand 11 states. [2020-11-06 22:18:46,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:18:46,797 INFO L93 Difference]: Finished difference Result 128 states and 178 transitions. [2020-11-06 22:18:46,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-06 22:18:46,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2020-11-06 22:18:46,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:18:46,808 INFO L225 Difference]: With dead ends: 128 [2020-11-06 22:18:46,808 INFO L226 Difference]: Without dead ends: 123 [2020-11-06 22:18:46,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:18:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-06 22:18:46,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2020-11-06 22:18:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-11-06 22:18:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2020-11-06 22:18:46,836 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 111 [2020-11-06 22:18:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:18:46,837 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2020-11-06 22:18:46,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:18:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2020-11-06 22:18:46,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-11-06 22:18:46,841 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:18:46,842 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:18:47,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-06 22:18:47,056 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:18:47,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:18:47,058 INFO L82 PathProgramCache]: Analyzing trace with hash -732775580, now seen corresponding path program 5 times [2020-11-06 22:18:47,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:18:47,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838032746] [2020-11-06 22:18:47,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:18:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:18:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:18:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:18:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:18:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:18:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:18:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:18:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:18:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:18:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-06 22:18:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:18:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:18:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:18:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:18:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,607 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:18:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:18:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-11-06 22:18:47,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838032746] [2020-11-06 22:18:47,672 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472299803] [2020-11-06 22:18:47,673 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:18:47,800 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2020-11-06 22:18:47,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:18:47,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 10 conjunts are in the unsatisfiable core [2020-11-06 22:18:47,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:18:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2020-11-06 22:18:47,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:18:47,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2020-11-06 22:18:47,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287413514] [2020-11-06 22:18:47,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:18:47,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:18:47,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:18:47,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:18:47,949 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 12 states. [2020-11-06 22:18:48,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:18:48,786 INFO L93 Difference]: Finished difference Result 256 states and 390 transitions. [2020-11-06 22:18:48,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-06 22:18:48,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2020-11-06 22:18:48,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:18:48,804 INFO L225 Difference]: With dead ends: 256 [2020-11-06 22:18:48,805 INFO L226 Difference]: Without dead ends: 251 [2020-11-06 22:18:48,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2020-11-06 22:18:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-11-06 22:18:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 239. [2020-11-06 22:18:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-11-06 22:18:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 367 transitions. [2020-11-06 22:18:48,909 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 367 transitions. Word has length 179 [2020-11-06 22:18:48,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:18:48,910 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 367 transitions. [2020-11-06 22:18:48,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:18:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 367 transitions. [2020-11-06 22:18:48,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2020-11-06 22:18:48,924 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:18:48,925 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:18:49,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:18:49,128 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:18:49,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:18:49,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1616639890, now seen corresponding path program 6 times [2020-11-06 22:18:49,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:18:49,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813862682] [2020-11-06 22:18:49,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:18:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:18:49,203 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:18:49,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:18:49,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:18:49,379 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:18:49,380 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:18:49,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-06 22:18:49,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:18:49 BoogieIcfgContainer [2020-11-06 22:18:49,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:18:49,511 INFO L168 Benchmark]: Toolchain (without parser) took 11305.56 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 126.8 MB in the beginning and 178.8 MB in the end (delta: -52.0 MB). Peak memory consumption was 59.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:18:49,512 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 124.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:18:49,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.38 ms. Allocated memory is still 151.0 MB. Free memory was 126.2 MB in the beginning and 116.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-06 22:18:49,513 INFO L168 Benchmark]: Boogie Preprocessor took 31.73 ms. Allocated memory is still 151.0 MB. Free memory was 116.7 MB in the beginning and 115.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:18:49,514 INFO L168 Benchmark]: RCFGBuilder took 492.83 ms. Allocated memory is still 151.0 MB. Free memory was 115.3 MB in the beginning and 102.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:18:49,515 INFO L168 Benchmark]: TraceAbstraction took 10543.12 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 102.3 MB in the beginning and 178.8 MB in the end (delta: -76.5 MB). Peak memory consumption was 35.7 MB. Max. memory is 8.0 GB. [2020-11-06 22:18:49,518 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.18 ms. Allocated memory is still 151.0 MB. Free memory is still 124.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 224.38 ms. Allocated memory is still 151.0 MB. Free memory was 126.2 MB in the beginning and 116.7 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 31.73 ms. Allocated memory is still 151.0 MB. Free memory was 116.7 MB in the beginning and 115.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 492.83 ms. Allocated memory is still 151.0 MB. Free memory was 115.3 MB in the beginning and 102.7 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 10543.12 ms. Allocated memory was 151.0 MB in the beginning and 262.1 MB in the end (delta: 111.1 MB). Free memory was 102.3 MB in the beginning and 178.8 MB in the end (delta: -76.5 MB). Peak memory consumption was 35.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L27] int result = fibo(x); [L28] COND TRUE result == 13 VAL [result=13, x=7] [L29] CALL reach_error() [L4] __assert_fail("0", "fibo_7-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.3s, OverallIterations: 9, TraceHistogramMax: 41, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 168 SDtfs, 444 SDslu, 235 SDs, 0 SdLazy, 1011 SolverSat, 443 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 760 GetRequests, 627 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=239occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 26 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1293 NumberOfCodeBlocks, 1242 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 991 ConstructedInterpolants, 0 QuantifiedInterpolants, 186027 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1310 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 4108/5446 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! Received shutdown request...