./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/sum_20x0_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/recursive-simple/sum_20x0_false-unreach-call_true-termination.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 17db2a72807ac377d533a347dbb668103ea580a0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 15:09:36,679 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:09:36,681 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:09:36,697 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:09:36,698 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:09:36,699 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:09:36,701 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:09:36,703 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:09:36,705 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:09:36,705 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:09:36,706 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:09:36,707 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:09:36,707 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:09:36,708 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:09:36,710 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:09:36,711 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:09:36,712 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:09:36,714 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:09:36,717 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:09:36,718 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:09:36,720 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:09:36,721 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:09:36,724 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:09:36,724 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:09:36,724 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:09:36,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:09:36,727 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:09:36,728 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:09:36,728 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:09:36,730 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:09:36,730 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:09:36,731 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:09:36,731 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:09:36,731 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:09:36,737 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:09:36,738 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:09:36,738 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:09:36,768 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:09:36,768 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:09:36,770 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:09:36,770 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:09:36,770 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:09:36,770 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:09:36,770 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:09:36,771 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:09:36,771 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:09:36,771 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:09:36,771 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:09:36,771 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:09:36,771 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:09:36,772 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:09:36,773 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:09:36,773 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:09:36,773 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:09:36,774 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:09:36,774 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:09:36,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:09:36,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:09:36,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:09:36,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:09:36,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:09:36,776 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:09:36,776 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:09:36,776 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:09:36,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:09:36,777 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 17db2a72807ac377d533a347dbb668103ea580a0 [2019-01-12 15:09:36,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:09:36,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:09:36,849 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:09:36,851 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:09:36,853 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:09:36,853 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/sum_20x0_false-unreach-call_true-termination.c [2019-01-12 15:09:36,912 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f593b0a73/b77dfe80302d4bdcb30e70c37046b4e1/FLAGe463f29ce [2019-01-12 15:09:37,325 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:09:37,325 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/sum_20x0_false-unreach-call_true-termination.c [2019-01-12 15:09:37,331 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f593b0a73/b77dfe80302d4bdcb30e70c37046b4e1/FLAGe463f29ce [2019-01-12 15:09:37,709 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f593b0a73/b77dfe80302d4bdcb30e70c37046b4e1 [2019-01-12 15:09:37,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:09:37,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:09:37,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:09:37,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:09:37,722 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:09:37,724 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:09:37" (1/1) ... [2019-01-12 15:09:37,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a4eb3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37, skipping insertion in model container [2019-01-12 15:09:37,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:09:37" (1/1) ... [2019-01-12 15:09:37,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:09:37,755 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:09:37,931 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:09:37,938 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:09:37,959 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:09:37,976 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:09:37,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37 WrapperNode [2019-01-12 15:09:37,977 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:09:37,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:09:37,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:09:37,978 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:09:37,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37" (1/1) ... [2019-01-12 15:09:37,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37" (1/1) ... [2019-01-12 15:09:38,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:09:38,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:09:38,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:09:38,020 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:09:38,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37" (1/1) ... [2019-01-12 15:09:38,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37" (1/1) ... [2019-01-12 15:09:38,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37" (1/1) ... [2019-01-12 15:09:38,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37" (1/1) ... [2019-01-12 15:09:38,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37" (1/1) ... [2019-01-12 15:09:38,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37" (1/1) ... [2019-01-12 15:09:38,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37" (1/1) ... [2019-01-12 15:09:38,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:09:38,042 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:09:38,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:09:38,042 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:09:38,043 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37" (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-01-12 15:09:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:09:38,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:09:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2019-01-12 15:09:38,214 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2019-01-12 15:09:38,424 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:09:38,425 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:09:38,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:09:38 BoogieIcfgContainer [2019-01-12 15:09:38,426 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:09:38,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:09:38,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:09:38,431 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:09:38,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:09:37" (1/3) ... [2019-01-12 15:09:38,432 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5456bc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:09:38, skipping insertion in model container [2019-01-12 15:09:38,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:09:37" (2/3) ... [2019-01-12 15:09:38,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5456bc65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:09:38, skipping insertion in model container [2019-01-12 15:09:38,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:09:38" (3/3) ... [2019-01-12 15:09:38,435 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_20x0_false-unreach-call_true-termination.c [2019-01-12 15:09:38,447 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:09:38,455 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:09:38,471 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:09:38,501 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:09:38,502 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:09:38,502 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:09:38,502 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:09:38,502 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:09:38,502 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:09:38,502 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:09:38,502 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:09:38,503 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:09:38,521 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 15:09:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:09:38,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:38,528 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:38,531 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:38,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:38,537 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-01-12 15:09:38,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:38,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:38,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:38,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:38,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 15:09:38,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:09:38,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:09:38,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:09:38,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:09:38,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:09:38,884 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-12 15:09:39,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:39,038 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-12 15:09:39,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:09:39,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:09:39,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:39,051 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:09:39,051 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 15:09:39,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:09:39,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 15:09:39,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 15:09:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 15:09:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 15:09:39,097 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-01-12 15:09:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:39,097 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 15:09:39,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:09:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 15:09:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 15:09:39,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:39,100 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:39,100 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-01-12 15:09:39,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:39,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:39,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:39,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:09:39,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:39,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:39,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:39,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:39,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:09:39,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:39,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 15:09:39,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 15:09:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 15:09:39,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 15:09:39,359 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-01-12 15:09:39,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:39,766 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-12 15:09:39,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 15:09:39,767 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-12 15:09:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:39,768 INFO L225 Difference]: With dead ends: 21 [2019-01-12 15:09:39,768 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 15:09:39,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:09:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 15:09:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 15:09:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 15:09:39,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 15:09:39,775 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-12 15:09:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:39,775 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 15:09:39,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 15:09:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 15:09:39,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 15:09:39,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:39,777 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:39,777 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:39,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:39,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-01-12 15:09:39,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:39,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:39,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:39,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:39,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:39,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:09:39,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:39,972 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:39,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:09:40,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:09:40,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:40,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:40,037 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 15:09:40,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:40,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 15:09:40,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 15:09:40,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 15:09:40,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 15:09:40,059 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-12 15:09:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:40,331 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-12 15:09:40,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 15:09:40,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 15:09:40,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:40,335 INFO L225 Difference]: With dead ends: 24 [2019-01-12 15:09:40,336 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 15:09:40,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:09:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 15:09:40,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 15:09:40,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 15:09:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 15:09:40,344 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-01-12 15:09:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:40,345 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 15:09:40,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 15:09:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 15:09:40,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 15:09:40,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:40,347 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:40,347 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:40,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:40,347 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-01-12 15:09:40,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:40,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:40,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:40,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:40,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:09:40,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:40,518 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:40,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:09:40,561 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 15:09:40,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:40,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 15:09:40,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:40,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-12 15:09:40,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:09:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:09:40,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:09:40,618 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 8 states. [2019-01-12 15:09:41,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:41,146 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 15:09:41,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:09:41,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-12 15:09:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:41,149 INFO L225 Difference]: With dead ends: 27 [2019-01-12 15:09:41,149 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 15:09:41,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:09:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 15:09:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 15:09:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 15:09:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 15:09:41,156 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-01-12 15:09:41,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:41,157 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 15:09:41,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:09:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 15:09:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 15:09:41,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:41,159 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:41,159 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:41,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:41,159 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-01-12 15:09:41,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:41,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:41,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:09:41,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:41,302 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:41,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:09:41,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:09:41,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:41,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 15:09:41,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:41,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 15:09:41,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 15:09:41,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 15:09:41,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:09:41,393 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-01-12 15:09:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:41,536 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-12 15:09:41,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 15:09:41,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 15:09:41,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:41,538 INFO L225 Difference]: With dead ends: 30 [2019-01-12 15:09:41,538 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 15:09:41,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:09:41,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 15:09:41,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 15:09:41,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:09:41,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 15:09:41,546 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-01-12 15:09:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:41,547 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 15:09:41,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 15:09:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 15:09:41,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 15:09:41,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:41,548 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:41,549 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:41,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:41,549 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-01-12 15:09:41,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:41,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:41,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:41,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:41,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:41,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:09:41,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:41,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:41,942 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:09:41,985 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 15:09:41,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:41,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:42,012 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 15:09:42,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:42,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-12 15:09:42,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 15:09:42,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 15:09:42,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 15:09:42,034 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 10 states. [2019-01-12 15:09:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:42,248 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 15:09:42,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 15:09:42,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-01-12 15:09:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:42,250 INFO L225 Difference]: With dead ends: 33 [2019-01-12 15:09:42,251 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 15:09:42,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:09:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 15:09:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 15:09:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 15:09:42,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 15:09:42,259 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-01-12 15:09:42,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:42,259 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 15:09:42,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 15:09:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 15:09:42,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 15:09:42,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:42,262 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:42,263 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:42,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:42,263 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-01-12 15:09:42,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:42,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:42,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:42,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:42,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:09:42,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:42,464 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:42,474 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:09:42,527 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 15:09:42,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:42,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 15:09:42,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:42,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2019-01-12 15:09:42,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 15:09:42,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 15:09:42,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 15:09:42,578 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 11 states. [2019-01-12 15:09:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:42,784 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-12 15:09:42,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:09:42,785 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2019-01-12 15:09:42,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:42,787 INFO L225 Difference]: With dead ends: 36 [2019-01-12 15:09:42,787 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:09:42,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:09:42,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:09:42,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 15:09:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 15:09:42,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 15:09:42,794 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-01-12 15:09:42,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:42,794 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 15:09:42,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 15:09:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 15:09:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 15:09:42,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:42,797 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:42,797 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:42,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:42,797 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-01-12 15:09:42,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:42,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:42,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:42,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:42,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:43,015 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:09:43,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:43,015 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:43,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:43,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:43,093 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 15:09:43,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:43,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-01-12 15:09:43,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:09:43,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:09:43,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:09:43,113 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 12 states. [2019-01-12 15:09:43,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:43,489 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 15:09:43,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 15:09:43,490 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2019-01-12 15:09:43,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:43,491 INFO L225 Difference]: With dead ends: 39 [2019-01-12 15:09:43,491 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 15:09:43,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:09:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 15:09:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 15:09:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 15:09:43,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 15:09:43,500 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-01-12 15:09:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:43,500 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 15:09:43,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:09:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 15:09:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 15:09:43,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:43,502 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:43,503 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:43,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-01-12 15:09:43,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:43,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:43,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:43,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:43,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:43,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:09:43,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:43,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:43,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:09:43,989 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:09:43,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:43,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 15:09:44,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:44,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 15:09:44,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 15:09:44,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 15:09:44,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 15:09:44,067 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-01-12 15:09:44,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:44,370 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-12 15:09:44,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 15:09:44,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-01-12 15:09:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:44,373 INFO L225 Difference]: With dead ends: 42 [2019-01-12 15:09:44,373 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 15:09:44,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:09:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 15:09:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 15:09:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 15:09:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 15:09:44,381 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-01-12 15:09:44,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:44,382 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 15:09:44,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 15:09:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 15:09:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 15:09:44,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:44,383 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:44,384 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:44,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:44,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-01-12 15:09:44,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:44,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:44,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:44,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:44,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:44,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:09:44,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:44,594 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:44,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:09:44,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 15:09:44,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:44,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 15:09:44,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:44,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-01-12 15:09:44,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 15:09:44,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 15:09:44,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:09:44,780 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 14 states. [2019-01-12 15:09:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:45,113 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-12 15:09:45,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 15:09:45,115 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2019-01-12 15:09:45,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:45,117 INFO L225 Difference]: With dead ends: 45 [2019-01-12 15:09:45,117 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 15:09:45,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:09:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 15:09:45,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 15:09:45,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 15:09:45,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-12 15:09:45,126 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-01-12 15:09:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:45,126 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-12 15:09:45,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 15:09:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-12 15:09:45,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 15:09:45,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:45,128 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:45,128 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:45,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:45,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-01-12 15:09:45,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:45,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:45,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:45,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:45,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 15:09:45,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:45,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:45,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:09:45,482 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:09:45,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:45,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:45,527 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 15:09:45,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:45,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-12 15:09:45,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 15:09:45,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 15:09:45,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:09:45,548 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2019-01-12 15:09:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:45,800 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-12 15:09:45,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 15:09:45,801 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-01-12 15:09:45,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:45,803 INFO L225 Difference]: With dead ends: 48 [2019-01-12 15:09:45,804 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 15:09:45,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2019-01-12 15:09:45,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 15:09:45,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 15:09:45,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 15:09:45,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-12 15:09:45,811 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-01-12 15:09:45,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:45,812 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-12 15:09:45,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 15:09:45,812 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-12 15:09:45,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 15:09:45,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:45,814 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:45,814 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:45,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-01-12 15:09:45,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:45,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:45,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:45,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:45,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 15:09:46,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:46,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:46,282 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:09:46,344 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-12 15:09:46,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:46,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:46,389 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 15:09:46,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:46,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 15:09:46,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 15:09:46,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 15:09:46,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-12 15:09:46,424 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2019-01-12 15:09:46,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:46,879 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-12 15:09:46,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 15:09:46,882 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-01-12 15:09:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:46,884 INFO L225 Difference]: With dead ends: 51 [2019-01-12 15:09:46,884 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 15:09:46,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:09:46,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 15:09:46,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 15:09:46,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 15:09:46,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-12 15:09:46,893 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-01-12 15:09:46,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:46,895 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-12 15:09:46,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 15:09:46,895 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-12 15:09:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 15:09:46,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:46,898 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:46,898 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:46,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:46,899 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-01-12 15:09:46,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:46,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:46,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:46,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:46,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:46,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 15:09:47,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:47,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:47,213 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:09:47,302 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-12 15:09:47,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:47,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 15:09:47,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:47,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 15:09:47,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 15:09:47,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 15:09:47,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2019-01-12 15:09:47,363 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 17 states. [2019-01-12 15:09:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:47,667 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-12 15:09:47,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 15:09:47,669 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 81 [2019-01-12 15:09:47,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:47,671 INFO L225 Difference]: With dead ends: 54 [2019-01-12 15:09:47,671 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 15:09:47,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2019-01-12 15:09:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 15:09:47,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-12 15:09:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 15:09:47,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-12 15:09:47,682 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-01-12 15:09:47,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:47,683 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-12 15:09:47,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 15:09:47,683 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-12 15:09:47,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 15:09:47,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:47,687 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:47,687 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:47,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:47,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-01-12 15:09:47,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:47,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:47,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:47,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:47,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 15:09:48,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:48,006 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:48,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:48,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:48,094 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 15:09:48,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:48,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-01-12 15:09:48,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 15:09:48,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 15:09:48,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:09:48,123 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 18 states. [2019-01-12 15:09:48,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:48,430 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-01-12 15:09:48,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 15:09:48,432 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 87 [2019-01-12 15:09:48,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:48,434 INFO L225 Difference]: With dead ends: 57 [2019-01-12 15:09:48,434 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 15:09:48,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2019-01-12 15:09:48,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 15:09:48,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 15:09:48,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 15:09:48,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-12 15:09:48,442 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-01-12 15:09:48,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:48,442 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-12 15:09:48,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 15:09:48,443 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-12 15:09:48,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 15:09:48,444 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:48,444 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:48,444 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:48,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:48,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-01-12 15:09:48,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:48,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:48,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:48,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:48,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:48,721 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 15:09:48,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:48,722 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:48,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:09:48,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:09:48,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:48,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 15:09:48,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:48,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2019-01-12 15:09:48,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-12 15:09:48,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-12 15:09:48,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2019-01-12 15:09:48,855 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 19 states. [2019-01-12 15:09:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:49,156 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-01-12 15:09:49,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 15:09:49,157 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 93 [2019-01-12 15:09:49,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:49,159 INFO L225 Difference]: With dead ends: 60 [2019-01-12 15:09:49,159 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 15:09:49,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 15:09:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 15:09:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-12 15:09:49,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 15:09:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-12 15:09:49,166 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-01-12 15:09:49,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:49,167 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-12 15:09:49,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-12 15:09:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-12 15:09:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 15:09:49,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:49,169 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:49,169 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:49,169 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-01-12 15:09:49,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:49,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:49,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:49,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:49,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 15:09:49,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:49,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:49,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 15:09:49,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-12 15:09:49,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:49,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 15:09:49,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:49,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-01-12 15:09:49,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-12 15:09:49,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-12 15:09:49,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2019-01-12 15:09:49,600 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 20 states. [2019-01-12 15:09:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:50,091 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-12 15:09:50,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 15:09:50,093 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2019-01-12 15:09:50,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:50,095 INFO L225 Difference]: With dead ends: 63 [2019-01-12 15:09:50,095 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 15:09:50,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2019-01-12 15:09:50,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 15:09:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-12 15:09:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 15:09:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-12 15:09:50,102 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-01-12 15:09:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:50,103 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-12 15:09:50,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-12 15:09:50,103 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-12 15:09:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 15:09:50,104 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:50,104 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:50,105 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:50,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:50,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-01-12 15:09:50,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:50,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:50,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:50,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:50,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 15:09:51,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:51,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:51,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 15:09:51,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 15:09:51,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:51,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:51,232 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 15:09:51,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:51,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-01-12 15:09:51,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-12 15:09:51,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-12 15:09:51,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2019-01-12 15:09:51,256 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 21 states. [2019-01-12 15:09:51,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:51,636 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-01-12 15:09:51,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 15:09:51,637 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 105 [2019-01-12 15:09:51,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:51,639 INFO L225 Difference]: With dead ends: 66 [2019-01-12 15:09:51,639 INFO L226 Difference]: Without dead ends: 62 [2019-01-12 15:09:51,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2019-01-12 15:09:51,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-12 15:09:51,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-12 15:09:51,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-12 15:09:51,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-01-12 15:09:51,646 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-01-12 15:09:51,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:51,646 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-01-12 15:09:51,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-12 15:09:51,647 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-01-12 15:09:51,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 15:09:51,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:51,652 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:51,652 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:51,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:51,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-01-12 15:09:51,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:51,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:51,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:51,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:51,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 15:09:51,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:51,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:51,950 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 15:09:52,025 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-12 15:09:52,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:52,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:52,072 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 15:09:52,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:52,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-12 15:09:52,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 15:09:52,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 15:09:52,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:09:52,096 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 22 states. [2019-01-12 15:09:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:52,432 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-01-12 15:09:52,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 15:09:52,433 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2019-01-12 15:09:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:52,435 INFO L225 Difference]: With dead ends: 69 [2019-01-12 15:09:52,437 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 15:09:52,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 15:09:52,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 15:09:52,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-12 15:09:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-12 15:09:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-12 15:09:52,445 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-01-12 15:09:52,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:52,446 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-12 15:09:52,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 15:09:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-12 15:09:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 15:09:52,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:52,449 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:52,450 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:52,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:52,450 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-01-12 15:09:52,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:52,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:52,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:52,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:53,023 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 15:09:53,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:53,024 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:53,038 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 15:09:53,091 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-12 15:09:53,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:09:53,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 15:09:53,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:53,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-12 15:09:53,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 15:09:53,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 15:09:53,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2019-01-12 15:09:53,175 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 23 states. [2019-01-12 15:09:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:53,924 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-01-12 15:09:53,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 15:09:53,926 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 117 [2019-01-12 15:09:53,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:53,928 INFO L225 Difference]: With dead ends: 72 [2019-01-12 15:09:53,928 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 15:09:53,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 15:09:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 15:09:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 15:09:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 15:09:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-12 15:09:53,935 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-01-12 15:09:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:53,935 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-12 15:09:53,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 15:09:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-12 15:09:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 15:09:53,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:53,937 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:53,937 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:53,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:53,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-01-12 15:09:53,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:53,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:53,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:53,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:09:53,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 15:09:54,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:09:54,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 15:09:54,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:09:54,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:09:54,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 15:09:54,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:09:54,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-12 15:09:54,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 15:09:54,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 15:09:54,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2019-01-12 15:09:54,428 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 24 states. [2019-01-12 15:09:55,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:09:55,469 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-12 15:09:55,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 15:09:55,470 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 123 [2019-01-12 15:09:55,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:09:55,472 INFO L225 Difference]: With dead ends: 75 [2019-01-12 15:09:55,472 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 15:09:55,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 15:09:55,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 15:09:55,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 15:09:55,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 15:09:55,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-12 15:09:55,478 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-01-12 15:09:55,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:09:55,479 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-12 15:09:55,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 15:09:55,479 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-12 15:09:55,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 15:09:55,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:09:55,480 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:09:55,481 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:09:55,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:09:55,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-01-12 15:09:55,481 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:09:55,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:09:55,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:55,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:09:55,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:09:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:09:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 15:09:55,546 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 15:09:55,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:09:55 BoogieIcfgContainer [2019-01-12 15:09:55,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:09:55,602 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:09:55,602 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:09:55,602 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:09:55,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:09:38" (3/4) ... [2019-01-12 15:09:55,605 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 15:09:55,684 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:09:55,685 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:09:55,689 INFO L168 Benchmark]: Toolchain (without parser) took 17972.89 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 352.8 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -263.2 MB). Peak memory consumption was 89.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:55,691 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:09:55,691 INFO L168 Benchmark]: CACSL2BoogieTranslator took 258.91 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:55,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.63 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:09:55,692 INFO L168 Benchmark]: Boogie Preprocessor took 22.42 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:09:55,692 INFO L168 Benchmark]: RCFGBuilder took 384.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:55,693 INFO L168 Benchmark]: TraceAbstraction took 17174.12 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 217.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.1 MB). Peak memory consumption was 103.5 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:55,696 INFO L168 Benchmark]: Witness Printer took 86.17 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2019-01-12 15:09:55,705 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 258.91 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.63 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.42 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 384.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17174.12 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 217.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -114.1 MB). Peak memory consumption was 103.5 MB. Max. memory is 11.5 GB. * Witness Printer took 86.17 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 20; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) VAL [\old(m)=0, \old(n)=20] [L4] COND FALSE !(n <= 0) VAL [\old(m)=0, \old(n)=20, m=0, n=20] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19] [L4] COND FALSE !(n <= 0) VAL [\old(m)=1, \old(n)=19, m=1, n=19] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18] [L4] COND FALSE !(n <= 0) VAL [\old(m)=2, \old(n)=18, m=2, n=18] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17] [L4] COND FALSE !(n <= 0) VAL [\old(m)=3, \old(n)=17, m=3, n=17] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16] [L4] COND FALSE !(n <= 0) VAL [\old(m)=4, \old(n)=16, m=4, n=16] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15] [L4] COND FALSE !(n <= 0) VAL [\old(m)=5, \old(n)=15, m=5, n=15] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14] [L4] COND FALSE !(n <= 0) VAL [\old(m)=6, \old(n)=14, m=6, n=14] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13] [L4] COND FALSE !(n <= 0) VAL [\old(m)=7, \old(n)=13, m=7, n=13] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12] [L4] COND FALSE !(n <= 0) VAL [\old(m)=8, \old(n)=12, m=8, n=12] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11] [L4] COND FALSE !(n <= 0) VAL [\old(m)=9, \old(n)=11, m=9, n=11] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10] [L4] COND FALSE !(n <= 0) VAL [\old(m)=10, \old(n)=10, m=10, n=10] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9] [L4] COND FALSE !(n <= 0) VAL [\old(m)=11, \old(n)=9, m=11, n=9] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8] [L4] COND FALSE !(n <= 0) VAL [\old(m)=12, \old(n)=8, m=12, n=8] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7] [L4] COND FALSE !(n <= 0) VAL [\old(m)=13, \old(n)=7, m=13, n=7] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6] [L4] COND FALSE !(n <= 0) VAL [\old(m)=14, \old(n)=6, m=14, n=6] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5] [L4] COND FALSE !(n <= 0) VAL [\old(m)=15, \old(n)=5, m=15, n=5] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4] [L4] COND FALSE !(n <= 0) VAL [\old(m)=16, \old(n)=4, m=16, n=4] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3] [L4] COND FALSE !(n <= 0) VAL [\old(m)=17, \old(n)=3, m=17, n=3] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2] [L4] COND FALSE !(n <= 0) VAL [\old(m)=18, \old(n)=2, m=18, n=2] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1] [L4] COND FALSE !(n <= 0) VAL [\old(m)=19, \old(n)=1, m=19, n=1] [L7] CALL, EXPR sum(n - 1, m + 1) VAL [\old(m)=20, \old(n)=0] [L4] COND TRUE n <= 0 [L5] return m + n; VAL [\old(m)=20, \old(n)=0, \result=20, m=20, n=0] [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=19, \old(n)=1, m=19, n=1, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=18, \old(n)=2, m=18, n=2, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=17, \old(n)=3, m=17, n=3, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=16, \old(n)=4, m=16, n=4, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=15, \old(n)=5, m=15, n=5, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=14, \old(n)=6, m=14, n=6, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=13, \old(n)=7, m=13, n=7, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=12, \old(n)=8, m=12, n=8, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=11, \old(n)=9, m=11, n=9, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=10, \old(n)=10, m=10, n=10, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=9, \old(n)=11, m=9, n=11, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=8, \old(n)=12, m=8, n=12, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=7, \old(n)=13, m=7, n=13, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=6, \old(n)=14, m=6, n=14, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=5, \old(n)=15, m=5, n=15, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=4, \old(n)=16, m=4, n=16, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=3, \old(n)=17, m=3, n=17, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=2, \old(n)=18, m=2, n=18, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=1, \old(n)=19, m=1, n=19, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) VAL [\old(m)=0, \old(n)=20, m=0, n=20, sum(n - 1, m + 1)=20] [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. UNSAFE Result, 17.1s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 7.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 162 SDtfs, 524 SDslu, 1074 SDs, 0 SdLazy, 1493 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1982 GetRequests, 1522 SyntacticMatches, 0 SemanticMatches, 460 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1330 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2760 NumberOfCodeBlocks, 2760 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 2592 ConstructedInterpolants, 0 QuantifiedInterpolants, 564352 SizeOfPredicates, 228 NumberOfNonLiveVariables, 3971 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 39 InterpolantComputations, 1 PerfectInterpolantSequences, 7600/15200 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...