./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i25_o25-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_i25_o25-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 a544811fe2a74801350302afc46fb67e1c6f238a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:54,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:29:54,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:29:54,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:29:54,591 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:29:54,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:29:54,595 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:29:54,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:29:54,607 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:29:54,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:29:54,611 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:29:54,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:29:54,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:29:54,618 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:29:54,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:29:54,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:29:54,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:29:54,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:29:54,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:29:54,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:29:54,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:29:54,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:29:54,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:29:54,647 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:29:54,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:29:54,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:29:54,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:29:54,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:29:54,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:29:54,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:29:54,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:29:54,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:29:54,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:29:54,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:29:54,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:29:54,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:29:54,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:29:54,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:29:54,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:29:54,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:29:54,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:29:54,663 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:54,702 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:29:54,702 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:29:54,703 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:29:54,703 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:29:54,708 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:29:54,708 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:29:54,708 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:29:54,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:29:54,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:29:54,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:29:54,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:29:54,709 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:29:54,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:29:54,710 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:29:54,710 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:29:54,710 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:29:54,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:29:54,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:29:54,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:29:54,713 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:29:54,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:29:54,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:29:54,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:29:54,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:29:54,714 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:29:54,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:29:54,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:29:54,715 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:29:54,715 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:29:54,715 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 -> a544811fe2a74801350302afc46fb67e1c6f238a [2019-11-28 17:29:55,073 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:29:55,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:29:55,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:29:55,100 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:29:55,100 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:29:55,101 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2019-11-28 17:29:55,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe642230/14e3372679164a9daf5fe27f018fd2f6/FLAG70f6c3aab [2019-11-28 17:29:55,655 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:29:55,656 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2019-11-28 17:29:55,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe642230/14e3372679164a9daf5fe27f018fd2f6/FLAG70f6c3aab [2019-11-28 17:29:55,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfe642230/14e3372679164a9daf5fe27f018fd2f6 [2019-11-28 17:29:55,997 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:29:55,999 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:29:56,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:56,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:29:56,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:29:56,005 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:56,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f061439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:56, skipping insertion in model container [2019-11-28 17:29:56,008 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:56,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:29:56,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:29:56,284 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:56,290 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:29:56,311 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:29:56,332 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:29:56,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:56 WrapperNode [2019-11-28 17:29:56,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:29:56,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:56,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:29:56,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:29:56,345 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:56" (1/1) ... [2019-11-28 17:29:56,353 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:56" (1/1) ... [2019-11-28 17:29:56,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:29:56,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:29:56,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:29:56,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:29:56,466 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:56" (1/1) ... [2019-11-28 17:29:56,466 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:56" (1/1) ... [2019-11-28 17:29:56,467 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:56" (1/1) ... [2019-11-28 17:29:56,467 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:56" (1/1) ... [2019-11-28 17:29:56,470 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:56" (1/1) ... [2019-11-28 17:29:56,472 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:56" (1/1) ... [2019-11-28 17:29:56,473 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:56" (1/1) ... [2019-11-28 17:29:56,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:29:56,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:29:56,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:29:56,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:29:56,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:56" (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:56,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:29:56,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:29:56,545 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-11-28 17:29:56,546 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-11-28 17:29:56,720 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:29:56,721 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-28 17:29:56,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:56 BoogieIcfgContainer [2019-11-28 17:29:56,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:29:56,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:29:56,724 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:29:56,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:29:56,727 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:56,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5d5e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:56, skipping insertion in model container [2019-11-28 17:29:56,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:29:56" (2/3) ... [2019-11-28 17:29:56,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5d5e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:29:56, skipping insertion in model container [2019-11-28 17:29:56,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:29:56" (3/3) ... [2019-11-28 17:29:56,731 INFO L109 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2019-11-28 17:29:56,741 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:29:56,747 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:29:56,760 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:29:56,785 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:29:56,785 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:29:56,786 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:29:56,786 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:29:56,786 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:29:56,786 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:29:56,786 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:29:56,786 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:29:56,805 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-28 17:29:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 17:29:56,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:56,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:56,813 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:56,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:56,819 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-11-28 17:29:56,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:56,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432357041] [2019-11-28 17:29:56,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,100 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:57,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432357041] [2019-11-28 17:29:57,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:29:57,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 17:29:57,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053594863] [2019-11-28 17:29:57,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 17:29:57,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:57,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 17:29:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 17:29:57,131 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 7 states. [2019-11-28 17:29:57,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:57,241 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-11-28 17:29:57,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:29:57,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-28 17:29:57,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:57,251 INFO L225 Difference]: With dead ends: 24 [2019-11-28 17:29:57,251 INFO L226 Difference]: Without dead ends: 14 [2019-11-28 17:29:57,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:29:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-28 17:29:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-28 17:29:57,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-28 17:29:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-28 17:29:57,296 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-28 17:29:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:57,296 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-28 17:29:57,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 17:29:57,297 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-28 17:29:57,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 17:29:57,299 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:57,299 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:57,299 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:57,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:57,300 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-11-28 17:29:57,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:57,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821830112] [2019-11-28 17:29:57,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,477 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:57,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821830112] [2019-11-28 17:29:57,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454855824] [2019-11-28 17:29:57,479 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:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:57,530 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:29:57,537 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:57,634 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:57,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:57,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 10 [2019-11-28 17:29:57,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419405591] [2019-11-28 17:29:57,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 17:29:57,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:57,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 17:29:57,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 17:29:57,646 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 10 states. [2019-11-28 17:29:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:57,750 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-11-28 17:29:57,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:29:57,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-11-28 17:29:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:57,752 INFO L225 Difference]: With dead ends: 21 [2019-11-28 17:29:57,752 INFO L226 Difference]: Without dead ends: 17 [2019-11-28 17:29:57,754 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:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-28 17:29:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-28 17:29:57,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-28 17:29:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-11-28 17:29:57,760 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-11-28 17:29:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:57,760 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-11-28 17:29:57,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 17:29:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-11-28 17:29:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 17:29:57,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:57,762 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:57,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:57,979 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:57,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:57,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-11-28 17:29:57,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:57,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654786258] [2019-11-28 17:29:57,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,200 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:58,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654786258] [2019-11-28 17:29:58,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678387898] [2019-11-28 17:29:58,201 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:58,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:29:58,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:58,237 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 17:29:58,239 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:58,285 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:58,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:58,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2019-11-28 17:29:58,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357851201] [2019-11-28 17:29:58,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 17:29:58,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:58,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 17:29:58,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-11-28 17:29:58,288 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 11 states. [2019-11-28 17:29:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:58,374 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-11-28 17:29:58,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 17:29:58,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-28 17:29:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:58,376 INFO L225 Difference]: With dead ends: 24 [2019-11-28 17:29:58,376 INFO L226 Difference]: Without dead ends: 20 [2019-11-28 17:29:58,377 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:58,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-28 17:29:58,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-28 17:29:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-28 17:29:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-28 17:29:58,383 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-11-28 17:29:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:58,384 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-28 17:29:58,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 17:29:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-28 17:29:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 17:29:58,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:58,386 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:58,589 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:58,589 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:58,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:58,590 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-11-28 17:29:58,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:58,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564439102] [2019-11-28 17:29:58,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:58,839 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:58,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564439102] [2019-11-28 17:29:58,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915788181] [2019-11-28 17:29:58,840 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:58,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-28 17:29:58,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:58,894 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 17:29:58,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:58,949 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:58,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:58,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-11-28 17:29:58,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483675735] [2019-11-28 17:29:58,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:29:58,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:58,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:29:58,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:29:58,954 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 12 states. [2019-11-28 17:29:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:59,065 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 17:29:59,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 17:29:59,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2019-11-28 17:29:59,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:59,068 INFO L225 Difference]: With dead ends: 27 [2019-11-28 17:29:59,068 INFO L226 Difference]: Without dead ends: 23 [2019-11-28 17:29:59,070 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:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-28 17:29:59,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 17:29:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 17:29:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-28 17:29:59,085 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-11-28 17:29:59,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:59,087 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-28 17:29:59,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:29:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-28 17:29:59,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 17:29:59,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:59,091 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:59,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:59,298 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:59,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:59,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-11-28 17:29:59,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:59,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903189993] [2019-11-28 17:29:59,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:59,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:29:59,531 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:59,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903189993] [2019-11-28 17:29:59,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2573960] [2019-11-28 17:29:59,532 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:59,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:29:59,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:29:59,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 17:29:59,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:29:59,616 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:59,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:29:59,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2019-11-28 17:29:59,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018721980] [2019-11-28 17:29:59,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-28 17:29:59,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:29:59,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-28 17:29:59,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-11-28 17:29:59,619 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 13 states. [2019-11-28 17:29:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:29:59,722 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-28 17:29:59,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:29:59,723 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2019-11-28 17:29:59,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:29:59,724 INFO L225 Difference]: With dead ends: 30 [2019-11-28 17:29:59,724 INFO L226 Difference]: Without dead ends: 26 [2019-11-28 17:29:59,726 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:59,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-28 17:29:59,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-28 17:29:59,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-28 17:29:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-11-28 17:29:59,732 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-11-28 17:29:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:29:59,732 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-11-28 17:29:59,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-28 17:29:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-11-28 17:29:59,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 17:29:59,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:29:59,734 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:29:59,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:29:59,938 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:29:59,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:29:59,939 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-11-28 17:29:59,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:29:59,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146422470] [2019-11-28 17:29:59,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:29:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,191 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:30:00,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146422470] [2019-11-28 17:30:00,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653162707] [2019-11-28 17:30:00,194 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:30:00,239 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-11-28 17:30:00,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:00,240 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 17:30:00,246 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:00,301 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:30:00,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:00,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2019-11-28 17:30:00,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141360993] [2019-11-28 17:30:00,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:30:00,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:00,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:30:00,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:30:00,304 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 14 states. [2019-11-28 17:30:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:00,409 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-28 17:30:00,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 17:30:00,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 39 [2019-11-28 17:30:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:00,411 INFO L225 Difference]: With dead ends: 33 [2019-11-28 17:30:00,411 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 17:30:00,412 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:30:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 17:30:00,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 17:30:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 17:30:00,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-28 17:30:00,418 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-11-28 17:30:00,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:00,418 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-28 17:30:00,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:30:00,418 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-28 17:30:00,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 17:30:00,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:00,420 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:00,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:00,632 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:00,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:00,633 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-11-28 17:30:00,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:00,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484201494] [2019-11-28 17:30:00,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:00,860 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,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484201494] [2019-11-28 17:30:00,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903725989] [2019-11-28 17:30:00,861 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:30:00,901 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-11-28 17:30:00,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:00,903 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 17:30:00,906 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:01,205 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:01,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:01,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 28 [2019-11-28 17:30:01,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418285972] [2019-11-28 17:30:01,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 17:30:01,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:01,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 17:30:01,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=644, Unknown=0, NotChecked=0, Total=756 [2019-11-28 17:30:01,208 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 28 states. [2019-11-28 17:30:01,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:01,630 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-11-28 17:30:01,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 17:30:01,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 45 [2019-11-28 17:30:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:01,632 INFO L225 Difference]: With dead ends: 36 [2019-11-28 17:30:01,632 INFO L226 Difference]: Without dead ends: 32 [2019-11-28 17:30:01,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=285, Invalid=1355, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 17:30:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-28 17:30:01,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-11-28 17:30:01,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 17:30:01,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-28 17:30:01,648 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-11-28 17:30:01,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:01,650 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-28 17:30:01,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 17:30:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-28 17:30:01,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 17:30:01,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:01,653 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:01,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:01,867 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:01,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-11-28 17:30:01,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:01,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48621365] [2019-11-28 17:30:01,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,092 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:02,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48621365] [2019-11-28 17:30:02,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244355818] [2019-11-28 17:30:02,093 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:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,131 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 17:30:02,134 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:02,213 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:02,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:02,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 16 [2019-11-28 17:30:02,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217016356] [2019-11-28 17:30:02,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 17:30:02,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:02,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 17:30:02,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-11-28 17:30:02,219 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 16 states. [2019-11-28 17:30:02,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:02,352 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-11-28 17:30:02,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 17:30:02,352 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 51 [2019-11-28 17:30:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:02,353 INFO L225 Difference]: With dead ends: 39 [2019-11-28 17:30:02,353 INFO L226 Difference]: Without dead ends: 35 [2019-11-28 17:30:02,354 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:02,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-28 17:30:02,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-28 17:30:02,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-28 17:30:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-11-28 17:30:02,360 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-11-28 17:30:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:02,361 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-11-28 17:30:02,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 17:30:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-11-28 17:30:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 17:30:02,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:02,362 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:02,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:02,566 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:02,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:02,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-11-28 17:30:02,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:02,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122289355] [2019-11-28 17:30:02,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:02,830 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:02,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122289355] [2019-11-28 17:30:02,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983767893] [2019-11-28 17:30:02,831 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:02,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:30:02,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:02,872 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 20 conjunts are in the unsatisfiable core [2019-11-28 17:30:02,878 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:02,932 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:02,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:02,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 17 [2019-11-28 17:30:02,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474659397] [2019-11-28 17:30:02,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 17:30:02,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:02,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 17:30:02,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2019-11-28 17:30:02,935 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 17 states. [2019-11-28 17:30:03,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:03,085 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-11-28 17:30:03,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:30:03,086 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2019-11-28 17:30:03,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:03,087 INFO L225 Difference]: With dead ends: 42 [2019-11-28 17:30:03,087 INFO L226 Difference]: Without dead ends: 38 [2019-11-28 17:30:03,088 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:03,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-28 17:30:03,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-28 17:30:03,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 17:30:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-28 17:30:03,094 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-11-28 17:30:03,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:03,095 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-28 17:30:03,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 17:30:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-28 17:30:03,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 17:30:03,097 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:03,097 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:03,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:03,298 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:03,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:03,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-11-28 17:30:03,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:03,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150686093] [2019-11-28 17:30:03,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:03,584 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,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150686093] [2019-11-28 17:30:03,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093874140] [2019-11-28 17:30:03,585 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:03,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-11-28 17:30:03,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:03,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-28 17:30:03,643 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:04,161 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:04,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:04,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 23] total 37 [2019-11-28 17:30:04,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372713409] [2019-11-28 17:30:04,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-28 17:30:04,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:04,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-28 17:30:04,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2019-11-28 17:30:04,166 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 37 states. [2019-11-28 17:30:04,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:04,629 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-11-28 17:30:04,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 17:30:04,629 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 63 [2019-11-28 17:30:04,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:04,630 INFO L225 Difference]: With dead ends: 45 [2019-11-28 17:30:04,630 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 17:30:04,633 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=537, Invalid=2543, Unknown=0, NotChecked=0, Total=3080 [2019-11-28 17:30:04,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 17:30:04,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-28 17:30:04,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 17:30:04,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-11-28 17:30:04,640 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-11-28 17:30:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:04,640 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-11-28 17:30:04,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-28 17:30:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-11-28 17:30:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-28 17:30:04,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:04,642 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:04,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:04,845 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:04,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:04,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-11-28 17:30:04,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:04,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274786672] [2019-11-28 17:30:04,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,180 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:05,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274786672] [2019-11-28 17:30:05,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893045672] [2019-11-28 17:30:05,181 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:05,235 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:30:05,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:05,236 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 17:30:05,243 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:05,299 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:05,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:05,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 19 [2019-11-28 17:30:05,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214690888] [2019-11-28 17:30:05,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 17:30:05,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:05,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 17:30:05,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:30:05,302 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 19 states. [2019-11-28 17:30:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:05,465 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-11-28 17:30:05,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-28 17:30:05,466 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2019-11-28 17:30:05,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:05,468 INFO L225 Difference]: With dead ends: 48 [2019-11-28 17:30:05,468 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 17:30:05,469 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:05,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 17:30:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-28 17:30:05,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-28 17:30:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-11-28 17:30:05,476 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-11-28 17:30:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:05,476 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-11-28 17:30:05,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 17:30:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-11-28 17:30:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-28 17:30:05,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:05,477 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:05,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:05,689 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:05,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:05,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-11-28 17:30:05,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:05,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978026926] [2019-11-28 17:30:05,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:05,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,158 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:06,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978026926] [2019-11-28 17:30:06,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786300772] [2019-11-28 17:30:06,160 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:06,237 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-11-28 17:30:06,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:06,239 INFO L264 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-28 17:30:06,246 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:06,319 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:06,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:06,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 20 [2019-11-28 17:30:06,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007651521] [2019-11-28 17:30:06,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-28 17:30:06,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:06,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-28 17:30:06,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=264, Unknown=0, NotChecked=0, Total=380 [2019-11-28 17:30:06,323 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 20 states. [2019-11-28 17:30:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:06,525 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-11-28 17:30:06,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-28 17:30:06,526 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2019-11-28 17:30:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:06,527 INFO L225 Difference]: With dead ends: 51 [2019-11-28 17:30:06,527 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 17:30:06,528 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:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 17:30:06,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 17:30:06,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 17:30:06,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-11-28 17:30:06,537 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-11-28 17:30:06,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:06,538 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-11-28 17:30:06,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-28 17:30:06,538 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-11-28 17:30:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-28 17:30:06,539 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:06,539 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:06,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:06,743 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:06,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:06,744 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-11-28 17:30:06,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:06,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811937286] [2019-11-28 17:30:06,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,790 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,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,014 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,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,257 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:07,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811937286] [2019-11-28 17:30:07,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922538492] [2019-11-28 17:30:07,259 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:07,344 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-11-28 17:30:07,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:07,347 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 17:30:07,351 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:07,438 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:07,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:07,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17] total 21 [2019-11-28 17:30:07,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750617205] [2019-11-28 17:30:07,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 17:30:07,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:07,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 17:30:07,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2019-11-28 17:30:07,442 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 21 states. [2019-11-28 17:30:07,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:07,642 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-11-28 17:30:07,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-28 17:30:07,642 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 81 [2019-11-28 17:30:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:07,644 INFO L225 Difference]: With dead ends: 54 [2019-11-28 17:30:07,644 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 17:30:07,647 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:07,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 17:30:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-28 17:30:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 17:30:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-11-28 17:30:07,659 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-11-28 17:30:07,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:07,659 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-11-28 17:30:07,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 17:30:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-11-28 17:30:07,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 17:30:07,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:07,660 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:07,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:07,866 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:07,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:07,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-11-28 17:30:07,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:07,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043885779] [2019-11-28 17:30:07,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,300 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:08,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043885779] [2019-11-28 17:30:08,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59755126] [2019-11-28 17:30:08,301 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:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,341 INFO L264 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-28 17:30:08,343 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:08,415 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:08,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:08,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 22 [2019-11-28 17:30:08,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472628272] [2019-11-28 17:30:08,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-28 17:30:08,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:08,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-28 17:30:08,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:30:08,418 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 22 states. [2019-11-28 17:30:08,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:08,643 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-11-28 17:30:08,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 17:30:08,644 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-11-28 17:30:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:08,646 INFO L225 Difference]: With dead ends: 57 [2019-11-28 17:30:08,647 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 17:30:08,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=400, Invalid=860, Unknown=0, NotChecked=0, Total=1260 [2019-11-28 17:30:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 17:30:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-28 17:30:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-28 17:30:08,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-11-28 17:30:08,664 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-11-28 17:30:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:08,666 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-11-28 17:30:08,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-28 17:30:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-11-28 17:30:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 17:30:08,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:08,668 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:08,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:08,872 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:08,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:08,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-11-28 17:30:08,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:08,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258439888] [2019-11-28 17:30:08,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:09,516 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:09,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258439888] [2019-11-28 17:30:09,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857624625] [2019-11-28 17:30:09,517 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:09,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:30:09,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:09,574 INFO L264 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 17:30:09,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:09,639 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:09,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:09,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 23 [2019-11-28 17:30:09,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619394091] [2019-11-28 17:30:09,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 17:30:09,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:09,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 17:30:09,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-11-28 17:30:09,645 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 23 states. [2019-11-28 17:30:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:09,871 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-11-28 17:30:09,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 17:30:09,871 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 93 [2019-11-28 17:30:09,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:09,872 INFO L225 Difference]: With dead ends: 60 [2019-11-28 17:30:09,872 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 17:30:09,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=450, Invalid=956, Unknown=0, NotChecked=0, Total=1406 [2019-11-28 17:30:09,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 17:30:09,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-28 17:30:09,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-28 17:30:09,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-11-28 17:30:09,889 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-11-28 17:30:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:09,890 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-11-28 17:30:09,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 17:30:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-11-28 17:30:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 17:30:09,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:09,893 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:10,096 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:10,096 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:10,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:10,097 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-11-28 17:30:10,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:10,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475007084] [2019-11-28 17:30:10,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,623 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,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:10,830 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:10,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475007084] [2019-11-28 17:30:10,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813846570] [2019-11-28 17:30:10,831 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:10,929 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-11-28 17:30:10,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:10,930 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 17:30:10,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:11,035 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:11,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:11,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 24 [2019-11-28 17:30:11,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674681159] [2019-11-28 17:30:11,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-28 17:30:11,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:11,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-28 17:30:11,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=370, Unknown=0, NotChecked=0, Total=552 [2019-11-28 17:30:11,038 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 24 states. [2019-11-28 17:30:11,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:11,317 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-11-28 17:30:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 17:30:11,317 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 99 [2019-11-28 17:30:11,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:11,318 INFO L225 Difference]: With dead ends: 63 [2019-11-28 17:30:11,319 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 17:30:11,320 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=503, Invalid=1057, Unknown=0, NotChecked=0, Total=1560 [2019-11-28 17:30:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 17:30:11,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-28 17:30:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 17:30:11,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-11-28 17:30:11,329 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-11-28 17:30:11,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:11,330 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-11-28 17:30:11,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-28 17:30:11,330 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-11-28 17:30:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-28 17:30:11,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:11,332 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:11,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:11,537 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:11,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:11,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-11-28 17:30:11,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:11,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889796465] [2019-11-28 17:30:11,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,262 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:12,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889796465] [2019-11-28 17:30:12,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453144010] [2019-11-28 17:30:12,263 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:12,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:30:12,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:12,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 17:30:12,322 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:12,388 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:12,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:12,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 25 [2019-11-28 17:30:12,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634374193] [2019-11-28 17:30:12,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-28 17:30:12,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:12,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-28 17:30:12,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2019-11-28 17:30:12,396 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 25 states. [2019-11-28 17:30:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:12,656 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-28 17:30:12,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-28 17:30:12,656 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 105 [2019-11-28 17:30:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:12,657 INFO L225 Difference]: With dead ends: 66 [2019-11-28 17:30:12,657 INFO L226 Difference]: Without dead ends: 62 [2019-11-28 17:30:12,658 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:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-28 17:30:12,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-11-28 17:30:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-28 17:30:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-11-28 17:30:12,663 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-11-28 17:30:12,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:12,663 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-11-28 17:30:12,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-28 17:30:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-11-28 17:30:12,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-28 17:30:12,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:12,665 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:12,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:12,869 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:12,870 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-11-28 17:30:12,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:12,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211873358] [2019-11-28 17:30:12,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:13,541 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:13,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211873358] [2019-11-28 17:30:13,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150819072] [2019-11-28 17:30:13,542 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:13,620 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-11-28 17:30:13,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:13,622 INFO L264 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-28 17:30:13,624 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:13,696 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:13,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:13,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 26 [2019-11-28 17:30:13,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101631140] [2019-11-28 17:30:13,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-28 17:30:13,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:13,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-28 17:30:13,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=429, Unknown=0, NotChecked=0, Total=650 [2019-11-28 17:30:13,700 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 26 states. [2019-11-28 17:30:13,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:13,979 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-11-28 17:30:13,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 17:30:13,980 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 111 [2019-11-28 17:30:13,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:13,981 INFO L225 Difference]: With dead ends: 69 [2019-11-28 17:30:13,981 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 17:30:13,982 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:13,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 17:30:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-28 17:30:13,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-28 17:30:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-11-28 17:30:13,987 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-11-28 17:30:13,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:13,987 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-11-28 17:30:13,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-28 17:30:13,987 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-11-28 17:30:13,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-28 17:30:13,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:13,989 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:14,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:14,189 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:14,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-11-28 17:30:14,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:14,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322305740] [2019-11-28 17:30:14,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:14,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:14,864 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:14,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322305740] [2019-11-28 17:30:14,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717359450] [2019-11-28 17:30:14,865 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:14,931 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-11-28 17:30:14,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:14,933 INFO L264 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-28 17:30:14,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:15,007 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:15,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:15,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 27 [2019-11-28 17:30:15,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552772509] [2019-11-28 17:30:15,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-28 17:30:15,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:15,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-28 17:30:15,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=460, Unknown=0, NotChecked=0, Total=702 [2019-11-28 17:30:15,009 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 27 states. [2019-11-28 17:30:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:15,292 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-11-28 17:30:15,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 17:30:15,293 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 117 [2019-11-28 17:30:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:15,293 INFO L225 Difference]: With dead ends: 72 [2019-11-28 17:30:15,294 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 17:30:15,295 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:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 17:30:15,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 17:30:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 17:30:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-28 17:30:15,298 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-11-28 17:30:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:15,299 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-28 17:30:15,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-28 17:30:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-28 17:30:15,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-28 17:30:15,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:15,300 INFO L410 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:15,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:15,505 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:15,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:15,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-11-28 17:30:15,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:15,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992226391] [2019-11-28 17:30:15,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:16,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:16,228 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:16,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992226391] [2019-11-28 17:30:16,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776103680] [2019-11-28 17:30:16,229 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:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:16,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-28 17:30:16,304 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:16,412 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:16,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:16,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 28 [2019-11-28 17:30:16,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014527780] [2019-11-28 17:30:16,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-28 17:30:16,415 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:16,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-28 17:30:16,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=492, Unknown=0, NotChecked=0, Total=756 [2019-11-28 17:30:16,416 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 28 states. [2019-11-28 17:30:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:16,760 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-11-28 17:30:16,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-28 17:30:16,761 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 123 [2019-11-28 17:30:16,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:16,762 INFO L225 Difference]: With dead ends: 75 [2019-11-28 17:30:16,763 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 17:30:16,764 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:16,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 17:30:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-28 17:30:16,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-28 17:30:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-11-28 17:30:16,768 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-11-28 17:30:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:16,769 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-11-28 17:30:16,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-28 17:30:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-11-28 17:30:16,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-28 17:30:16,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:16,770 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:16,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:16,974 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:16,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:16,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-11-28 17:30:16,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:16,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468164880] [2019-11-28 17:30:16,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:17,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-11-28 17:30:17,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468164880] [2019-11-28 17:30:17,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937578322] [2019-11-28 17:30:17,924 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:17,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:30:17,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:17,985 INFO L264 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-28 17:30:17,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:18,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1220 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2019-11-28 17:30:18,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:18,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 29 [2019-11-28 17:30:18,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396874437] [2019-11-28 17:30:18,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-28 17:30:18,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:18,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-28 17:30:18,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2019-11-28 17:30:18,069 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 29 states. [2019-11-28 17:30:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:18,432 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2019-11-28 17:30:18,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 17:30:18,432 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 129 [2019-11-28 17:30:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:18,433 INFO L225 Difference]: With dead ends: 78 [2019-11-28 17:30:18,434 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 17:30:18,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=813, Invalid=1637, Unknown=0, NotChecked=0, Total=2450 [2019-11-28 17:30:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 17:30:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 17:30:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 17:30:18,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2019-11-28 17:30:18,443 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 129 [2019-11-28 17:30:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:18,444 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2019-11-28 17:30:18,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-28 17:30:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2019-11-28 17:30:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-28 17:30:18,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:18,445 INFO L410 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:18,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:18,646 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:18,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1463802477, now seen corresponding path program 21 times [2019-11-28 17:30:18,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:18,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253486605] [2019-11-28 17:30:18,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-28 17:30:19,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253486605] [2019-11-28 17:30:19,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296264131] [2019-11-28 17:30:19,746 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:19,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-11-28 17:30:19,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:19,824 INFO L264 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-28 17:30:19,831 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2019-11-28 17:30:19,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:19,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 30 [2019-11-28 17:30:19,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972635123] [2019-11-28 17:30:19,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-28 17:30:19,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:19,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-28 17:30:19,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=559, Unknown=0, NotChecked=0, Total=870 [2019-11-28 17:30:19,937 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 30 states. [2019-11-28 17:30:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:20,312 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-11-28 17:30:20,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 17:30:20,314 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 135 [2019-11-28 17:30:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:20,315 INFO L225 Difference]: With dead ends: 81 [2019-11-28 17:30:20,316 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 17:30:20,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=884, Invalid=1768, Unknown=0, NotChecked=0, Total=2652 [2019-11-28 17:30:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 17:30:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-28 17:30:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 17:30:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-11-28 17:30:20,330 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 135 [2019-11-28 17:30:20,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:20,331 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-11-28 17:30:20,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-28 17:30:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-11-28 17:30:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-28 17:30:20,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:20,334 INFO L410 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:20,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:20,535 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:20,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:20,536 INFO L82 PathProgramCache]: Analyzing trace with hash -555819607, now seen corresponding path program 22 times [2019-11-28 17:30:20,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:20,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239309224] [2019-11-28 17:30:20,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:20,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:20,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-28 17:30:21,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239309224] [2019-11-28 17:30:21,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920618411] [2019-11-28 17:30:21,540 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:21,593 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-28 17:30:21,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:21,595 INFO L264 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-28 17:30:21,599 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2019-11-28 17:30:21,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:21,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 31 [2019-11-28 17:30:21,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801940409] [2019-11-28 17:30:21,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-28 17:30:21,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:21,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-28 17:30:21,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=336, Invalid=594, Unknown=0, NotChecked=0, Total=930 [2019-11-28 17:30:21,731 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 31 states. [2019-11-28 17:30:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:22,100 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2019-11-28 17:30:22,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-28 17:30:22,101 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 141 [2019-11-28 17:30:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:22,102 INFO L225 Difference]: With dead ends: 84 [2019-11-28 17:30:22,102 INFO L226 Difference]: Without dead ends: 80 [2019-11-28 17:30:22,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=958, Invalid=1904, Unknown=0, NotChecked=0, Total=2862 [2019-11-28 17:30:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-28 17:30:22,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-28 17:30:22,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-28 17:30:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-11-28 17:30:22,107 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 141 [2019-11-28 17:30:22,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:22,108 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-11-28 17:30:22,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-28 17:30:22,108 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-11-28 17:30:22,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-28 17:30:22,109 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:22,109 INFO L410 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:22,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:22,312 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:22,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:22,313 INFO L82 PathProgramCache]: Analyzing trace with hash -945685357, now seen corresponding path program 23 times [2019-11-28 17:30:22,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:22,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972716151] [2019-11-28 17:30:22,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-11-28 17:30:23,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972716151] [2019-11-28 17:30:23,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092615630] [2019-11-28 17:30:23,421 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:23,542 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2019-11-28 17:30:23,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:23,545 INFO L264 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-28 17:30:23,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2019-11-28 17:30:23,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:23,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28] total 32 [2019-11-28 17:30:23,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685249020] [2019-11-28 17:30:23,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-28 17:30:23,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:23,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-28 17:30:23,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2019-11-28 17:30:23,637 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 32 states. [2019-11-28 17:30:24,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:24,018 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-11-28 17:30:24,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-28 17:30:24,018 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 147 [2019-11-28 17:30:24,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:24,020 INFO L225 Difference]: With dead ends: 87 [2019-11-28 17:30:24,020 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 17:30:24,022 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=2045, Unknown=0, NotChecked=0, Total=3080 [2019-11-28 17:30:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 17:30:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-11-28 17:30:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 17:30:24,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-11-28 17:30:24,027 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 147 [2019-11-28 17:30:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:24,028 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-11-28 17:30:24,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-28 17:30:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-11-28 17:30:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-28 17:30:24,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:24,030 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:24,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:24,231 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:24,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:24,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1588806697, now seen corresponding path program 24 times [2019-11-28 17:30:24,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:24,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498742908] [2019-11-28 17:30:24,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:30:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-11-28 17:30:25,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498742908] [2019-11-28 17:30:25,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501732752] [2019-11-28 17:30:25,186 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:25,258 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-11-28 17:30:25,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:30:25,260 INFO L264 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-28 17:30:25,263 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:30:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1752 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 876 trivial. 0 not checked. [2019-11-28 17:30:25,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:30:25,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 33 [2019-11-28 17:30:25,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764810422] [2019-11-28 17:30:25,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-28 17:30:25,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:30:25,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-28 17:30:25,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=667, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 17:30:25,373 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 33 states. [2019-11-28 17:30:25,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:30:25,860 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2019-11-28 17:30:25,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-11-28 17:30:25,861 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 153 [2019-11-28 17:30:25,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:30:25,862 INFO L225 Difference]: With dead ends: 90 [2019-11-28 17:30:25,863 INFO L226 Difference]: Without dead ends: 86 [2019-11-28 17:30:25,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1115, Invalid=2191, Unknown=0, NotChecked=0, Total=3306 [2019-11-28 17:30:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-11-28 17:30:25,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-11-28 17:30:25,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-28 17:30:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2019-11-28 17:30:25,870 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 153 [2019-11-28 17:30:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:30:25,871 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2019-11-28 17:30:25,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-28 17:30:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2019-11-28 17:30:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-28 17:30:25,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:30:25,873 INFO L410 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:30:26,077 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:30:26,077 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:30:26,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:30:26,078 INFO L82 PathProgramCache]: Analyzing trace with hash 959677331, now seen corresponding path program 25 times [2019-11-28 17:30:26,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:30:26,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825750574] [2019-11-28 17:30:26,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:30:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:30:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 17:30:26,158 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 17:30:26,159 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:30:26,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:30:26 BoogieIcfgContainer [2019-11-28 17:30:26,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:30:26,223 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:30:26,223 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:30:26,223 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:30:26,224 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:56" (3/4) ... [2019-11-28 17:30:26,225 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 17:30:26,289 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 17:30:26,289 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:30:26,291 INFO L168 Benchmark]: Toolchain (without parser) took 30292.75 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 610.3 MB). Free memory was 955.0 MB in the beginning and 1.6 GB in the end (delta: -624.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:30:26,291 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:30:26,292 INFO L168 Benchmark]: CACSL2BoogieTranslator took 333.30 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 942.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:26,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.83 ms. Allocated memory is still 1.0 GB. Free memory is still 942.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:30:26,293 INFO L168 Benchmark]: Boogie Preprocessor took 99.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.8 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:26,293 INFO L168 Benchmark]: RCFGBuilder took 247.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:26,293 INFO L168 Benchmark]: TraceAbstraction took 29499.19 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 538.4 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -549.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:30:26,294 INFO L168 Benchmark]: Witness Printer took 66.31 ms. Allocated memory is still 1.6 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:30:26,296 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 333.30 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 942.9 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.83 ms. Allocated memory is still 1.0 GB. Free memory is still 942.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 71.8 MB). Free memory was 942.9 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 247.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 29499.19 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 538.4 MB). Free memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: -549.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 66.31 ms. Allocated memory is still 1.6 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. 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 = 25; [L11] CALL, EXPR id(input) VAL [\old(x)=25] [L5] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L6] CALL, EXPR id(x-1) VAL [\old(x)=24] [L5] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L6] CALL, EXPR id(x-1) VAL [\old(x)=23] [L5] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L6] CALL, EXPR id(x-1) VAL [\old(x)=22] [L5] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L6] CALL, EXPR id(x-1) VAL [\old(x)=21] [L5] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L6] CALL, EXPR id(x-1) 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; [L6] RET, EXPR id(x-1) VAL [\old(x)=21, id(x-1)=20, x=21] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=22, id(x-1)=21, x=22] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=23, id(x-1)=22, x=23] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=24, id(x-1)=23, x=24] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=25, id(x-1)=24, x=25] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 25 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Result: UNSAFE, OverallTime: 29.3s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 226 SDtfs, 1114 SDslu, 1652 SDs, 0 SdLazy, 1575 SolverSat, 267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3407 GetRequests, 2562 SyntacticMatches, 0 SemanticMatches, 845 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6143 ImplicationChecksByTransitivity, 11.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 15.4s InterpolantComputationTime, 4200 NumberOfCodeBlocks, 4200 NumberOfCodeBlocksAsserted, 222 NumberOfCheckSat, 3992 ConstructedInterpolants, 0 QuantifiedInterpolants, 1088472 SizeOfPredicates, 331 NumberOfNonLiveVariables, 4776 ConjunctsInSsa, 696 ConjunctsInUnsatCore, 49 InterpolantComputations, 1 PerfectInterpolantSequences, 15000/30000 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...