./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci04.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d3562c726fb0df5872bc6ae08c11ec0d40862c19 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:24:09,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:24:09,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:24:09,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:24:09,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:24:09,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:24:09,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:24:09,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:24:09,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:24:09,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:24:09,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:24:09,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:24:09,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:24:09,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:24:09,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:24:09,298 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:24:09,300 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:24:09,301 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:24:09,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:24:09,304 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:24:09,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:24:09,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:24:09,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:24:09,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:24:09,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:24:09,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:24:09,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:24:09,318 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:24:09,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:24:09,320 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:24:09,321 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:24:09,322 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:24:09,323 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:24:09,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:24:09,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:24:09,327 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:24:09,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:24:09,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:24:09,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:24:09,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:24:09,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:24:09,334 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:24:09,348 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:24:09,348 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:24:09,350 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:24:09,350 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:24:09,350 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:24:09,351 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:24:09,351 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:24:09,351 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:24:09,351 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:24:09,352 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:24:09,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:24:09,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:24:09,353 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:24:09,353 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:24:09,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:24:09,353 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:24:09,354 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:24:09,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:24:09,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:24:09,355 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:24:09,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:24:09,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:24:09,356 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:24:09,356 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:24:09,356 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:24:09,356 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:24:09,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:24:09,357 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:24:09,357 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d3562c726fb0df5872bc6ae08c11ec0d40862c19 [2019-11-28 00:24:09,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:24:09,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:24:09,720 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:24:09,721 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:24:09,722 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:24:09,723 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04.c [2019-11-28 00:24:09,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3c254028/06ef8da17bbf4f089da9457de6dea886/FLAG733ee3fd0 [2019-11-28 00:24:10,181 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:24:10,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2019-11-28 00:24:10,189 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3c254028/06ef8da17bbf4f089da9457de6dea886/FLAG733ee3fd0 [2019-11-28 00:24:10,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3c254028/06ef8da17bbf4f089da9457de6dea886 [2019-11-28 00:24:10,547 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:24:10,549 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:24:10,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:24:10,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:24:10,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:24:10,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb70adb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10, skipping insertion in model container [2019-11-28 00:24:10,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:24:10,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:24:10,818 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:24:10,824 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:24:10,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:24:10,862 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:24:10,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10 WrapperNode [2019-11-28 00:24:10,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:24:10,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:24:10,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:24:10,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:24:10,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:24:10,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:24:10,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:24:10,902 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:24:10,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,972 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,973 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,977 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (1/1) ... [2019-11-28 00:24:10,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:24:10,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:24:10,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:24:10,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:24:10,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (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 [2019-11-28 00:24:11,045 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-11-28 00:24:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-11-28 00:24:11,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:24:11,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:24:11,228 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:24:11,228 INFO L297 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 00:24:11,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:11 BoogieIcfgContainer [2019-11-28 00:24:11,230 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:24:11,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:24:11,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:24:11,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:24:11,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:24:10" (1/3) ... [2019-11-28 00:24:11,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441204d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:24:11, skipping insertion in model container [2019-11-28 00:24:11,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:24:10" (2/3) ... [2019-11-28 00:24:11,240 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@441204d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:24:11, skipping insertion in model container [2019-11-28 00:24:11,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:11" (3/3) ... [2019-11-28 00:24:11,245 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2019-11-28 00:24:11,269 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:24:11,282 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 00:24:11,312 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 00:24:11,354 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:24:11,368 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:24:11,368 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:24:11,368 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:24:11,369 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:24:11,369 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:24:11,369 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:24:11,369 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:24:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-11-28 00:24:11,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 00:24:11,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:11,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:11,418 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash 238562696, now seen corresponding path program 1 times [2019-11-28 00:24:11,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:11,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979559990] [2019-11-28 00:24:11,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:11,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:24:11,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979559990] [2019-11-28 00:24:11,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:11,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:24:11,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029940710] [2019-11-28 00:24:11,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:24:11,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:11,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:24:11,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:24:11,651 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 5 states. [2019-11-28 00:24:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:11,793 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2019-11-28 00:24:11,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:24:11,795 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 00:24:11,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:11,804 INFO L225 Difference]: With dead ends: 30 [2019-11-28 00:24:11,804 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 00:24:11,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:24:11,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 00:24:11,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 00:24:11,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:24:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 00:24:11,851 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-11-28 00:24:11,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:11,851 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 00:24:11,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:24:11,852 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 00:24:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 00:24:11,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:11,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:11,854 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:11,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:11,855 INFO L82 PathProgramCache]: Analyzing trace with hash -497654578, now seen corresponding path program 1 times [2019-11-28 00:24:11,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:11,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163627643] [2019-11-28 00:24:11,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:24:11,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163627643] [2019-11-28 00:24:11,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:24:11,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:24:11,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109621387] [2019-11-28 00:24:11,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:24:11,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:11,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:24:11,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:24:11,938 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-11-28 00:24:12,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:12,028 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-28 00:24:12,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 00:24:12,029 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 00:24:12,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:12,031 INFO L225 Difference]: With dead ends: 23 [2019-11-28 00:24:12,031 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 00:24:12,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:24:12,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 00:24:12,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-28 00:24:12,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 00:24:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-28 00:24:12,040 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-28 00:24:12,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:12,040 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-28 00:24:12,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:24:12,041 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-28 00:24:12,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 00:24:12,042 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:12,042 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:12,043 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:12,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:12,043 INFO L82 PathProgramCache]: Analyzing trace with hash -850570499, now seen corresponding path program 1 times [2019-11-28 00:24:12,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:12,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509037695] [2019-11-28 00:24:12,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 00:24:12,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509037695] [2019-11-28 00:24:12,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339013333] [2019-11-28 00:24:12,177 INFO L94 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 [2019-11-28 00:24:12,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:24:12,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 00:24:12,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:12,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2019-11-28 00:24:12,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069144013] [2019-11-28 00:24:12,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 00:24:12,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:12,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 00:24:12,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:24:12,326 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 9 states. [2019-11-28 00:24:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:12,486 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2019-11-28 00:24:12,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:24:12,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-28 00:24:12,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:12,489 INFO L225 Difference]: With dead ends: 34 [2019-11-28 00:24:12,489 INFO L226 Difference]: Without dead ends: 19 [2019-11-28 00:24:12,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:24:12,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-28 00:24:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-11-28 00:24:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 00:24:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-11-28 00:24:12,505 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 22 [2019-11-28 00:24:12,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:12,506 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-11-28 00:24:12,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 00:24:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-11-28 00:24:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 00:24:12,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:12,508 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:12,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:12,713 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:12,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:12,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1834230885, now seen corresponding path program 1 times [2019-11-28 00:24:12,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:12,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366564200] [2019-11-28 00:24:12,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 00:24:12,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366564200] [2019-11-28 00:24:12,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329073706] [2019-11-28 00:24:12,849 INFO L94 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 [2019-11-28 00:24:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:12,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 00:24:12,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 00:24:12,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:12,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-28 00:24:12,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956367683] [2019-11-28 00:24:12,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 00:24:12,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:12,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 00:24:12,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:24:12,931 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 8 states. [2019-11-28 00:24:13,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:13,051 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2019-11-28 00:24:13,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:24:13,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-28 00:24:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:13,055 INFO L225 Difference]: With dead ends: 37 [2019-11-28 00:24:13,055 INFO L226 Difference]: Without dead ends: 33 [2019-11-28 00:24:13,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:24:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-28 00:24:13,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-11-28 00:24:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 00:24:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-11-28 00:24:13,068 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 23 [2019-11-28 00:24:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:13,069 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-11-28 00:24:13,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 00:24:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2019-11-28 00:24:13,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 00:24:13,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:13,072 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:13,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:13,284 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:13,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:13,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1301134080, now seen corresponding path program 2 times [2019-11-28 00:24:13,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:13,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869927979] [2019-11-28 00:24:13,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 00:24:13,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869927979] [2019-11-28 00:24:13,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116252727] [2019-11-28 00:24:13,511 INFO L92 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 [2019-11-28 00:24:13,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 00:24:13,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:13,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:24:13,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-28 00:24:13,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:13,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-11-28 00:24:13,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609326718] [2019-11-28 00:24:13,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 00:24:13,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:13,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 00:24:13,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2019-11-28 00:24:13,642 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 14 states. [2019-11-28 00:24:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:13,909 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2019-11-28 00:24:13,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 00:24:13,910 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-28 00:24:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:13,912 INFO L225 Difference]: With dead ends: 67 [2019-11-28 00:24:13,912 INFO L226 Difference]: Without dead ends: 34 [2019-11-28 00:24:13,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-28 00:24:13,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-28 00:24:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-28 00:24:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 00:24:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-11-28 00:24:13,922 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 36 [2019-11-28 00:24:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:13,923 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-11-28 00:24:13,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 00:24:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-11-28 00:24:13,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-28 00:24:13,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:13,926 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:14,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:14,129 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:14,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:14,130 INFO L82 PathProgramCache]: Analyzing trace with hash 300559544, now seen corresponding path program 3 times [2019-11-28 00:24:14,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:14,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765479457] [2019-11-28 00:24:14,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-11-28 00:24:14,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765479457] [2019-11-28 00:24:14,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260045283] [2019-11-28 00:24:14,427 INFO L92 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 [2019-11-28 00:24:14,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 00:24:14,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:14,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 00:24:14,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:14,518 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-28 00:24:14,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:14,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-11-28 00:24:14,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332714963] [2019-11-28 00:24:14,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 00:24:14,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:14,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 00:24:14,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-28 00:24:14,521 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 12 states. [2019-11-28 00:24:14,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:14,681 INFO L93 Difference]: Finished difference Result 76 states and 107 transitions. [2019-11-28 00:24:14,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 00:24:14,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-11-28 00:24:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:14,691 INFO L225 Difference]: With dead ends: 76 [2019-11-28 00:24:14,691 INFO L226 Difference]: Without dead ends: 72 [2019-11-28 00:24:14,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-11-28 00:24:14,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-28 00:24:14,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 66. [2019-11-28 00:24:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 00:24:14,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2019-11-28 00:24:14,708 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 64 [2019-11-28 00:24:14,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:14,710 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2019-11-28 00:24:14,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 00:24:14,710 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2019-11-28 00:24:14,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-28 00:24:14,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:14,718 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:14,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:14,923 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:14,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:14,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2106103662, now seen corresponding path program 4 times [2019-11-28 00:24:14,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:14,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841178966] [2019-11-28 00:24:14,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:24:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 309 proven. 340 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2019-11-28 00:24:15,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841178966] [2019-11-28 00:24:15,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391347627] [2019-11-28 00:24:15,677 INFO L92 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 [2019-11-28 00:24:15,783 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 00:24:15,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 00:24:15,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 00:24:15,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 00:24:15,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 276 proven. 112 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2019-11-28 00:24:15,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 00:24:15,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 24 [2019-11-28 00:24:15,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445761728] [2019-11-28 00:24:15,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 00:24:15,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:24:15,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 00:24:15,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-11-28 00:24:15,968 INFO L87 Difference]: Start difference. First operand 66 states and 94 transitions. Second operand 24 states. [2019-11-28 00:24:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:24:16,556 INFO L93 Difference]: Finished difference Result 139 states and 239 transitions. [2019-11-28 00:24:16,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 00:24:16,557 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 146 [2019-11-28 00:24:16,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:24:16,559 INFO L225 Difference]: With dead ends: 139 [2019-11-28 00:24:16,560 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 00:24:16,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 186 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=840, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 00:24:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 00:24:16,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2019-11-28 00:24:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 00:24:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-11-28 00:24:16,578 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 146 [2019-11-28 00:24:16,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:24:16,579 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-11-28 00:24:16,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 00:24:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-11-28 00:24:16,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 00:24:16,584 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:24:16,584 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2019-11-28 00:24:16,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 00:24:16,791 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:24:16,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:24:16,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1483723059, now seen corresponding path program 5 times [2019-11-28 00:24:16,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:24:16,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755917973] [2019-11-28 00:24:16,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:24:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:24:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:24:16,847 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:24:16,847 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:24:16,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:24:16 BoogieIcfgContainer [2019-11-28 00:24:16,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:24:16,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:24:16,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:24:16,901 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:24:16,901 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:24:11" (3/4) ... [2019-11-28 00:24:16,904 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:24:17,003 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:24:17,004 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:24:17,007 INFO L168 Benchmark]: Toolchain (without parser) took 6456.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 957.7 MB in the beginning and 931.0 MB in the end (delta: 26.6 MB). Peak memory consumption was 228.5 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:17,007 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:17,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.38 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:17,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.84 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:24:17,009 INFO L168 Benchmark]: Boogie Preprocessor took 77.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:17,009 INFO L168 Benchmark]: RCFGBuilder took 250.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:17,010 INFO L168 Benchmark]: TraceAbstraction took 5668.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 938.6 MB in the end (delta: 168.9 MB). Peak memory consumption was 240.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:17,011 INFO L168 Benchmark]: Witness Printer took 103.38 ms. Allocated memory is still 1.2 GB. Free memory was 938.6 MB in the beginning and 931.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:24:17,013 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 313.38 ms. Allocated memory is still 1.0 GB. Free memory was 957.7 MB in the beginning and 946.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.84 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -180.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 250.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5668.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 938.6 MB in the end (delta: 168.9 MB). Peak memory consumption was 240.2 MB. Max. memory is 11.5 GB. * Witness Printer took 103.38 ms. Allocated memory is still 1.2 GB. Free memory was 938.6 MB in the beginning and 931.0 MB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) [L29] int result = fibonacci(x); [L30] COND FALSE !(x != 5 || result == 3) [L33] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.4s, OverallIterations: 8, TraceHistogramMax: 21, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 118 SDtfs, 245 SDslu, 395 SDs, 0 SdLazy, 891 SolverSat, 267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 464 GetRequests, 377 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 706 NumberOfCodeBlocks, 661 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 104623 SizeOfPredicates, 19 NumberOfNonLiveVariables, 556 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 2220/2834 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...