./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i20_o20-2.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/id_i20_o20-2.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 7d05936c4bb1bb97a4b24ebc11d02c0e844c743b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:29:53,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:29:53,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:29:53,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:29:53,669 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:29:53,671 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:29:53,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:29:53,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:29:53,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:29:53,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:29:53,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:29:53,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:29:53,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:29:53,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:29:53,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:29:53,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:29:53,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:29:53,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:29:53,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:29:53,711 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:29:53,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:29:53,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:29:53,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:29:53,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:29:53,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:29:53,725 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:29:53,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:29:53,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:29:53,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:29:53,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:29:53,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:29:53,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:29:53,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:29:53,733 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:29:53,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:29:53,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:29:53,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:29:53,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:29:53,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:29:53,738 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:29:53,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:29:53,741 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:53,761 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:29:53,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:29:53,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:29:53,764 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:29:53,764 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:29:53,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:29:53,765 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:29:53,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:29:53,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:29:53,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:29:53,767 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:29:53,767 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:29:53,767 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:29:53,768 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:29:53,768 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:29:53,768 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:29:53,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:29:53,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:29:53,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:29:53,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:29:53,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:29:53,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:29:53,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:29:53,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:29:53,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:29:53,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:29:53,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:29:53,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:29:53,772 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:29:53,772 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 -> 7d05936c4bb1bb97a4b24ebc11d02c0e844c743b [2019-11-28 17:29:54,075 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:29:54,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:29:54,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:29:54,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:29:54,104 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:29:54,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2019-11-28 17:29:54,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/205c72ac2/2d0689dde2cc46eb9780ba7dba37c272/FLAGd23f37077 [2019-11-28 17:29:54,633 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:29:54,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i20_o20-2.c [2019-11-28 17:29:54,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/205c72ac2/2d0689dde2cc46eb9780ba7dba37c272/FLAGd23f37077 [2019-11-28 17:29:55,002 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/205c72ac2/2d0689dde2cc46eb9780ba7dba37c272 [2019-11-28 17:29:55,005 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:29:55,007 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:29:55,008 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:55,008 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:29:55,012 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:29:55,013 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:29:55" (1/1) ... [2019-11-28 17:29:55,017 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53929663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:55, skipping insertion in model container [2019-11-28 17:29:55,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:29:55" (1/1) ... [2019-11-28 17:29:55,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:29:55,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:29:55,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:55,206 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:29:55,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:55,233 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:29:55,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:55 WrapperNode [2019-11-28 17:29:55,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:55,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:55,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:29:55,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:29:55,244 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:55" (1/1) ... [2019-11-28 17:29:55,249 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:55" (1/1) ... [2019-11-28 17:29:55,267 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:55,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:29:55,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:29:55,268 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:29:55,336 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:55" (1/1) ... [2019-11-28 17:29:55,336 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:55" (1/1) ... [2019-11-28 17:29:55,337 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:55" (1/1) ... [2019-11-28 17:29:55,337 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:55" (1/1) ... [2019-11-28 17:29:55,339 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:55" (1/1) ... [2019-11-28 17:29:55,343 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:55" (1/1) ... [2019-11-28 17:29:55,344 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:55" (1/1) ... [2019-11-28 17:29:55,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:29:55,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:29:55,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:29:55,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:29:55,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:55" (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:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:29:55,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:29:55,405 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-11-28 17:29:55,406 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-11-28 17:29:55,561 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:29:55,562 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:29:55,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:55 BoogieIcfgContainer [2019-11-28 17:29:55,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:29:55,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:29:55,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:29:55,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:29:55,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:29:55" (1/3) ... [2019-11-28 17:29:55,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eff48c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:55, skipping insertion in model container [2019-11-28 17:29:55,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:55" (2/3) ... [2019-11-28 17:29:55,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eff48c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:55, skipping insertion in model container [2019-11-28 17:29:55,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:55" (3/3) ... [2019-11-28 17:29:55,570 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i20_o20-2.c [2019-11-28 17:29:55,581 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:29:55,587 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:29:55,599 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:29:55,627 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:29:55,627 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:29:55,627 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:29:55,627 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:29:55,628 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:29:55,628 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:29:55,628 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:29:55,628 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:29:55,648 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-28 17:29:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:29:55,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:55,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:55,656 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:55,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:55,664 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-11-28 17:29:55,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:55,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143970670] [2019-11-28 17:29:55,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:56,067 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:56,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143970670] [2019-11-28 17:29:56,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:29:56,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:29:56,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511231229] [2019-11-28 17:29:56,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:29:56,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:56,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:29:56,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:29:56,093 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-28 17:29:56,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:56,225 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-28 17:29:56,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:29:56,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-28 17:29:56,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:56,238 INFO L225 Difference]: With dead ends: 24 [2019-11-28 17:29:56,238 INFO L226 Difference]: Without dead ends: 14 [2019-11-28 17:29:56,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:29:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-28 17:29:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 17:29:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 17:29:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-28 17:29:56,288 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-28 17:29:56,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:56,289 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-28 17:29:56,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:29:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-28 17:29:56,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:29:56,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:56,293 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:56,294 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:56,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:56,294 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-11-28 17:29:56,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:56,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540622128] [2019-11-28 17:29:56,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:56,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:29:56,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540622128] [2019-11-28 17:29:56,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545877298] [2019-11-28 17:29:56,459 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:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:56,499 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:29:56,505 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 17:29:56,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:56,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2019-11-28 17:29:56,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346056562] [2019-11-28 17:29:56,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:29:56,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:56,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:29:56,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:29:56,618 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 10 states. [2019-11-28 17:29:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:56,710 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-28 17:29:56,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:29:56,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-28 17:29:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:56,712 INFO L225 Difference]: With dead ends: 21 [2019-11-28 17:29:56,712 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 17:29:56,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:29:56,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 17:29:56,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 17:29:56,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 17:29:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 17:29:56,722 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-11-28 17:29:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:56,722 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 17:29:56,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:29:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-28 17:29:56,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:29:56,726 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:56,726 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:56,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:56,934 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:56,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-11-28 17:29:56,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:56,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885683208] [2019-11-28 17:29:56,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 17:29:57,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885683208] [2019-11-28 17:29:57,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642353297] [2019-11-28 17:29:57,130 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 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:57,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:29:57,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:57,165 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:57,167 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 17:29:57,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:57,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2019-11-28 17:29:57,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850542432] [2019-11-28 17:29:57,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 17:29:57,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:57,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 17:29:57,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:29:57,212 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2019-11-28 17:29:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:57,323 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-28 17:29:57,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:29:57,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-28 17:29:57,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:57,325 INFO L225 Difference]: With dead ends: 24 [2019-11-28 17:29:57,326 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 17:29:57,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:29:57,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 17:29:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 17:29:57,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 17:29:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-28 17:29:57,336 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-11-28 17:29:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:57,337 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-28 17:29:57,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 17:29:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-28 17:29:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 17:29:57,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:57,339 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:57,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:57,543 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:57,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:57,543 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-11-28 17:29:57,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:57,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883408451] [2019-11-28 17:29:57,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,761 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 17:29:57,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883408451] [2019-11-28 17:29:57,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888858835] [2019-11-28 17:29:57,763 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 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:57,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 17:29:57,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:57,810 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:57,812 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:57,867 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 17:29:57,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:57,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-11-28 17:29:57,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091147471] [2019-11-28 17:29:57,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:29:57,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:57,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:29:57,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:29:57,871 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 12 states. [2019-11-28 17:29:57,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:57,999 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 17:29:58,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:29:58,000 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-28 17:29:58,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:58,001 INFO L225 Difference]: With dead ends: 27 [2019-11-28 17:29:58,002 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 17:29:58,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:29:58,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 17:29:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 17:29:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 17:29:58,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 17:29:58,018 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-11-28 17:29:58,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:58,020 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 17:29:58,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:29:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-28 17:29:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 17:29:58,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:58,022 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:58,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:58,224 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:58,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:58,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-11-28 17:29:58,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:58,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875745487] [2019-11-28 17:29:58,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 17:29:58,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875745487] [2019-11-28 17:29:58,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760807244] [2019-11-28 17:29:58,438 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 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:58,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:29:58,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:58,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 17:29:58,479 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:58,525 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-28 17:29:58,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:58,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-28 17:29:58,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302168672] [2019-11-28 17:29:58,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 17:29:58,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 17:29:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:29:58,528 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 13 states. [2019-11-28 17:29:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:58,638 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 17:29:58,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:29:58,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-11-28 17:29:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:58,640 INFO L225 Difference]: With dead ends: 30 [2019-11-28 17:29:58,640 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 17:29:58,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-11-28 17:29:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 17:29:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 17:29:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:29:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 17:29:58,655 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-11-28 17:29:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:58,655 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 17:29:58,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 17:29:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-28 17:29:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:29:58,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:58,660 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:58,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:58,865 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:58,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:58,866 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-11-28 17:29:58,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:58,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950262342] [2019-11-28 17:29:58,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,130 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 17:29:59,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950262342] [2019-11-28 17:29:59,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816061250] [2019-11-28 17:29:59,132 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 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:59,168 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 17:29:59,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:59,170 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 17:29:59,173 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-28 17:29:59,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:59,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2019-11-28 17:29:59,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683599221] [2019-11-28 17:29:59,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:29:59,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:59,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:29:59,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:29:59,215 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 14 states. [2019-11-28 17:29:59,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:59,333 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-28 17:29:59,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 17:29:59,334 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-11-28 17:29:59,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:59,335 INFO L225 Difference]: With dead ends: 33 [2019-11-28 17:29:59,335 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 17:29:59,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2019-11-28 17:29:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 17:29:59,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 17:29:59,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 17:29:59,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-28 17:29:59,343 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-11-28 17:29:59,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:59,343 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-28 17:29:59,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:29:59,344 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-28 17:29:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 17:29:59,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:59,345 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:59,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:59,551 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:59,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:59,552 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-11-28 17:29:59,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:59,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737682508] [2019-11-28 17:29:59,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 17:29:59,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737682508] [2019-11-28 17:29:59,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470373188] [2019-11-28 17:29:59,831 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 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:59,880 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 17:29:59,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:59,881 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 17:29:59,884 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 17:30:00,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:00,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 28 [2019-11-28 17:30:00,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493259883] [2019-11-28 17:30:00,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 17:30:00,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:00,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 17:30:00,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2019-11-28 17:30:00,150 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 28 states. [2019-11-28 17:30:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:00,471 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-28 17:30:00,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 17:30:00,472 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-28 17:30:00,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:00,473 INFO L225 Difference]: With dead ends: 36 [2019-11-28 17:30:00,473 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 17:30:00,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=285, Invalid=1355, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 17:30:00,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 17:30:00,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-28 17:30:00,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 17:30:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-28 17:30:00,484 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-11-28 17:30:00,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:00,485 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-28 17:30:00,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 17:30:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-28 17:30:00,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 17:30:00,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:00,487 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:00,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:00,688 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:00,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:00,689 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-11-28 17:30:00,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:00,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765842874] [2019-11-28 17:30:00,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 17:30:00,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765842874] [2019-11-28 17:30:00,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483008313] [2019-11-28 17:30:00,926 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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:30:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 17:30:00,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-28 17:30:01,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:01,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2019-11-28 17:30:01,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922055221] [2019-11-28 17:30:01,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 17:30:01,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:01,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 17:30:01,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:30:01,033 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 16 states. [2019-11-28 17:30:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:01,193 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-28 17:30:01,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 17:30:01,194 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-11-28 17:30:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:01,195 INFO L225 Difference]: With dead ends: 39 [2019-11-28 17:30:01,195 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 17:30:01,198 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=389, Unknown=0, NotChecked=0, Total=552 [2019-11-28 17:30:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 17:30:01,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 17:30:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 17:30:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-28 17:30:01,209 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-11-28 17:30:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:01,210 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-28 17:30:01,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 17:30:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-28 17:30:01,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 17:30:01,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:01,214 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:01,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:01,427 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:01,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:01,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-11-28 17:30:01,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:01,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983651364] [2019-11-28 17:30:01,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 17:30:01,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983651364] [2019-11-28 17:30:01,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018375961] [2019-11-28 17:30:01,714 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 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:30:01,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:30:01,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:01,770 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 17:30:01,784 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-11-28 17:30:01,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:01,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2019-11-28 17:30:01,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215068595] [2019-11-28 17:30:01,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 17:30:01,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:01,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 17:30:01,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-28 17:30:01,875 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 17 states. [2019-11-28 17:30:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:02,032 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-28 17:30:02,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:30:02,033 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2019-11-28 17:30:02,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:02,034 INFO L225 Difference]: With dead ends: 42 [2019-11-28 17:30:02,034 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 17:30:02,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=455, Unknown=0, NotChecked=0, Total=650 [2019-11-28 17:30:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 17:30:02,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 17:30:02,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 17:30:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-28 17:30:02,041 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-11-28 17:30:02,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:02,042 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-28 17:30:02,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 17:30:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-28 17:30:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 17:30:02,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:02,043 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:02,248 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:02,249 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:02,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:02,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-11-28 17:30:02,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:02,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551643855] [2019-11-28 17:30:02,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-28 17:30:02,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551643855] [2019-11-28 17:30:02,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454781784] [2019-11-28 17:30:02,594 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 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:30:02,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 17:30:02,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:02,641 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 17:30:02,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:03,045 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-28 17:30:03,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:03,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 37 [2019-11-28 17:30:03,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696698009] [2019-11-28 17:30:03,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-28 17:30:03,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:03,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-28 17:30:03,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 17:30:03,049 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 37 states. [2019-11-28 17:30:03,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:03,558 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-28 17:30:03,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 17:30:03,559 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 63 [2019-11-28 17:30:03,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:03,560 INFO L225 Difference]: With dead ends: 45 [2019-11-28 17:30:03,561 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 17:30:03,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=537, Invalid=2543, Unknown=0, NotChecked=0, Total=3080 [2019-11-28 17:30:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 17:30:03,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 17:30:03,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 17:30:03,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-28 17:30:03,569 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-11-28 17:30:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:03,569 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-28 17:30:03,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-28 17:30:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-28 17:30:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 17:30:03,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:03,571 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:03,774 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:03,775 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:03,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:03,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-11-28 17:30:03,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:03,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402775724] [2019-11-28 17:30:03,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-28 17:30:04,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402775724] [2019-11-28 17:30:04,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258394750] [2019-11-28 17:30:04,091 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 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:30:04,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:30:04,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:04,150 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 17:30:04,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-11-28 17:30:04,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:04,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 19 [2019-11-28 17:30:04,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156652462] [2019-11-28 17:30:04,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 17:30:04,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:04,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 17:30:04,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:30:04,233 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 19 states. [2019-11-28 17:30:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:04,400 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-28 17:30:04,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 17:30:04,401 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2019-11-28 17:30:04,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:04,403 INFO L225 Difference]: With dead ends: 48 [2019-11-28 17:30:04,403 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 17:30:04,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=268, Invalid=602, Unknown=0, NotChecked=0, Total=870 [2019-11-28 17:30:04,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 17:30:04,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-28 17:30:04,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 17:30:04,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-28 17:30:04,411 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-11-28 17:30:04,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:04,411 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-28 17:30:04,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 17:30:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-28 17:30:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 17:30:04,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:04,413 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:04,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:04,625 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:04,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:04,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-11-28 17:30:04,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:04,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151858930] [2019-11-28 17:30:04,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:04,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,959 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-28 17:30:04,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151858930] [2019-11-28 17:30:04,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522125916] [2019-11-28 17:30:04,960 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 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:30:05,011 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-28 17:30:05,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:05,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 17:30:05,016 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-11-28 17:30:05,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:05,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 20 [2019-11-28 17:30:05,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405434695] [2019-11-28 17:30:05,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 17:30:05,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:05,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 17:30:05,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-28 17:30:05,085 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 20 states. [2019-11-28 17:30:05,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:05,295 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-11-28 17:30:05,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 17:30:05,295 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2019-11-28 17:30:05,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:05,297 INFO L225 Difference]: With dead ends: 51 [2019-11-28 17:30:05,297 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 17:30:05,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=309, Invalid=683, Unknown=0, NotChecked=0, Total=992 [2019-11-28 17:30:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 17:30:05,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 17:30:05,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 17:30:05,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-11-28 17:30:05,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-11-28 17:30:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:05,306 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-11-28 17:30:05,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 17:30:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-11-28 17:30:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 17:30:05,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:05,308 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:05,520 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:05,520 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:05,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:05,521 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-11-28 17:30:05,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:05,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188689362] [2019-11-28 17:30:05,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-28 17:30:06,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188689362] [2019-11-28 17:30:06,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1567946865] [2019-11-28 17:30:06,097 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:06,157 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-28 17:30:06,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:06,159 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 17:30:06,163 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-11-28 17:30:06,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:06,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2019-11-28 17:30:06,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793780132] [2019-11-28 17:30:06,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 17:30:06,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:06,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 17:30:06,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-11-28 17:30:06,232 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 21 states. [2019-11-28 17:30:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:06,432 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 17:30:06,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 17:30:06,432 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2019-11-28 17:30:06,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:06,433 INFO L225 Difference]: With dead ends: 54 [2019-11-28 17:30:06,433 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 17:30:06,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=353, Invalid=769, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 17:30:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 17:30:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 17:30:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 17:30:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-28 17:30:06,448 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-11-28 17:30:06,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:06,449 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-28 17:30:06,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 17:30:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-28 17:30:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 17:30:06,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:06,453 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:06,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:06,657 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:06,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:06,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-11-28 17:30:06,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:06,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592425226] [2019-11-28 17:30:06,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-28 17:30:07,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592425226] [2019-11-28 17:30:07,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2050154441] [2019-11-28 17:30:07,149 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,205 INFO L264 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 17:30:07,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-11-28 17:30:07,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:07,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 22 [2019-11-28 17:30:07,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582696427] [2019-11-28 17:30:07,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 17:30:07,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:07,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 17:30:07,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:30:07,291 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 22 states. [2019-11-28 17:30:07,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:07,546 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-28 17:30:07,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 17:30:07,547 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-11-28 17:30:07,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:07,548 INFO L225 Difference]: With dead ends: 57 [2019-11-28 17:30:07,548 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 17:30:07,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=400, Invalid=860, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 17:30:07,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 17:30:07,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 17:30:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 17:30:07,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-28 17:30:07,555 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-11-28 17:30:07,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:07,556 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-28 17:30:07,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 17:30:07,556 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-28 17:30:07,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 17:30:07,559 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:07,560 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:07,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:07,764 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:07,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:07,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-11-28 17:30:07,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:07,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363153134] [2019-11-28 17:30:07,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-28 17:30:08,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363153134] [2019-11-28 17:30:08,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259203547] [2019-11-28 17:30:08,394 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:08,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:30:08,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:08,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 17:30:08,471 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:08,562 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-11-28 17:30:08,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:08,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 23 [2019-11-28 17:30:08,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171756474] [2019-11-28 17:30:08,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 17:30:08,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:08,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 17:30:08,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-11-28 17:30:08,570 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 23 states. [2019-11-28 17:30:08,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:08,835 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-28 17:30:08,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 17:30:08,836 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 93 [2019-11-28 17:30:08,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:08,837 INFO L225 Difference]: With dead ends: 60 [2019-11-28 17:30:08,837 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 17:30:08,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=450, Invalid=956, Unknown=0, NotChecked=0, Total=1406 [2019-11-28 17:30:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 17:30:08,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-28 17:30:08,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 17:30:08,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-28 17:30:08,854 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-11-28 17:30:08,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:08,855 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-28 17:30:08,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 17:30:08,856 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-28 17:30:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 17:30:08,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:08,858 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:09,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:09,062 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:09,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:09,063 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-11-28 17:30:09,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:09,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943540015] [2019-11-28 17:30:09,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-28 17:30:09,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943540015] [2019-11-28 17:30:09,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101309223] [2019-11-28 17:30:09,683 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:09,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-28 17:30:09,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:09,752 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 17:30:09,754 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-11-28 17:30:09,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:09,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 24 [2019-11-28 17:30:09,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639019349] [2019-11-28 17:30:09,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 17:30:09,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:09,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 17:30:09,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-11-28 17:30:09,821 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 24 states. [2019-11-28 17:30:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:10,062 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-28 17:30:10,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 17:30:10,063 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2019-11-28 17:30:10,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:10,064 INFO L225 Difference]: With dead ends: 63 [2019-11-28 17:30:10,064 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 17:30:10,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=503, Invalid=1057, Unknown=0, NotChecked=0, Total=1560 [2019-11-28 17:30:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 17:30:10,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-28 17:30:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 17:30:10,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-11-28 17:30:10,071 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-11-28 17:30:10,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:10,072 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-11-28 17:30:10,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 17:30:10,072 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-11-28 17:30:10,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 17:30:10,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:10,073 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:10,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:10,283 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:10,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:10,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-11-28 17:30:10,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:10,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837136995] [2019-11-28 17:30:10,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-28 17:30:10,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837136995] [2019-11-28 17:30:10,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122270381] [2019-11-28 17:30:10,868 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:10,936 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:30:10,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:10,939 INFO L264 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 17:30:10,941 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:11,013 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-11-28 17:30:11,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:11,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 25 [2019-11-28 17:30:11,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448009607] [2019-11-28 17:30:11,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 17:30:11,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:11,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 17:30:11,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:30:11,015 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 25 states. [2019-11-28 17:30:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:11,287 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-28 17:30:11,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 17:30:11,288 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 105 [2019-11-28 17:30:11,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:11,289 INFO L225 Difference]: With dead ends: 66 [2019-11-28 17:30:11,289 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 17:30:11,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=559, Invalid=1163, Unknown=0, NotChecked=0, Total=1722 [2019-11-28 17:30:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 17:30:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-28 17:30:11,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 17:30:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-11-28 17:30:11,309 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-11-28 17:30:11,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:11,310 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-11-28 17:30:11,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 17:30:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-11-28 17:30:11,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-28 17:30:11,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:11,316 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:11,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:11,517 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:11,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:11,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-11-28 17:30:11,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:11,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984193446] [2019-11-28 17:30:11,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-28 17:30:12,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984193446] [2019-11-28 17:30:12,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707111922] [2019-11-28 17:30:12,102 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:12,175 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-28 17:30:12,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:12,178 INFO L264 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-28 17:30:12,182 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-11-28 17:30:12,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:12,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 26 [2019-11-28 17:30:12,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006295463] [2019-11-28 17:30:12,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 17:30:12,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:12,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 17:30:12,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2019-11-28 17:30:12,276 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 26 states. [2019-11-28 17:30:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:12,592 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-11-28 17:30:12,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 17:30:12,593 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2019-11-28 17:30:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:12,596 INFO L225 Difference]: With dead ends: 69 [2019-11-28 17:30:12,596 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 17:30:12,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=618, Invalid=1274, Unknown=0, NotChecked=0, Total=1892 [2019-11-28 17:30:12,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 17:30:12,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 17:30:12,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 17:30:12,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-11-28 17:30:12,607 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-11-28 17:30:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:12,611 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-11-28 17:30:12,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 17:30:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-11-28 17:30:12,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-28 17:30:12,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:12,613 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:12,816 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:12,817 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:12,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:12,817 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-11-28 17:30:12,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:12,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419834411] [2019-11-28 17:30:12,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,512 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-28 17:30:13,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419834411] [2019-11-28 17:30:13,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37048365] [2019-11-28 17:30:13,513 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:13,585 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-11-28 17:30:13,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:13,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-28 17:30:13,590 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-11-28 17:30:13,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:13,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 27 [2019-11-28 17:30:13,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969532596] [2019-11-28 17:30:13,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 17:30:13,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:13,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 17:30:13,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2019-11-28 17:30:13,663 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 27 states. [2019-11-28 17:30:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:13,949 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-11-28 17:30:13,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 17:30:13,949 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 117 [2019-11-28 17:30:13,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:13,950 INFO L225 Difference]: With dead ends: 72 [2019-11-28 17:30:13,950 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 17:30:13,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=680, Invalid=1390, Unknown=0, NotChecked=0, Total=2070 [2019-11-28 17:30:13,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 17:30:13,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 17:30:13,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 17:30:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-28 17:30:13,956 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-11-28 17:30:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:13,957 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-28 17:30:13,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 17:30:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-28 17:30:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-28 17:30:13,958 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:13,958 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:14,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:14,160 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:14,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:14,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-11-28 17:30:14,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:14,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080539109] [2019-11-28 17:30:14,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-28 17:30:15,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080539109] [2019-11-28 17:30:15,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774902107] [2019-11-28 17:30:15,064 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,120 INFO L264 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 17:30:15,123 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:15,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-11-28 17:30:15,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:15,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 28 [2019-11-28 17:30:15,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553372310] [2019-11-28 17:30:15,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 17:30:15,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:15,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 17:30:15,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=492, Unknown=0, NotChecked=0, Total=756 [2019-11-28 17:30:15,235 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 28 states. [2019-11-28 17:30:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:15,546 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-11-28 17:30:15,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 17:30:15,547 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 123 [2019-11-28 17:30:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:15,548 INFO L225 Difference]: With dead ends: 75 [2019-11-28 17:30:15,548 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 17:30:15,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=745, Invalid=1511, Unknown=0, NotChecked=0, Total=2256 [2019-11-28 17:30:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 17:30:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 17:30:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 17:30:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-11-28 17:30:15,553 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-11-28 17:30:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:15,553 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-11-28 17:30:15,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 17:30:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-11-28 17:30:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-28 17:30:15,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:15,555 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:15,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:15,758 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:15,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:15,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-11-28 17:30:15,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:15,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314371313] [2019-11-28 17:30:15,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:30:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:30:15,811 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:30:15,811 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:30:15,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:30:15 BoogieIcfgContainer [2019-11-28 17:30:15,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:30:15,855 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:30:15,855 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:30:15,856 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:30:15,856 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:55" (3/4) ... [2019-11-28 17:30:15,859 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:30:15,921 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:30:15,921 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:30:15,924 INFO L168 Benchmark]: Toolchain (without parser) took 20916.18 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 451.4 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -230.8 MB). Peak memory consumption was 220.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:15,924 INFO L168 Benchmark]: CDTParser took 0.84 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:30:15,924 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.05 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 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:30:15,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.58 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:30:15,925 INFO L168 Benchmark]: Boogie Preprocessor took 78.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:15,926 INFO L168 Benchmark]: RCFGBuilder took 217.17 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:15,926 INFO L168 Benchmark]: TraceAbstraction took 20291.15 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 330.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -92.5 MB). Peak memory consumption was 237.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:15,927 INFO L168 Benchmark]: Witness Printer took 66.03 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:30:15,929 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.84 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 226.05 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 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 32.58 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -167.9 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 217.17 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20291.15 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 330.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -92.5 MB). Peak memory consumption was 237.8 MB. Max. memory is 11.5 GB. * Witness Printer took 66.03 ms. Allocated memory is still 1.5 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 20; [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 20 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Result: UNSAFE, OverallTime: 20.1s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 181 SDtfs, 715 SDslu, 1213 SDs, 0 SdLazy, 1196 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2227 GetRequests, 1642 SyntacticMatches, 0 SemanticMatches, 585 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3493 ImplicationChecksByTransitivity, 7.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 2760 NumberOfCodeBlocks, 2760 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 2592 ConstructedInterpolants, 0 QuantifiedInterpolants, 567664 SizeOfPredicates, 211 NumberOfNonLiveVariables, 3116 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 39 InterpolantComputations, 1 PerfectInterpolantSequences, 7600/15200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...