./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i --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/reducercommutativity/rangesum10_false-unreach-call_true-termination.i -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 af68da58954d6230e3860792840330ae6de845ab .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-14 12:58:13,087 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 12:58:13,089 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 12:58:13,105 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 12:58:13,105 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 12:58:13,106 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 12:58:13,108 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 12:58:13,109 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 12:58:13,111 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 12:58:13,112 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 12:58:13,113 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 12:58:13,113 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 12:58:13,114 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 12:58:13,115 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 12:58:13,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 12:58:13,117 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 12:58:13,121 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 12:58:13,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 12:58:13,131 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 12:58:13,135 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 12:58:13,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 12:58:13,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 12:58:13,145 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 12:58:13,146 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 12:58:13,146 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 12:58:13,148 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 12:58:13,150 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 12:58:13,150 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 12:58:13,151 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 12:58:13,152 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 12:58:13,152 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 12:58:13,153 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 12:58:13,153 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 12:58:13,153 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 12:58:13,154 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 12:58:13,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 12:58:13,155 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 12:58:13,183 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 12:58:13,185 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 12:58:13,186 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 12:58:13,186 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 12:58:13,186 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 12:58:13,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 12:58:13,189 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 12:58:13,189 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 12:58:13,189 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 12:58:13,189 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 12:58:13,189 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 12:58:13,190 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 12:58:13,191 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 12:58:13,191 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 12:58:13,191 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 12:58:13,191 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 12:58:13,191 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 12:58:13,192 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 12:58:13,194 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 12:58:13,194 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 12:58:13,194 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 12:58:13,194 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 12:58:13,194 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 12:58:13,194 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 12:58:13,196 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 12:58:13,196 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 12:58:13,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 12:58:13,196 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 -> af68da58954d6230e3860792840330ae6de845ab [2019-01-14 12:58:13,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 12:58:13,288 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 12:58:13,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 12:58:13,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 12:58:13,298 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 12:58:13,299 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i [2019-01-14 12:58:13,366 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07d5b19cd/2f849b6754cd47158d7820a7cadf6b78/FLAGe8ad768e6 [2019-01-14 12:58:13,779 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 12:58:13,780 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/rangesum10_false-unreach-call_true-termination.i [2019-01-14 12:58:13,786 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07d5b19cd/2f849b6754cd47158d7820a7cadf6b78/FLAGe8ad768e6 [2019-01-14 12:58:14,165 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07d5b19cd/2f849b6754cd47158d7820a7cadf6b78 [2019-01-14 12:58:14,171 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 12:58:14,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 12:58:14,176 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 12:58:14,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 12:58:14,182 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 12:58:14,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:58:14" (1/1) ... [2019-01-14 12:58:14,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30305280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14, skipping insertion in model container [2019-01-14 12:58:14,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:58:14" (1/1) ... [2019-01-14 12:58:14,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 12:58:14,226 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 12:58:14,457 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 12:58:14,478 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 12:58:14,512 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 12:58:14,531 INFO L195 MainTranslator]: Completed translation [2019-01-14 12:58:14,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14 WrapperNode [2019-01-14 12:58:14,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 12:58:14,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 12:58:14,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 12:58:14,534 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 12:58:14,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14" (1/1) ... [2019-01-14 12:58:14,554 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14" (1/1) ... [2019-01-14 12:58:14,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 12:58:14,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 12:58:14,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 12:58:14,602 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 12:58:14,615 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14" (1/1) ... [2019-01-14 12:58:14,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14" (1/1) ... [2019-01-14 12:58:14,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14" (1/1) ... [2019-01-14 12:58:14,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14" (1/1) ... [2019-01-14 12:58:14,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14" (1/1) ... [2019-01-14 12:58:14,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14" (1/1) ... [2019-01-14 12:58:14,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14" (1/1) ... [2019-01-14 12:58:14,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 12:58:14,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 12:58:14,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 12:58:14,743 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 12:58:14,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14" (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-14 12:58:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 12:58:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 12:58:14,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 12:58:14,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 12:58:14,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 12:58:14,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 12:58:15,434 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 12:58:15,434 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-14 12:58:15,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:58:15 BoogieIcfgContainer [2019-01-14 12:58:15,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 12:58:15,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 12:58:15,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 12:58:15,440 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 12:58:15,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:58:14" (1/3) ... [2019-01-14 12:58:15,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be38542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:58:15, skipping insertion in model container [2019-01-14 12:58:15,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:58:14" (2/3) ... [2019-01-14 12:58:15,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be38542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:58:15, skipping insertion in model container [2019-01-14 12:58:15,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:58:15" (3/3) ... [2019-01-14 12:58:15,444 INFO L112 eAbstractionObserver]: Analyzing ICFG rangesum10_false-unreach-call_true-termination.i [2019-01-14 12:58:15,454 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 12:58:15,463 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 12:58:15,480 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 12:58:15,512 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 12:58:15,513 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 12:58:15,513 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 12:58:15,513 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 12:58:15,514 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 12:58:15,514 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 12:58:15,514 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 12:58:15,514 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 12:58:15,514 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 12:58:15,532 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-01-14 12:58:15,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 12:58:15,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:15,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:15,543 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:15,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:15,549 INFO L82 PathProgramCache]: Analyzing trace with hash -919167012, now seen corresponding path program 1 times [2019-01-14 12:58:15,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:15,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:15,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:15,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 12:58:15,675 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-14 12:58:15,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 12:58:15,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 12:58:15,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 12:58:15,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 12:58:15,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 12:58:15,703 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-01-14 12:58:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:15,724 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. [2019-01-14 12:58:15,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 12:58:15,726 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-01-14 12:58:15,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:15,737 INFO L225 Difference]: With dead ends: 56 [2019-01-14 12:58:15,737 INFO L226 Difference]: Without dead ends: 26 [2019-01-14 12:58:15,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 12:58:15,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-14 12:58:15,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-14 12:58:15,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 12:58:15,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-01-14 12:58:15,780 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 17 [2019-01-14 12:58:15,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:15,780 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-01-14 12:58:15,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 12:58:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-01-14 12:58:15,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 12:58:15,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:15,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:15,782 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:15,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:15,782 INFO L82 PathProgramCache]: Analyzing trace with hash 164788593, now seen corresponding path program 1 times [2019-01-14 12:58:15,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:15,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:15,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:15,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:15,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:15,795 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:15,795 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:15,796 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:15,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 12:58:15,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:15,900 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-14 12:58:15,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 12:58:15,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 12:58:15,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 12:58:15,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 12:58:15,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 12:58:15,925 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 3 states. [2019-01-14 12:58:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:15,998 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2019-01-14 12:58:15,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 12:58:15,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 12:58:15,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:16,000 INFO L225 Difference]: With dead ends: 50 [2019-01-14 12:58:16,000 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 12:58:16,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 12:58:16,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 12:58:16,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-01-14 12:58:16,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 12:58:16,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-01-14 12:58:16,008 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 17 [2019-01-14 12:58:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:16,008 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-01-14 12:58:16,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 12:58:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-01-14 12:58:16,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 12:58:16,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:16,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:16,009 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:16,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:16,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1403287377, now seen corresponding path program 1 times [2019-01-14 12:58:16,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:16,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:16,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:16,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:16,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:16,030 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:16,031 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:16,031 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:16,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 12:58:16,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 12:58:16,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 12:58:16,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 12:58:16,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 12:58:16,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 12:58:16,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 12:58:16,176 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 3 states. [2019-01-14 12:58:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:16,335 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2019-01-14 12:58:16,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 12:58:16,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 12:58:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:16,338 INFO L225 Difference]: With dead ends: 57 [2019-01-14 12:58:16,338 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 12:58:16,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 12:58:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 12:58:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2019-01-14 12:58:16,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 12:58:16,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-01-14 12:58:16,348 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 19 [2019-01-14 12:58:16,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:16,349 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-14 12:58:16,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 12:58:16,349 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2019-01-14 12:58:16,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 12:58:16,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:16,350 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:16,350 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:16,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:16,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1132417868, now seen corresponding path program 1 times [2019-01-14 12:58:16,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:16,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:16,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:16,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:16,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:16,365 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:16,365 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:16,365 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:16,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 12:58:16,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 12:58:16,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 12:58:16,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 12:58:16,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 12:58:16,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 12:58:16,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 12:58:16,510 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand 3 states. [2019-01-14 12:58:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:16,655 INFO L93 Difference]: Finished difference Result 75 states and 100 transitions. [2019-01-14 12:58:16,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 12:58:16,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-01-14 12:58:16,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:16,658 INFO L225 Difference]: With dead ends: 75 [2019-01-14 12:58:16,658 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 12:58:16,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 12:58:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 12:58:16,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-01-14 12:58:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 12:58:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2019-01-14 12:58:16,678 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 28 [2019-01-14 12:58:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:16,678 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2019-01-14 12:58:16,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 12:58:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2019-01-14 12:58:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 12:58:16,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:16,680 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:16,680 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:16,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1168464304, now seen corresponding path program 1 times [2019-01-14 12:58:16,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:16,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:16,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:16,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:16,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 12:58:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-14 12:58:16,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 12:58:16,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 12:58:16,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 12:58:16,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 12:58:16,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 12:58:16,787 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand 4 states. [2019-01-14 12:58:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:16,943 INFO L93 Difference]: Finished difference Result 85 states and 118 transitions. [2019-01-14 12:58:16,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 12:58:16,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-01-14 12:58:16,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:16,946 INFO L225 Difference]: With dead ends: 85 [2019-01-14 12:58:16,946 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 12:58:16,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 12:58:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 12:58:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 39. [2019-01-14 12:58:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-14 12:58:16,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2019-01-14 12:58:16,954 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 28 [2019-01-14 12:58:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:16,954 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2019-01-14 12:58:16,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 12:58:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2019-01-14 12:58:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-14 12:58:16,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:16,956 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:16,956 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:16,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:16,957 INFO L82 PathProgramCache]: Analyzing trace with hash -483510003, now seen corresponding path program 1 times [2019-01-14 12:58:16,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:16,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:16,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:16,970 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:16,970 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:16,970 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:16,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 12:58:17,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:17,070 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 12:58:17,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 12:58:17,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 12:58:17,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 12:58:17,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 12:58:17,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 12:58:17,101 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 3 states. [2019-01-14 12:58:17,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:17,130 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2019-01-14 12:58:17,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 12:58:17,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-01-14 12:58:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:17,133 INFO L225 Difference]: With dead ends: 54 [2019-01-14 12:58:17,133 INFO L226 Difference]: Without dead ends: 41 [2019-01-14 12:58:17,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 12:58:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-14 12:58:17,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-01-14 12:58:17,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 12:58:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2019-01-14 12:58:17,140 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 37 [2019-01-14 12:58:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:17,140 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2019-01-14 12:58:17,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 12:58:17,140 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2019-01-14 12:58:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 12:58:17,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:17,142 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:17,142 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:17,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:17,143 INFO L82 PathProgramCache]: Analyzing trace with hash -623311861, now seen corresponding path program 1 times [2019-01-14 12:58:17,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:17,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:17,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:17,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:17,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:17,158 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:17,158 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:17,158 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:17,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 12:58:17,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 12:58:17,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:17,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-01-14 12:58:17,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 12:58:17,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 12:58:17,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 12:58:17,339 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand 4 states. [2019-01-14 12:58:17,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:17,458 INFO L93 Difference]: Finished difference Result 78 states and 98 transitions. [2019-01-14 12:58:17,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 12:58:17,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-01-14 12:58:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:17,460 INFO L225 Difference]: With dead ends: 78 [2019-01-14 12:58:17,460 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 12:58:17,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 12:58:17,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 12:58:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-01-14 12:58:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 12:58:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2019-01-14 12:58:17,477 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 39 [2019-01-14 12:58:17,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:17,477 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2019-01-14 12:58:17,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 12:58:17,477 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2019-01-14 12:58:17,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-14 12:58:17,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:17,479 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:17,479 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:17,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:17,479 INFO L82 PathProgramCache]: Analyzing trace with hash -526389047, now seen corresponding path program 2 times [2019-01-14 12:58:17,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:17,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:17,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:17,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:17,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:17,516 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:17,520 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:17,520 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:17,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 12:58:17,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 12:58:17,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:17,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-14 12:58:17,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:17,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-01-14 12:58:17,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 12:58:17,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 12:58:17,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 12:58:17,777 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 4 states. [2019-01-14 12:58:18,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:18,255 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2019-01-14 12:58:18,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 12:58:18,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-01-14 12:58:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:18,258 INFO L225 Difference]: With dead ends: 86 [2019-01-14 12:58:18,259 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 12:58:18,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 12:58:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 12:58:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-14 12:58:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-14 12:58:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2019-01-14 12:58:18,270 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 41 [2019-01-14 12:58:18,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:18,270 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2019-01-14 12:58:18,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 12:58:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2019-01-14 12:58:18,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 12:58:18,273 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:18,273 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:18,273 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:18,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:18,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1393104750, now seen corresponding path program 3 times [2019-01-14 12:58:18,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:18,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:18,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:18,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:18,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:18,290 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:18,290 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:18,290 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:18,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 12:58:18,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-14 12:58:18,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:18,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-14 12:58:18,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:18,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-01-14 12:58:18,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 12:58:18,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 12:58:18,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 12:58:18,531 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand 4 states. [2019-01-14 12:58:18,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:18,699 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2019-01-14 12:58:18,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 12:58:18,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-01-14 12:58:18,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:18,702 INFO L225 Difference]: With dead ends: 70 [2019-01-14 12:58:18,703 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 12:58:18,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 12:58:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 12:58:18,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-01-14 12:58:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 12:58:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-01-14 12:58:18,721 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 50 [2019-01-14 12:58:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:18,721 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-01-14 12:58:18,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 12:58:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-01-14 12:58:18,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-14 12:58:18,727 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:18,727 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:18,728 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:18,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:18,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1656359148, now seen corresponding path program 4 times [2019-01-14 12:58:18,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:18,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:18,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:18,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:18,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:18,744 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:18,744 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:18,744 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:18,762 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 12:58:18,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 12:58:18,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:18,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:18,862 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-14 12:58:18,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:18,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-01-14 12:58:18,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 12:58:18,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 12:58:18,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 12:58:18,893 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 5 states. [2019-01-14 12:58:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:19,148 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2019-01-14 12:58:19,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 12:58:19,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-01-14 12:58:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:19,151 INFO L225 Difference]: With dead ends: 105 [2019-01-14 12:58:19,151 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 12:58:19,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 12:58:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 12:58:19,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-01-14 12:58:19,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 12:58:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2019-01-14 12:58:19,160 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 52 [2019-01-14 12:58:19,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:19,160 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2019-01-14 12:58:19,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 12:58:19,160 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2019-01-14 12:58:19,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-14 12:58:19,161 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:19,162 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:19,162 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:19,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:19,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2133276057, now seen corresponding path program 5 times [2019-01-14 12:58:19,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:19,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:19,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:19,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:19,175 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:19,175 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:19,175 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:19,191 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 12:58:19,233 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-01-14 12:58:19,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:19,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-01-14 12:58:19,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:19,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-01-14 12:58:19,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 12:58:19,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 12:58:19,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 12:58:19,345 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand 6 states. [2019-01-14 12:58:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:19,505 INFO L93 Difference]: Finished difference Result 120 states and 142 transitions. [2019-01-14 12:58:19,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 12:58:19,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-01-14 12:58:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:19,508 INFO L225 Difference]: With dead ends: 120 [2019-01-14 12:58:19,508 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 12:58:19,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 12:58:19,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 12:58:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-01-14 12:58:19,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 12:58:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2019-01-14 12:58:19,519 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 61 [2019-01-14 12:58:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:19,519 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2019-01-14 12:58:19,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 12:58:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2019-01-14 12:58:19,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-14 12:58:19,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:19,522 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:19,523 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:19,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:19,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1347737356, now seen corresponding path program 6 times [2019-01-14 12:58:19,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:19,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:19,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:19,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:19,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:19,546 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:19,548 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:19,548 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:19,575 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 12:58:19,628 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2019-01-14 12:58:19,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:19,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:19,775 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-01-14 12:58:19,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 12:58:19,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 12:58:19,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 12:58:19,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 12:58:19,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 12:58:19,810 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand 4 states. [2019-01-14 12:58:19,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:19,915 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2019-01-14 12:58:19,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 12:58:19,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-01-14 12:58:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:19,918 INFO L225 Difference]: With dead ends: 126 [2019-01-14 12:58:19,918 INFO L226 Difference]: Without dead ends: 80 [2019-01-14 12:58:19,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 12:58:19,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-14 12:58:19,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2019-01-14 12:58:19,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-14 12:58:19,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2019-01-14 12:58:19,932 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 70 [2019-01-14 12:58:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:19,933 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2019-01-14 12:58:19,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 12:58:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2019-01-14 12:58:19,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-14 12:58:19,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:19,934 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:19,935 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:19,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:19,935 INFO L82 PathProgramCache]: Analyzing trace with hash -838264266, now seen corresponding path program 1 times [2019-01-14 12:58:19,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:19,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:19,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:19,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:19,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:19,951 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:19,951 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:19,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:19,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 12:58:20,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:20,095 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 12:58:20,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:20,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-01-14 12:58:20,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 12:58:20,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 12:58:20,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 12:58:20,132 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 5 states. [2019-01-14 12:58:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:20,178 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2019-01-14 12:58:20,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 12:58:20,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-01-14 12:58:20,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:20,180 INFO L225 Difference]: With dead ends: 138 [2019-01-14 12:58:20,181 INFO L226 Difference]: Without dead ends: 74 [2019-01-14 12:58:20,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 12:58:20,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-14 12:58:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-01-14 12:58:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-14 12:58:20,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2019-01-14 12:58:20,189 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 70 [2019-01-14 12:58:20,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:20,189 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2019-01-14 12:58:20,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 12:58:20,189 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2019-01-14 12:58:20,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-14 12:58:20,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:20,190 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:20,190 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:20,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:20,191 INFO L82 PathProgramCache]: Analyzing trace with hash 506729912, now seen corresponding path program 2 times [2019-01-14 12:58:20,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:20,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:20,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:20,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:20,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:20,208 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:20,208 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:20,208 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:20,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 12:58:20,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 12:58:20,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:20,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-01-14 12:58:20,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:20,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-01-14 12:58:20,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 12:58:20,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 12:58:20,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 12:58:20,336 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 6 states. [2019-01-14 12:58:20,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:20,368 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2019-01-14 12:58:20,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 12:58:20,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-01-14 12:58:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:20,371 INFO L225 Difference]: With dead ends: 140 [2019-01-14 12:58:20,371 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 12:58:20,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 12:58:20,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 12:58:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-01-14 12:58:20,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-14 12:58:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2019-01-14 12:58:20,381 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 72 [2019-01-14 12:58:20,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:20,382 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2019-01-14 12:58:20,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 12:58:20,382 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2019-01-14 12:58:20,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-14 12:58:20,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:20,383 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:20,383 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:20,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:20,383 INFO L82 PathProgramCache]: Analyzing trace with hash 260978874, now seen corresponding path program 3 times [2019-01-14 12:58:20,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:20,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:20,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:20,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:20,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:20,413 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:20,416 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:20,416 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:20,435 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 12:58:20,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 12:58:20,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:20,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-01-14 12:58:20,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:20,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-01-14 12:58:20,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 12:58:20,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 12:58:20,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 12:58:20,534 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand 5 states. [2019-01-14 12:58:20,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:20,572 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2019-01-14 12:58:20,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 12:58:20,573 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-01-14 12:58:20,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:20,574 INFO L225 Difference]: With dead ends: 100 [2019-01-14 12:58:20,574 INFO L226 Difference]: Without dead ends: 78 [2019-01-14 12:58:20,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 12:58:20,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-14 12:58:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-01-14 12:58:20,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-14 12:58:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2019-01-14 12:58:20,580 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 74 [2019-01-14 12:58:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:20,580 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2019-01-14 12:58:20,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 12:58:20,580 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2019-01-14 12:58:20,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-14 12:58:20,581 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:20,581 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:20,581 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:20,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:20,582 INFO L82 PathProgramCache]: Analyzing trace with hash -64859204, now seen corresponding path program 4 times [2019-01-14 12:58:20,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:20,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:20,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:20,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:20,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:20,593 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:20,593 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:20,593 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:20,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 12:58:20,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 12:58:20,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:20,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-01-14 12:58:20,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:20,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-01-14 12:58:20,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 12:58:20,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 12:58:20,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 12:58:20,967 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand 7 states. [2019-01-14 12:58:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:21,127 INFO L93 Difference]: Finished difference Result 143 states and 159 transitions. [2019-01-14 12:58:21,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 12:58:21,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-01-14 12:58:21,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:21,132 INFO L225 Difference]: With dead ends: 143 [2019-01-14 12:58:21,132 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 12:58:21,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 12:58:21,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 12:58:21,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-01-14 12:58:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-14 12:58:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2019-01-14 12:58:21,141 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 76 [2019-01-14 12:58:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:21,141 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2019-01-14 12:58:21,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 12:58:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2019-01-14 12:58:21,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-14 12:58:21,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:21,144 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:21,144 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:21,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:21,145 INFO L82 PathProgramCache]: Analyzing trace with hash 170985087, now seen corresponding path program 5 times [2019-01-14 12:58:21,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:21,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:21,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:21,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:21,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:21,161 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:21,161 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:21,161 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:21,186 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 12:58:21,244 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-01-14 12:58:21,244 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:21,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-01-14 12:58:21,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:21,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-01-14 12:58:21,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 12:58:21,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 12:58:21,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 12:58:21,358 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 8 states. [2019-01-14 12:58:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:21,788 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2019-01-14 12:58:21,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 12:58:21,792 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-01-14 12:58:21,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:21,793 INFO L225 Difference]: With dead ends: 155 [2019-01-14 12:58:21,793 INFO L226 Difference]: Without dead ends: 95 [2019-01-14 12:58:21,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 12:58:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-14 12:58:21,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-14 12:58:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-14 12:58:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2019-01-14 12:58:21,800 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 85 [2019-01-14 12:58:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:21,800 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2019-01-14 12:58:21,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 12:58:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2019-01-14 12:58:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-14 12:58:21,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:21,801 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:21,801 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:21,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1105639836, now seen corresponding path program 6 times [2019-01-14 12:58:21,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:21,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:21,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:21,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:21,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:21,814 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:21,814 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:21,814 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:21,832 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 12:58:21,955 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-14 12:58:21,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:21,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-01-14 12:58:22,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:22,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-01-14 12:58:22,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 12:58:22,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 12:58:22,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-14 12:58:22,080 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand 9 states. [2019-01-14 12:58:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:22,379 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2019-01-14 12:58:22,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 12:58:22,380 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-01-14 12:58:22,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:22,383 INFO L225 Difference]: With dead ends: 174 [2019-01-14 12:58:22,384 INFO L226 Difference]: Without dead ends: 113 [2019-01-14 12:58:22,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-14 12:58:22,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-14 12:58:22,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-14 12:58:22,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-14 12:58:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2019-01-14 12:58:22,393 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 94 [2019-01-14 12:58:22,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:22,395 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2019-01-14 12:58:22,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 12:58:22,395 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2019-01-14 12:58:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-14 12:58:22,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:22,398 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:22,398 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:22,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1021810244, now seen corresponding path program 7 times [2019-01-14 12:58:22,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:22,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:22,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:22,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:22,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:22,414 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:22,414 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:22,414 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:22,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 12:58:22,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:22,669 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-01-14 12:58:22,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:22,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-01-14 12:58:22,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 12:58:22,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 12:58:22,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 12:58:22,691 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand 7 states. [2019-01-14 12:58:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:22,719 INFO L93 Difference]: Finished difference Result 218 states and 244 transitions. [2019-01-14 12:58:22,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 12:58:22,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2019-01-14 12:58:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:22,722 INFO L225 Difference]: With dead ends: 218 [2019-01-14 12:58:22,722 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 12:58:22,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 12:58:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 12:58:22,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-01-14 12:58:22,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-14 12:58:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2019-01-14 12:58:22,733 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 112 [2019-01-14 12:58:22,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:22,733 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2019-01-14 12:58:22,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 12:58:22,733 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2019-01-14 12:58:22,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-14 12:58:22,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:22,737 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:22,737 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:22,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:22,737 INFO L82 PathProgramCache]: Analyzing trace with hash -778837314, now seen corresponding path program 8 times [2019-01-14 12:58:22,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:22,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:22,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:22,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:22,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:22,770 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:22,774 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:22,774 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:22,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 12:58:22,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 12:58:22,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:22,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2019-01-14 12:58:22,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:22,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-01-14 12:58:22,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 12:58:22,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 12:58:22,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 12:58:22,990 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand 8 states. [2019-01-14 12:58:23,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:23,084 INFO L93 Difference]: Finished difference Result 220 states and 246 transitions. [2019-01-14 12:58:23,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 12:58:23,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 114 [2019-01-14 12:58:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:23,087 INFO L225 Difference]: With dead ends: 220 [2019-01-14 12:58:23,087 INFO L226 Difference]: Without dead ends: 118 [2019-01-14 12:58:23,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 12:58:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-14 12:58:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-01-14 12:58:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 12:58:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2019-01-14 12:58:23,098 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 114 [2019-01-14 12:58:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:23,099 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2019-01-14 12:58:23,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 12:58:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2019-01-14 12:58:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-14 12:58:23,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:23,102 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:23,102 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:23,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:23,104 INFO L82 PathProgramCache]: Analyzing trace with hash 789914432, now seen corresponding path program 9 times [2019-01-14 12:58:23,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:23,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:23,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:23,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:23,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:23,119 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:23,119 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:23,119 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:23,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 12:58:24,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 12:58:24,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:24,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 387 trivial. 0 not checked. [2019-01-14 12:58:24,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:24,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-01-14 12:58:24,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 12:58:24,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 12:58:24,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 12:58:24,541 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand 6 states. [2019-01-14 12:58:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:24,691 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2019-01-14 12:58:24,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 12:58:24,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-01-14 12:58:24,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:24,693 INFO L225 Difference]: With dead ends: 154 [2019-01-14 12:58:24,694 INFO L226 Difference]: Without dead ends: 120 [2019-01-14 12:58:24,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 12:58:24,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-14 12:58:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-01-14 12:58:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-14 12:58:24,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2019-01-14 12:58:24,702 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 116 [2019-01-14 12:58:24,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:24,703 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2019-01-14 12:58:24,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 12:58:24,703 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2019-01-14 12:58:24,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-14 12:58:24,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:24,705 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:24,705 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1883622974, now seen corresponding path program 10 times [2019-01-14 12:58:24,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:24,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:24,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:24,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:24,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:24,722 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:24,723 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:24,723 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:24,736 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 12:58:24,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 12:58:24,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:24,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-01-14 12:58:24,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:24,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-01-14 12:58:24,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 12:58:24,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 12:58:24,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 12:58:24,984 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand 12 states. [2019-01-14 12:58:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:25,339 INFO L93 Difference]: Finished difference Result 203 states and 230 transitions. [2019-01-14 12:58:25,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 12:58:25,340 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2019-01-14 12:58:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:25,342 INFO L225 Difference]: With dead ends: 203 [2019-01-14 12:58:25,342 INFO L226 Difference]: Without dead ends: 128 [2019-01-14 12:58:25,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 12:58:25,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-14 12:58:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-01-14 12:58:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-14 12:58:25,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2019-01-14 12:58:25,350 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 118 [2019-01-14 12:58:25,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:25,350 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2019-01-14 12:58:25,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 12:58:25,350 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2019-01-14 12:58:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-01-14 12:58:25,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:25,351 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:25,352 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:25,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:25,355 INFO L82 PathProgramCache]: Analyzing trace with hash 2123734779, now seen corresponding path program 11 times [2019-01-14 12:58:25,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:25,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:25,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:25,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:25,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:25,368 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:25,369 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:25,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:25,386 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 12:58:25,488 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-14 12:58:25,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:25,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:25,579 INFO L134 CoverageAnalysis]: Checked inductivity of 487 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-01-14 12:58:25,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:25,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-01-14 12:58:25,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 12:58:25,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 12:58:25,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 12:58:25,599 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 9 states. [2019-01-14 12:58:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:25,631 INFO L93 Difference]: Finished difference Result 244 states and 276 transitions. [2019-01-14 12:58:25,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 12:58:25,631 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2019-01-14 12:58:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:25,632 INFO L225 Difference]: With dead ends: 244 [2019-01-14 12:58:25,632 INFO L226 Difference]: Without dead ends: 131 [2019-01-14 12:58:25,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 12:58:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-14 12:58:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-01-14 12:58:25,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-01-14 12:58:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 146 transitions. [2019-01-14 12:58:25,640 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 146 transitions. Word has length 127 [2019-01-14 12:58:25,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:25,641 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 146 transitions. [2019-01-14 12:58:25,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 12:58:25,641 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 146 transitions. [2019-01-14 12:58:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-14 12:58:25,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:25,644 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:25,644 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:25,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:25,644 INFO L82 PathProgramCache]: Analyzing trace with hash -4406855, now seen corresponding path program 12 times [2019-01-14 12:58:25,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:25,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:25,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:25,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:25,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:25,665 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:25,668 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:25,668 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:25,683 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 12:58:53,628 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-14 12:58:53,629 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:53,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-01-14 12:58:53,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:53,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-01-14 12:58:53,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 12:58:53,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 12:58:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 12:58:53,711 INFO L87 Difference]: Start difference. First operand 130 states and 146 transitions. Second operand 7 states. [2019-01-14 12:58:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:53,737 INFO L93 Difference]: Finished difference Result 170 states and 191 transitions. [2019-01-14 12:58:53,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 12:58:53,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2019-01-14 12:58:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:53,739 INFO L225 Difference]: With dead ends: 170 [2019-01-14 12:58:53,739 INFO L226 Difference]: Without dead ends: 133 [2019-01-14 12:58:53,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 12:58:53,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-14 12:58:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-01-14 12:58:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-14 12:58:53,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 148 transitions. [2019-01-14 12:58:53,748 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 148 transitions. Word has length 129 [2019-01-14 12:58:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:53,749 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 148 transitions. [2019-01-14 12:58:53,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 12:58:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 148 transitions. [2019-01-14 12:58:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-14 12:58:53,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:53,750 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:53,753 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:53,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:53,753 INFO L82 PathProgramCache]: Analyzing trace with hash -869339081, now seen corresponding path program 13 times [2019-01-14 12:58:53,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:53,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:53,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:53,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:53,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:53,768 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:53,768 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:53,768 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:53,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 12:58:53,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-01-14 12:58:53,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:53,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-01-14 12:58:53,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 12:58:53,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 12:58:53,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 12:58:53,935 INFO L87 Difference]: Start difference. First operand 132 states and 148 transitions. Second operand 10 states. [2019-01-14 12:58:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:53,971 INFO L93 Difference]: Finished difference Result 250 states and 282 transitions. [2019-01-14 12:58:53,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 12:58:53,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-01-14 12:58:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:53,973 INFO L225 Difference]: With dead ends: 250 [2019-01-14 12:58:53,973 INFO L226 Difference]: Without dead ends: 135 [2019-01-14 12:58:53,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 12:58:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-14 12:58:53,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-01-14 12:58:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-14 12:58:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 150 transitions. [2019-01-14 12:58:53,980 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 150 transitions. Word has length 131 [2019-01-14 12:58:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:53,980 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 150 transitions. [2019-01-14 12:58:53,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 12:58:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 150 transitions. [2019-01-14 12:58:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-01-14 12:58:53,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:53,981 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 6, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:53,982 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:53,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:53,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1265271797, now seen corresponding path program 14 times [2019-01-14 12:58:53,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:53,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:53,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:53,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:58:53,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:53,992 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:53,993 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:53,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:54,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 12:58:54,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 12:58:54,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:54,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-01-14 12:58:54,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:54,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-01-14 12:58:54,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 12:58:54,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 12:58:54,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 12:58:54,243 INFO L87 Difference]: Start difference. First operand 134 states and 150 transitions. Second operand 11 states. [2019-01-14 12:58:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:54,297 INFO L93 Difference]: Finished difference Result 252 states and 284 transitions. [2019-01-14 12:58:54,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 12:58:54,299 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 133 [2019-01-14 12:58:54,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:54,300 INFO L225 Difference]: With dead ends: 252 [2019-01-14 12:58:54,300 INFO L226 Difference]: Without dead ends: 137 [2019-01-14 12:58:54,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 12:58:54,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-14 12:58:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-01-14 12:58:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-14 12:58:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 152 transitions. [2019-01-14 12:58:54,311 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 152 transitions. Word has length 133 [2019-01-14 12:58:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:54,312 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 152 transitions. [2019-01-14 12:58:54,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 12:58:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 152 transitions. [2019-01-14 12:58:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-14 12:58:54,313 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:54,315 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 6, 6, 6, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:54,316 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:54,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:54,316 INFO L82 PathProgramCache]: Analyzing trace with hash -368041933, now seen corresponding path program 15 times [2019-01-14 12:58:54,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:54,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:54,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:54,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:54,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:54,331 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:54,331 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:54,332 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:54,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 12:58:58,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-14 12:58:58,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:58,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2019-01-14 12:58:58,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:58,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-01-14 12:58:58,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 12:58:58,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 12:58:58,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 12:58:58,606 INFO L87 Difference]: Start difference. First operand 136 states and 152 transitions. Second operand 8 states. [2019-01-14 12:58:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:58,638 INFO L93 Difference]: Finished difference Result 176 states and 197 transitions. [2019-01-14 12:58:58,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 12:58:58,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 135 [2019-01-14 12:58:58,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:58,641 INFO L225 Difference]: With dead ends: 176 [2019-01-14 12:58:58,642 INFO L226 Difference]: Without dead ends: 139 [2019-01-14 12:58:58,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 12:58:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-14 12:58:58,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-01-14 12:58:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-01-14 12:58:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 154 transitions. [2019-01-14 12:58:58,650 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 154 transitions. Word has length 135 [2019-01-14 12:58:58,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:58,650 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 154 transitions. [2019-01-14 12:58:58,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 12:58:58,650 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 154 transitions. [2019-01-14 12:58:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-01-14 12:58:58,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:58,651 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 9, 9, 6, 6, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:58,651 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:58,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:58,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1864669233, now seen corresponding path program 16 times [2019-01-14 12:58:58,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:58,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:58,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:58,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:58,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:58,664 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:58,664 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:58,664 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:58,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 12:58:58,741 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 12:58:58,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:58,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:58,854 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2019-01-14 12:58:58,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:58,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-01-14 12:58:58,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 12:58:58,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 12:58:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 12:58:58,874 INFO L87 Difference]: Start difference. First operand 138 states and 154 transitions. Second operand 12 states. [2019-01-14 12:58:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:58,914 INFO L93 Difference]: Finished difference Result 257 states and 289 transitions. [2019-01-14 12:58:58,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 12:58:58,916 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 137 [2019-01-14 12:58:58,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:58,918 INFO L225 Difference]: With dead ends: 257 [2019-01-14 12:58:58,918 INFO L226 Difference]: Without dead ends: 140 [2019-01-14 12:58:58,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 12:58:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-14 12:58:58,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-01-14 12:58:58,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-14 12:58:58,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 156 transitions. [2019-01-14 12:58:58,927 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 156 transitions. Word has length 137 [2019-01-14 12:58:58,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:58,927 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 156 transitions. [2019-01-14 12:58:58,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 12:58:58,927 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 156 transitions. [2019-01-14 12:58:58,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-01-14 12:58:58,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:58,928 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:58,932 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:58,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash -855251601, now seen corresponding path program 17 times [2019-01-14 12:58:58,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:58,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:58,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:58,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:58,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:58,943 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:58,944 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:58,944 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:58,966 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 12:58:59,440 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-01-14 12:58:59,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:58:59,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:58:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-01-14 12:58:59,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:58:59,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-01-14 12:58:59,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 12:58:59,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 12:58:59,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 12:58:59,800 INFO L87 Difference]: Start difference. First operand 140 states and 156 transitions. Second operand 9 states. [2019-01-14 12:58:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:58:59,840 INFO L93 Difference]: Finished difference Result 180 states and 201 transitions. [2019-01-14 12:58:59,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 12:58:59,841 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2019-01-14 12:58:59,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:58:59,843 INFO L225 Difference]: With dead ends: 180 [2019-01-14 12:58:59,843 INFO L226 Difference]: Without dead ends: 143 [2019-01-14 12:58:59,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 12:58:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-14 12:58:59,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-01-14 12:58:59,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-14 12:58:59,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 158 transitions. [2019-01-14 12:58:59,852 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 158 transitions. Word has length 139 [2019-01-14 12:58:59,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:58:59,853 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 158 transitions. [2019-01-14 12:58:59,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 12:58:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2019-01-14 12:58:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-14 12:58:59,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:58:59,857 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 7, 7, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:58:59,857 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:58:59,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:58:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1807613549, now seen corresponding path program 18 times [2019-01-14 12:58:59,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:58:59,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:58:59,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:59,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:58:59,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:58:59,873 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:58:59,873 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:58:59,873 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:58:59,895 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 12:59:38,128 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-01-14 12:59:38,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 12:59:38,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:59:38,202 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-01-14 12:59:38,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:59:38,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-01-14 12:59:38,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 12:59:38,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 12:59:38,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 12:59:38,223 INFO L87 Difference]: Start difference. First operand 142 states and 158 transitions. Second operand 10 states. [2019-01-14 12:59:38,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:59:38,261 INFO L93 Difference]: Finished difference Result 182 states and 203 transitions. [2019-01-14 12:59:38,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 12:59:38,262 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 141 [2019-01-14 12:59:38,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:59:38,263 INFO L225 Difference]: With dead ends: 182 [2019-01-14 12:59:38,264 INFO L226 Difference]: Without dead ends: 145 [2019-01-14 12:59:38,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 12:59:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-14 12:59:38,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2019-01-14 12:59:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-01-14 12:59:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 160 transitions. [2019-01-14 12:59:38,273 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 160 transitions. Word has length 141 [2019-01-14 12:59:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:59:38,273 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 160 transitions. [2019-01-14 12:59:38,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 12:59:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 160 transitions. [2019-01-14 12:59:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-01-14 12:59:38,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:59:38,276 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:59:38,276 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:59:38,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:59:38,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1020514283, now seen corresponding path program 19 times [2019-01-14 12:59:38,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:59:38,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:59:38,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:59:38,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 12:59:38,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:59:38,293 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:59:38,293 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:59:38,293 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:59:38,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:59:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 12:59:38,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 12:59:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2019-01-14 12:59:38,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 12:59:38,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-01-14 12:59:38,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 12:59:38,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 12:59:38,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 12:59:38,935 INFO L87 Difference]: Start difference. First operand 144 states and 160 transitions. Second operand 11 states. [2019-01-14 12:59:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 12:59:38,981 INFO L93 Difference]: Finished difference Result 183 states and 204 transitions. [2019-01-14 12:59:38,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 12:59:38,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 143 [2019-01-14 12:59:38,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 12:59:38,984 INFO L225 Difference]: With dead ends: 183 [2019-01-14 12:59:38,984 INFO L226 Difference]: Without dead ends: 146 [2019-01-14 12:59:38,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 12:59:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-14 12:59:38,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-01-14 12:59:38,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-14 12:59:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 162 transitions. [2019-01-14 12:59:38,994 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 162 transitions. Word has length 143 [2019-01-14 12:59:38,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 12:59:38,994 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 162 transitions. [2019-01-14 12:59:38,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 12:59:38,994 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 162 transitions. [2019-01-14 12:59:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-14 12:59:38,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 12:59:38,999 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 6, 6, 6, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 12:59:39,000 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 12:59:39,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 12:59:39,000 INFO L82 PathProgramCache]: Analyzing trace with hash 532363753, now seen corresponding path program 20 times [2019-01-14 12:59:39,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 12:59:39,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 12:59:39,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:59:39,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 12:59:39,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 12:59:39,013 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 12:59:39,013 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 12:59:39,013 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 12:59:39,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 12:59:39,281 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 12:59:39,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 12:59:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 12:59:39,717 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 12:59:39,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:59:39 BoogieIcfgContainer [2019-01-14 12:59:39,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 12:59:39,863 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 12:59:39,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 12:59:39,864 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 12:59:39,866 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:58:15" (3/4) ... [2019-01-14 12:59:39,869 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 12:59:40,014 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 12:59:40,017 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 12:59:40,018 INFO L168 Benchmark]: Toolchain (without parser) took 85846.65 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.3 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -173.9 MB). Peak memory consumption was 135.4 MB. Max. memory is 11.5 GB. [2019-01-14 12:59:40,019 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-14 12:59:40,022 INFO L168 Benchmark]: CACSL2BoogieTranslator took 356.89 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 12:59:40,023 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.97 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 12:59:40,023 INFO L168 Benchmark]: Boogie Preprocessor took 140.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 12:59:40,023 INFO L168 Benchmark]: RCFGBuilder took 692.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-01-14 12:59:40,025 INFO L168 Benchmark]: TraceAbstraction took 84426.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.3 MB). Peak memory consumption was 133.9 MB. Max. memory is 11.5 GB. [2019-01-14 12:59:40,026 INFO L168 Benchmark]: Witness Printer took 153.64 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-01-14 12:59:40,030 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 356.89 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.97 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 140.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -183.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 692.69 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 84426.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -44.3 MB). Peak memory consumption was 133.9 MB. Max. memory is 11.5 GB. * Witness Printer took 153.64 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 50]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L31] int x[10]; [L5] int i; [L6] i = 0 [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND TRUE i < 10 [L7] x[i] = __VERIFIER_nondet_int() [L6] i++ [L6] COND FALSE !(i < 10) [L33] int temp; [L34] int ret; [L35] int ret2; [L36] int ret5; [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 10 [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 10 [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 10 [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 10) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L38] ret = rangesum(x) [L40] EXPR x[0] [L40] temp=x[0] [L40] EXPR x[1] [L40] x[0] = x[1] [L40] x[1] = temp [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 10 [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 10 [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 10 [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 10) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L41] ret2 = rangesum(x) [L42] EXPR x[0] [L42] temp=x[0] [L43] int i =0 ; [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND TRUE i<10 -1 [L44] EXPR x[i+1] [L44] x[i] = x[i+1] [L43] i++ [L43] COND FALSE !(i<10 -1) [L46] x[10 -1] = temp [L13] int i; [L14] long long ret; [L15] ret = 0 [L16] int cnt = 0; [L17] i = 0 [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND FALSE !(i > 10/2) [L17] i++ [L17] COND TRUE i < 10 [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 10 [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 10 [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND TRUE i < 10 [L18] COND TRUE i > 10/2 [L19] EXPR x[i] [L19] ret = ret + x[i] [L20] cnt = cnt + 1 [L17] i++ [L17] COND FALSE !(i < 10) [L23] COND TRUE cnt !=0 [L24] return ret / cnt; [L47] ret5 = rangesum(x) [L49] COND TRUE ret != ret2 || ret !=ret5 [L50] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. UNSAFE Result, 84.3s OverallTime, 32 OverallIterations, 10 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 549 SDslu, 1438 SDs, 0 SdLazy, 847 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2547 GetRequests, 2399 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=31, 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.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 65 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 73.2s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 2750 NumberOfCodeBlocks, 2487 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 2574 ConstructedInterpolants, 0 QuantifiedInterpolants, 332804 SizeOfPredicates, 37 NumberOfNonLiveVariables, 6383 ConjunctsInSsa, 185 ConjunctsInUnsatCore, 31 InterpolantComputations, 7 PerfectInterpolantSequences, 6962/7660 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...