./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c 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-simple/fibo_2calls_5-1.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 e6092b6e2bef07c2401a6d2b7c5ee309bc5dbc34 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:29:17,286 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:29:17,288 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:29:17,303 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:29:17,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:29:17,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:29:17,309 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:29:17,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:29:17,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:29:17,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:29:17,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:29:17,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:29:17,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:29:17,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:29:17,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:29:17,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:29:17,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:29:17,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:29:17,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:29:17,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:29:17,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:29:17,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:29:17,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:29:17,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:29:17,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:29:17,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:29:17,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:29:17,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:29:17,374 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:29:17,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:29:17,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:29:17,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:29:17,377 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:29:17,378 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:29:17,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:29:17,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:29:17,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:29:17,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:29:17,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:29:17,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:29:17,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:29:17,387 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:29:17,422 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:29:17,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:29:17,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:29:17,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:29:17,425 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:29:17,426 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:29:17,426 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:29:17,426 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:29:17,427 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:29:17,427 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:29:17,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:29:17,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:29:17,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:29:17,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:29:17,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:29:17,430 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:29:17,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:29:17,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:29:17,431 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:29:17,431 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:29:17,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:29:17,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:29:17,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:29:17,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:29:17,433 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:29:17,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:29:17,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:29:17,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:29:17,434 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:29:17,435 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 -> e6092b6e2bef07c2401a6d2b7c5ee309bc5dbc34 [2019-11-28 17:29:17,804 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:29:17,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:29:17,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:29:17,824 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:29:17,825 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:29:17,826 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2019-11-28 17:29:17,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f64fc3c29/be2f8157abb84e8892fee24b60487318/FLAGe3709eb20 [2019-11-28 17:29:18,298 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:29:18,299 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_2calls_5-1.c [2019-11-28 17:29:18,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f64fc3c29/be2f8157abb84e8892fee24b60487318/FLAGe3709eb20 [2019-11-28 17:29:18,718 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f64fc3c29/be2f8157abb84e8892fee24b60487318 [2019-11-28 17:29:18,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:29:18,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:29:18,726 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:18,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:29:18,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:29:18,731 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:29:18" (1/1) ... [2019-11-28 17:29:18,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f57c6e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:18, skipping insertion in model container [2019-11-28 17:29:18,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:29:18" (1/1) ... [2019-11-28 17:29:18,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:29:18,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:29:18,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:18,978 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:29:19,006 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:19,022 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:29:19,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:19 WrapperNode [2019-11-28 17:29:19,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:19,025 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:19,026 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:29:19,026 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:29:19,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:19" (1/1) ... [2019-11-28 17:29:19,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:19" (1/1) ... [2019-11-28 17:29:19,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:19,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:29:19,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:29:19,139 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:29:19,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:19" (1/1) ... [2019-11-28 17:29:19,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:19" (1/1) ... [2019-11-28 17:29:19,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:19" (1/1) ... [2019-11-28 17:29:19,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:19" (1/1) ... [2019-11-28 17:29:19,155 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:19" (1/1) ... [2019-11-28 17:29:19,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:19" (1/1) ... [2019-11-28 17:29:19,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:19" (1/1) ... [2019-11-28 17:29:19,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:29:19,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:29:19,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:29:19,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:29:19,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:19" (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 17:29:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:29:19,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:29:19,245 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-28 17:29:19,247 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-28 17:29:19,247 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-28 17:29:19,247 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-28 17:29:19,494 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:29:19,494 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:29:19,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:19 BoogieIcfgContainer [2019-11-28 17:29:19,497 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:29:19,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:29:19,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:29:19,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:29:19,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:29:18" (1/3) ... [2019-11-28 17:29:19,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a94707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:19, skipping insertion in model container [2019-11-28 17:29:19,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:19" (2/3) ... [2019-11-28 17:29:19,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a94707 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:19, skipping insertion in model container [2019-11-28 17:29:19,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:19" (3/3) ... [2019-11-28 17:29:19,514 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-1.c [2019-11-28 17:29:19,548 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:29:19,566 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:29:19,588 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:29:19,614 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:29:19,614 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:29:19,614 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:29:19,615 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:29:19,615 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:29:19,615 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:29:19,615 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:29:19,615 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:29:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-28 17:29:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:29:19,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:19,640 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:19,641 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:19,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:19,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-28 17:29:19,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:19,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956079967] [2019-11-28 17:29:19,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:19,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:19,851 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 17:29:19,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956079967] [2019-11-28 17:29:19,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:29:19,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:29:19,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669876124] [2019-11-28 17:29:19,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:29:19,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:19,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:29:19,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:29:19,875 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 5 states. [2019-11-28 17:29:19,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:19,992 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-28 17:29:19,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:29:19,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 17:29:19,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:20,004 INFO L225 Difference]: With dead ends: 38 [2019-11-28 17:29:20,004 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 17:29:20,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 17:29:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 17:29:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 17:29:20,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:29:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 17:29:20,046 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-28 17:29:20,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:20,047 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 17:29:20,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:29:20,047 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 17:29:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:29:20,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:20,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:20,049 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:20,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-28 17:29:20,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:20,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722887296] [2019-11-28 17:29:20,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:20,108 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 17:29:20,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722887296] [2019-11-28 17:29:20,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:29:20,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 17:29:20,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455742803] [2019-11-28 17:29:20,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:29:20,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:20,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:29:20,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:29:20,114 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2019-11-28 17:29:20,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:20,197 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-28 17:29:20,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:29:20,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 17:29:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:20,200 INFO L225 Difference]: With dead ends: 32 [2019-11-28 17:29:20,200 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 17:29:20,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 17:29:20,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 17:29:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-28 17:29:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:29:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-28 17:29:20,210 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-28 17:29:20,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:20,211 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-28 17:29:20,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:29:20,211 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-28 17:29:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:29:20,212 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:20,213 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:20,213 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:20,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:20,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-28 17:29:20,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:20,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141337446] [2019-11-28 17:29:20,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:20,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:29:20,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141337446] [2019-11-28 17:29:20,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902459567] [2019-11-28 17:29:20,403 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 17:29:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:20,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:29:20,461 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:29:20,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:20,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-28 17:29:20,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298536633] [2019-11-28 17:29:20,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:29:20,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:20,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:29:20,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:29:20,556 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 10 states. [2019-11-28 17:29:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:20,749 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-28 17:29:20,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:29:20,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 17:29:20,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:20,753 INFO L225 Difference]: With dead ends: 59 [2019-11-28 17:29:20,753 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 17:29:20,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:29:20,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 17:29:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-28 17:29:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-28 17:29:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-28 17:29:20,766 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-28 17:29:20,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:20,767 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-28 17:29:20,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:29:20,767 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-28 17:29:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 17:29:20,769 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:20,769 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:20,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:20,976 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:20,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:20,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-28 17:29:20,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:20,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260022375] [2019-11-28 17:29:20,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:21,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:29:21,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260022375] [2019-11-28 17:29:21,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693500162] [2019-11-28 17:29:21,141 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 17:29:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:21,173 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:29:21,175 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 17:29:21,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:21,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-28 17:29:21,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282141865] [2019-11-28 17:29:21,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:29:21,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:21,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:29:21,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:29:21,218 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 10 states. [2019-11-28 17:29:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:21,430 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-28 17:29:21,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:29:21,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-11-28 17:29:21,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:21,434 INFO L225 Difference]: With dead ends: 55 [2019-11-28 17:29:21,435 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 17:29:21,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:29:21,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 17:29:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-28 17:29:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 17:29:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-28 17:29:21,450 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-28 17:29:21,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:21,451 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-28 17:29:21,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:29:21,451 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-28 17:29:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-28 17:29:21,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:21,454 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:21,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:21,658 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:21,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:21,659 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-28 17:29:21,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:21,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980423545] [2019-11-28 17:29:21,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:21,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 17:29:21,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980423545] [2019-11-28 17:29:21,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502649871] [2019-11-28 17:29:21,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 17:29:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:21,879 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:21,883 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 17:29:21,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:21,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2019-11-28 17:29:21,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936580918] [2019-11-28 17:29:21,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:29:21,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:21,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:29:21,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:29:21,958 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 12 states. [2019-11-28 17:29:22,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:22,345 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-28 17:29:22,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 17:29:22,346 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-11-28 17:29:22,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:22,354 INFO L225 Difference]: With dead ends: 114 [2019-11-28 17:29:22,354 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 17:29:22,356 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2019-11-28 17:29:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 17:29:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-28 17:29:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:29:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-28 17:29:22,386 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-28 17:29:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:22,387 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-28 17:29:22,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:29:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-28 17:29:22,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 17:29:22,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:22,390 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:22,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:22,596 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:22,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-28 17:29:22,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:22,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238185898] [2019-11-28 17:29:22,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 17:29:22,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238185898] [2019-11-28 17:29:22,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997331484] [2019-11-28 17:29:22,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 17:29:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:22,796 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:22,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-28 17:29:22,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:22,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 12 [2019-11-28 17:29:22,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681857262] [2019-11-28 17:29:22,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:29:22,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:22,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:29:22,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:29:22,885 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 12 states. [2019-11-28 17:29:23,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:23,168 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-28 17:29:23,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:29:23,170 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 36 [2019-11-28 17:29:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:23,172 INFO L225 Difference]: With dead ends: 147 [2019-11-28 17:29:23,172 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 17:29:23,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2019-11-28 17:29:23,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 17:29:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-28 17:29:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 17:29:23,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-28 17:29:23,198 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-28 17:29:23,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:23,199 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-28 17:29:23,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:29:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-28 17:29:23,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 17:29:23,208 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:23,209 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:23,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:23,414 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:23,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:23,415 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-28 17:29:23,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:23,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515114667] [2019-11-28 17:29:23,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,684 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 17:29:23,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515114667] [2019-11-28 17:29:23,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935876715] [2019-11-28 17:29:23,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 17:29:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:23,751 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:23,754 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:23,847 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 17:29:23,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:23,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2019-11-28 17:29:23,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678507109] [2019-11-28 17:29:23,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 17:29:23,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:23,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 17:29:23,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:29:23,850 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 16 states. [2019-11-28 17:29:24,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:24,491 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-28 17:29:24,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 17:29:24,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2019-11-28 17:29:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:24,494 INFO L225 Difference]: With dead ends: 164 [2019-11-28 17:29:24,495 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 17:29:24,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:29:24,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 17:29:24,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-28 17:29:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 17:29:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-28 17:29:24,514 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-28 17:29:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:24,515 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-28 17:29:24,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 17:29:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-28 17:29:24,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-28 17:29:24,519 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:24,519 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:24,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:24,723 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:24,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:24,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-11-28 17:29:24,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:24,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497293455] [2019-11-28 17:29:24,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-28 17:29:25,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497293455] [2019-11-28 17:29:25,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1766461707] [2019-11-28 17:29:25,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2019-11-28 17:29:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:25,094 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:25,099 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 23 proven. 65 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-11-28 17:29:25,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:25,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2019-11-28 17:29:25,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81500484] [2019-11-28 17:29:25,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 17:29:25,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:25,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 17:29:25,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-11-28 17:29:25,213 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 17 states. [2019-11-28 17:29:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:25,713 INFO L93 Difference]: Finished difference Result 222 states and 415 transitions. [2019-11-28 17:29:25,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 17:29:25,713 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 91 [2019-11-28 17:29:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:25,716 INFO L225 Difference]: With dead ends: 222 [2019-11-28 17:29:25,717 INFO L226 Difference]: Without dead ends: 138 [2019-11-28 17:29:25,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-11-28 17:29:25,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-11-28 17:29:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2019-11-28 17:29:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-28 17:29:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2019-11-28 17:29:25,749 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 91 [2019-11-28 17:29:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:25,750 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2019-11-28 17:29:25,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 17:29:25,752 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2019-11-28 17:29:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-28 17:29:25,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:25,758 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 8, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:25,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:25,959 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:25,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:25,960 INFO L82 PathProgramCache]: Analyzing trace with hash -590215841, now seen corresponding path program 2 times [2019-11-28 17:29:25,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:25,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711933570] [2019-11-28 17:29:25,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 100 proven. 152 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2019-11-28 17:29:26,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711933570] [2019-11-28 17:29:26,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951222936] [2019-11-28 17:29:26,501 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:26,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:29:26,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:26,582 INFO L264 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 17:29:26,595 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 81 proven. 83 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-11-28 17:29:26,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:26,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 26 [2019-11-28 17:29:26,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35320665] [2019-11-28 17:29:26,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 17:29:26,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:26,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 17:29:26,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2019-11-28 17:29:26,748 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 26 states. [2019-11-28 17:29:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:27,656 INFO L93 Difference]: Finished difference Result 285 states and 569 transitions. [2019-11-28 17:29:27,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-28 17:29:27,657 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 132 [2019-11-28 17:29:27,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:27,659 INFO L225 Difference]: With dead ends: 285 [2019-11-28 17:29:27,659 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 17:29:27,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=244, Invalid=1478, Unknown=0, NotChecked=0, Total=1722 [2019-11-28 17:29:27,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 17:29:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2019-11-28 17:29:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 17:29:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2019-11-28 17:29:27,676 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 132 [2019-11-28 17:29:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:27,676 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2019-11-28 17:29:27,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 17:29:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2019-11-28 17:29:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-28 17:29:27,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:27,679 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:27,883 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:27,883 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:27,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:27,884 INFO L82 PathProgramCache]: Analyzing trace with hash 350372983, now seen corresponding path program 3 times [2019-11-28 17:29:27,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:27,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385148182] [2019-11-28 17:29:27,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:27,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 105 proven. 103 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-11-28 17:29:28,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385148182] [2019-11-28 17:29:28,248 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854880450] [2019-11-28 17:29:28,249 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:28,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-28 17:29:28,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:28,293 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:28,296 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 139 proven. 18 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-11-28 17:29:28,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:28,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10] total 23 [2019-11-28 17:29:28,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293612372] [2019-11-28 17:29:28,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 17:29:28,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:28,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 17:29:28,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2019-11-28 17:29:28,383 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand 23 states. [2019-11-28 17:29:29,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:29,035 INFO L93 Difference]: Finished difference Result 176 states and 247 transitions. [2019-11-28 17:29:29,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 17:29:29,036 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 119 [2019-11-28 17:29:29,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:29,038 INFO L225 Difference]: With dead ends: 176 [2019-11-28 17:29:29,038 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 17:29:29,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=1057, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 17:29:29,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 17:29:29,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2019-11-28 17:29:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 17:29:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2019-11-28 17:29:29,052 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 119 [2019-11-28 17:29:29,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:29,053 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2019-11-28 17:29:29,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 17:29:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2019-11-28 17:29:29,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-28 17:29:29,055 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:29,055 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:29,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:29,269 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:29,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1882786525, now seen corresponding path program 4 times [2019-11-28 17:29:29,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:29,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257684098] [2019-11-28 17:29:29,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 60 proven. 49 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-28 17:29:29,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257684098] [2019-11-28 17:29:29,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876337736] [2019-11-28 17:29:29,603 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:29,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:29:29,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:29,655 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:29,663 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-11-28 17:29:29,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:29,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 19 [2019-11-28 17:29:29,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724633422] [2019-11-28 17:29:29,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 17:29:29,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:29,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 17:29:29,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:29:29,715 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 19 states. [2019-11-28 17:29:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:30,037 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2019-11-28 17:29:30,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 17:29:30,037 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2019-11-28 17:29:30,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:30,039 INFO L225 Difference]: With dead ends: 103 [2019-11-28 17:29:30,039 INFO L226 Difference]: Without dead ends: 92 [2019-11-28 17:29:30,041 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:29:30,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-28 17:29:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2019-11-28 17:29:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-28 17:29:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 102 transitions. [2019-11-28 17:29:30,053 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 102 transitions. Word has length 91 [2019-11-28 17:29:30,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:30,056 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 102 transitions. [2019-11-28 17:29:30,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 17:29:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 102 transitions. [2019-11-28 17:29:30,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 17:29:30,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:30,057 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:30,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:30,261 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:30,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:30,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1335172610, now seen corresponding path program 5 times [2019-11-28 17:29:30,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:30,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952848402] [2019-11-28 17:29:30,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:30,901 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-11-28 17:29:30,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952848402] [2019-11-28 17:29:30,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964865700] [2019-11-28 17:29:30,901 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:30,958 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 17:29:30,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:30,960 INFO L264 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-28 17:29:30,963 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-11-28 17:29:31,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:31,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 28 [2019-11-28 17:29:31,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264477084] [2019-11-28 17:29:31,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 17:29:31,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:31,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 17:29:31,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-11-28 17:29:31,370 INFO L87 Difference]: Start difference. First operand 87 states and 102 transitions. Second operand 28 states. [2019-11-28 17:29:31,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:31,672 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2019-11-28 17:29:31,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 17:29:31,672 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 105 [2019-11-28 17:29:31,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:31,674 INFO L225 Difference]: With dead ends: 100 [2019-11-28 17:29:31,674 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 17:29:31,675 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 133 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-11-28 17:29:31,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 17:29:31,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-11-28 17:29:31,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-28 17:29:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 105 transitions. [2019-11-28 17:29:31,682 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 105 transitions. Word has length 105 [2019-11-28 17:29:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:31,683 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 105 transitions. [2019-11-28 17:29:31,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 17:29:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 105 transitions. [2019-11-28 17:29:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 17:29:31,684 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:31,684 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:31,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:31,888 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:31,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1449179333, now seen corresponding path program 6 times [2019-11-28 17:29:31,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:31,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797912738] [2019-11-28 17:29:31,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:31,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 71 proven. 6 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-11-28 17:29:32,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797912738] [2019-11-28 17:29:32,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556352719] [2019-11-28 17:29:32,032 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:32,078 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-28 17:29:32,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:32,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 17:29:32,081 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:32,132 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-11-28 17:29:32,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:29:32,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2019-11-28 17:29:32,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906365319] [2019-11-28 17:29:32,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:29:32,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:32,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:29:32,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:29:32,135 INFO L87 Difference]: Start difference. First operand 89 states and 105 transitions. Second operand 6 states. [2019-11-28 17:29:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:32,198 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2019-11-28 17:29:32,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:29:32,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-11-28 17:29:32,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:32,199 INFO L225 Difference]: With dead ends: 101 [2019-11-28 17:29:32,199 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 17:29:32,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:29:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 17:29:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 17:29:32,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 17:29:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 17:29:32,202 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2019-11-28 17:29:32,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:32,202 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 17:29:32,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:29:32,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 17:29:32,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 17:29:32,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:32,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 17:29:32,988 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 25 [2019-11-28 17:29:33,229 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 22 [2019-11-28 17:29:33,233 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 17:29:33,233 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 17:29:33,234 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 17:29:33,234 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2019-11-28 17:29:33,234 INFO L242 CegarLoopResult]: At program point L41(lines 35 42) the Hoare annotation is: (<= 5 ULTIMATE.start_main_~x~0) [2019-11-28 17:29:33,234 INFO L246 CegarLoopResult]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-28 17:29:33,234 INFO L246 CegarLoopResult]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-11-28 17:29:33,234 INFO L242 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 5 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 5)) [2019-11-28 17:29:33,235 INFO L246 CegarLoopResult]: For program point L37-1(line 37) no Hoare annotation was computed. [2019-11-28 17:29:33,235 INFO L246 CegarLoopResult]: For program point L38-2(lines 38 40) no Hoare annotation was computed. [2019-11-28 17:29:33,235 INFO L249 CegarLoopResult]: At program point fibo2ENTRY(lines 17 25) the Hoare annotation is: true [2019-11-28 17:29:33,235 INFO L242 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= fibo2_~n |fibo2_#in~n|) (not (<= |fibo2_#in~n| 2))) [2019-11-28 17:29:33,235 INFO L246 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-11-28 17:29:33,236 INFO L242 CegarLoopResult]: At program point L23-2(line 23) the Hoare annotation is: (and (or (and (<= 1 |fibo2_#t~ret2|) (<= |fibo2_#t~ret2| 1)) (<= 4 fibo2_~n)) (let ((.cse0 (= fibo2_~n |fibo2_#in~n|))) (or (and (<= |fibo2_#in~n| 3) .cse0) (and (<= |fibo2_#t~ret2| 2) .cse0 (<= 2 |fibo2_#t~ret2|)) (and (<= 5 |fibo2_#in~n|) .cse0))) (not (<= |fibo2_#in~n| 2))) [2019-11-28 17:29:33,236 INFO L246 CegarLoopResult]: For program point L20(lines 20 24) no Hoare annotation was computed. [2019-11-28 17:29:33,236 INFO L246 CegarLoopResult]: For program point L23-3(line 23) no Hoare annotation was computed. [2019-11-28 17:29:33,236 INFO L246 CegarLoopResult]: For program point L18(lines 18 24) no Hoare annotation was computed. [2019-11-28 17:29:33,236 INFO L246 CegarLoopResult]: For program point fibo2FINAL(lines 17 25) no Hoare annotation was computed. [2019-11-28 17:29:33,236 INFO L246 CegarLoopResult]: For program point fibo2EXIT(lines 17 25) no Hoare annotation was computed. [2019-11-28 17:29:33,236 INFO L249 CegarLoopResult]: At program point fibo1ENTRY(lines 7 15) the Hoare annotation is: true [2019-11-28 17:29:33,237 INFO L242 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (not (<= |fibo1_#in~n| 1)) (= fibo1_~n |fibo1_#in~n|)) [2019-11-28 17:29:33,237 INFO L246 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2019-11-28 17:29:33,237 INFO L242 CegarLoopResult]: At program point L13-2(line 13) the Hoare annotation is: (and (let ((.cse0 (= fibo1_~n |fibo1_#in~n|))) (or (and (<= 4 fibo1_~n) .cse0) (and (<= 1 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 1) .cse0))) (< 1 fibo1_~n) (or (<= 6 |fibo1_#in~n|) (and (<= 3 |fibo1_#t~ret0|) (<= |fibo1_#t~ret0| 3)) (<= |fibo1_#in~n| 4))) [2019-11-28 17:29:33,237 INFO L246 CegarLoopResult]: For program point fibo1FINAL(lines 7 15) no Hoare annotation was computed. [2019-11-28 17:29:33,237 INFO L246 CegarLoopResult]: For program point L10(lines 10 14) no Hoare annotation was computed. [2019-11-28 17:29:33,237 INFO L246 CegarLoopResult]: For program point L13-3(line 13) no Hoare annotation was computed. [2019-11-28 17:29:33,237 INFO L246 CegarLoopResult]: For program point L8(lines 8 14) no Hoare annotation was computed. [2019-11-28 17:29:33,237 INFO L246 CegarLoopResult]: For program point fibo1EXIT(lines 7 15) no Hoare annotation was computed. [2019-11-28 17:29:33,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:29:33 BoogieIcfgContainer [2019-11-28 17:29:33,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:29:33,253 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:29:33,253 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:29:33,254 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:29:33,254 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:19" (3/4) ... [2019-11-28 17:29:33,257 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 17:29:33,264 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo2 [2019-11-28 17:29:33,264 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo1 [2019-11-28 17:29:33,269 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 17:29:33,270 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 17:29:33,323 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:29:33,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:29:33,326 INFO L168 Benchmark]: Toolchain (without parser) took 14601.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 349.7 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 160.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:33,326 INFO L168 Benchmark]: CDTParser took 0.30 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 17:29:33,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 299.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 17:29:33,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:33,328 INFO L168 Benchmark]: Boogie Preprocessor took 31.16 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:33,329 INFO L168 Benchmark]: RCFGBuilder took 327.28 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: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:33,330 INFO L168 Benchmark]: TraceAbstraction took 13752.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 228.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.8 MB). Peak memory consumption was 168.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:33,331 INFO L168 Benchmark]: Witness Printer took 70.56 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:29:33,335 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.30 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 299.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 112.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -170.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.16 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 327.28 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: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13752.85 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 228.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -59.8 MB). Peak memory consumption was 168.8 MB. Max. memory is 11.5 GB. * Witness Printer took 70.56 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 5 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: SAFE, OverallTime: 12.7s, OverallIterations: 13, TraceHistogramMax: 10, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, HoareTripleCheckerStatistics: 350 SDtfs, 544 SDslu, 2847 SDs, 0 SdLazy, 3680 SolverSat, 541 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1266 GetRequests, 1021 SyntacticMatches, 10 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred 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, 13 MinimizatonAttempts, 94 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 368 PreInvPairs, 511 NumberOfFragments, 105 HoareAnnotationTreeSize, 368 FomulaSimplifications, 1916 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3623 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1635 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 1611 ConstructedInterpolants, 0 QuantifiedInterpolants, 319341 SizeOfPredicates, 41 NumberOfNonLiveVariables, 1595 ConjunctsInSsa, 145 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 2724/3528 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 correct! Received shutdown request...