./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id_i20_o20_false-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/recursive-simple/id_i20_o20_false-unreach-call_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7d05936c4bb1bb97a4b24ebc11d02c0e844c743b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:59:01,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:59:01,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:59:01,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:59:01,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:59:01,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:59:01,177 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:59:01,179 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:59:01,181 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:59:01,182 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:59:01,183 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:59:01,183 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:59:01,184 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:59:01,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:59:01,187 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:59:01,187 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:59:01,189 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:59:01,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:59:01,196 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:59:01,201 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:59:01,202 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:59:01,205 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:59:01,208 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:59:01,208 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:59:01,208 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:59:01,209 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:59:01,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:59:01,220 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:59:01,221 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:59:01,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:59:01,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:59:01,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:59:01,223 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:59:01,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:59:01,225 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:59:01,226 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:59:01,227 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:59:01,254 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:59:01,255 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:59:01,257 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:59:01,257 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:59:01,257 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:59:01,257 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:59:01,257 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:59:01,260 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:59:01,260 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:59:01,260 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:59:01,260 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:59:01,261 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:59:01,261 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:59:01,261 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:59:01,261 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:59:01,261 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:59:01,262 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:59:01,262 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:59:01,262 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:59:01,262 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:59:01,262 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:59:01,263 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:59:01,266 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:59:01,266 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:59:01,266 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:59:01,266 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:59:01,266 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:59:01,267 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:59:01,268 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 -> 7d05936c4bb1bb97a4b24ebc11d02c0e844c743b [2019-01-12 14:59:01,324 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:59:01,337 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:59:01,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:59:01,345 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:59:01,345 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:59:01,346 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id_i20_o20_false-unreach-call_true-termination.c [2019-01-12 14:59:01,412 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ccead61/2d42cdd70a584da99d8c974b5eae13c1/FLAG1f3320d03 [2019-01-12 14:59:01,784 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:59:01,785 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id_i20_o20_false-unreach-call_true-termination.c [2019-01-12 14:59:01,789 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ccead61/2d42cdd70a584da99d8c974b5eae13c1/FLAG1f3320d03 [2019-01-12 14:59:02,175 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ccead61/2d42cdd70a584da99d8c974b5eae13c1 [2019-01-12 14:59:02,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:59:02,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:59:02,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:59:02,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:59:02,184 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:59:02,185 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:59:02" (1/1) ... [2019-01-12 14:59:02,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f785cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02, skipping insertion in model container [2019-01-12 14:59:02,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:59:02" (1/1) ... [2019-01-12 14:59:02,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:59:02,214 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:59:02,424 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:59:02,433 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:59:02,451 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:59:02,466 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:59:02,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02 WrapperNode [2019-01-12 14:59:02,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:59:02,468 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:59:02,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:59:02,468 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:59:02,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02" (1/1) ... [2019-01-12 14:59:02,482 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02" (1/1) ... [2019-01-12 14:59:02,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:59:02,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:59:02,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:59:02,504 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:59:02,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02" (1/1) ... [2019-01-12 14:59:02,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02" (1/1) ... [2019-01-12 14:59:02,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02" (1/1) ... [2019-01-12 14:59:02,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02" (1/1) ... [2019-01-12 14:59:02,515 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02" (1/1) ... [2019-01-12 14:59:02,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02" (1/1) ... [2019-01-12 14:59:02,518 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02" (1/1) ... [2019-01-12 14:59:02,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:59:02,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:59:02,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:59:02,519 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:59:02,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:59:02,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:59:02,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:59:02,633 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-01-12 14:59:02,633 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-01-12 14:59:02,810 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:59:02,810 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 14:59:02,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:59:02 BoogieIcfgContainer [2019-01-12 14:59:02,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:59:02,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:59:02,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:59:02,817 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:59:02,817 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:59:02" (1/3) ... [2019-01-12 14:59:02,818 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd43afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:59:02, skipping insertion in model container [2019-01-12 14:59:02,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:59:02" (2/3) ... [2019-01-12 14:59:02,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd43afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:59:02, skipping insertion in model container [2019-01-12 14:59:02,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:59:02" (3/3) ... [2019-01-12 14:59:02,822 INFO L112 eAbstractionObserver]: Analyzing ICFG id_i20_o20_false-unreach-call_true-termination.c [2019-01-12 14:59:02,832 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:59:02,840 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 14:59:02,854 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 14:59:02,883 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:59:02,884 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:59:02,884 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:59:02,884 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:59:02,885 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:59:02,885 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:59:02,885 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:59:02,885 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:59:02,885 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:59:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-12 14:59:02,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 14:59:02,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:02,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:02,915 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:02,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:02,920 INFO L82 PathProgramCache]: Analyzing trace with hash 389977641, now seen corresponding path program 1 times [2019-01-12 14:59:02,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:02,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:02,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:02,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:02,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:59:03,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:59:03,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:59:03,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:59:03,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:59:03,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:59:03,229 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 5 states. [2019-01-12 14:59:03,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:03,359 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-12 14:59:03,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:59:03,361 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 14:59:03,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:03,370 INFO L225 Difference]: With dead ends: 24 [2019-01-12 14:59:03,370 INFO L226 Difference]: Without dead ends: 14 [2019-01-12 14:59:03,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:59:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-12 14:59:03,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-12 14:59:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-12 14:59:03,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-01-12 14:59:03,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-01-12 14:59:03,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:03,410 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-01-12 14:59:03,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:59:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-01-12 14:59:03,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 14:59:03,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:03,412 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:03,413 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:03,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:03,413 INFO L82 PathProgramCache]: Analyzing trace with hash -881029229, now seen corresponding path program 1 times [2019-01-12 14:59:03,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:03,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:03,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:03,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:03,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:03,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:59:03,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:03,515 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:03,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:03,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:59:03,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:03,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-12 14:59:03,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:59:03,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:59:03,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:59:03,661 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 6 states. [2019-01-12 14:59:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:04,049 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-12 14:59:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:59:04,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-01-12 14:59:04,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:04,050 INFO L225 Difference]: With dead ends: 21 [2019-01-12 14:59:04,050 INFO L226 Difference]: Without dead ends: 17 [2019-01-12 14:59:04,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:59:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-12 14:59:04,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-12 14:59:04,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-12 14:59:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-12 14:59:04,057 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-12 14:59:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:04,057 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-12 14:59:04,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:59:04,058 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-12 14:59:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 14:59:04,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:04,059 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:04,059 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:04,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:04,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1824240471, now seen corresponding path program 2 times [2019-01-12 14:59:04,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:04,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:04,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:04,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:04,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:04,294 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 14:59:04,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:04,295 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:04,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:59:04,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:59:04,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:04,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:04,371 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-12 14:59:04,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:04,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-12 14:59:04,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:59:04,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:59:04,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:59:04,401 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-01-12 14:59:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:04,540 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2019-01-12 14:59:04,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:59:04,542 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 14:59:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:04,543 INFO L225 Difference]: With dead ends: 24 [2019-01-12 14:59:04,543 INFO L226 Difference]: Without dead ends: 20 [2019-01-12 14:59:04,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:59:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-12 14:59:04,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-12 14:59:04,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-12 14:59:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-12 14:59:04,550 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 21 [2019-01-12 14:59:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:04,551 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-12 14:59:04,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:59:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-12 14:59:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 14:59:04,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:04,552 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:04,552 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:04,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:04,553 INFO L82 PathProgramCache]: Analyzing trace with hash -28473709, now seen corresponding path program 3 times [2019-01-12 14:59:04,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:04,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:04,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:04,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:04,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 14:59:04,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:04,842 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:04,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:59:04,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-12 14:59:04,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:04,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:05,401 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-12 14:59:05,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:05,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-01-12 14:59:05,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 14:59:05,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 14:59:05,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:59:05,428 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2019-01-12 14:59:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:05,710 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-12 14:59:05,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 14:59:05,711 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 27 [2019-01-12 14:59:05,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:05,713 INFO L225 Difference]: With dead ends: 27 [2019-01-12 14:59:05,713 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 14:59:05,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2019-01-12 14:59:05,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 14:59:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 14:59:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 14:59:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 14:59:05,719 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 27 [2019-01-12 14:59:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:05,720 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 14:59:05,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 14:59:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 14:59:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:59:05,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:05,722 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:05,722 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:05,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:05,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2080894167, now seen corresponding path program 4 times [2019-01-12 14:59:05,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:05,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:05,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:05,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 14:59:05,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:05,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:05,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:59:05,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:59:05,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:05,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 14:59:05,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:05,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-12 14:59:05,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:59:05,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:59:05,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:59:05,950 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-01-12 14:59:06,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:06,152 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-12 14:59:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:59:06,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-01-12 14:59:06,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:06,157 INFO L225 Difference]: With dead ends: 30 [2019-01-12 14:59:06,157 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 14:59:06,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-12 14:59:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 14:59:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 14:59:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 14:59:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-12 14:59:06,164 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 33 [2019-01-12 14:59:06,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:06,165 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-12 14:59:06,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:59:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-12 14:59:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 14:59:06,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:06,166 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:06,167 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:06,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:06,167 INFO L82 PathProgramCache]: Analyzing trace with hash -687460973, now seen corresponding path program 5 times [2019-01-12 14:59:06,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:06,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:06,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:06,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:06,346 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 14:59:06,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:06,347 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:06,368 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:59:06,393 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-01-12 14:59:06,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:06,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-12 14:59:06,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:06,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2019-01-12 14:59:06,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 14:59:06,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 14:59:06,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-01-12 14:59:06,644 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 23 states. [2019-01-12 14:59:06,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:06,972 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 14:59:06,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 14:59:06,973 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2019-01-12 14:59:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:06,974 INFO L225 Difference]: With dead ends: 33 [2019-01-12 14:59:06,974 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 14:59:06,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=909, Unknown=0, NotChecked=0, Total=1122 [2019-01-12 14:59:06,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 14:59:06,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 14:59:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 14:59:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-12 14:59:06,980 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 39 [2019-01-12 14:59:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:06,981 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-12 14:59:06,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 14:59:06,981 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-12 14:59:06,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-12 14:59:06,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:06,982 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:06,983 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash 547744169, now seen corresponding path program 6 times [2019-01-12 14:59:06,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:06,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:06,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:06,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:07,323 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 14:59:07,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:07,324 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:07,334 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:59:07,355 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-01-12 14:59:07,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:07,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:07,374 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-01-12 14:59:07,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:07,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2019-01-12 14:59:07,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-12 14:59:07,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-12 14:59:07,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:59:07,396 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 17 states. [2019-01-12 14:59:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:07,580 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2019-01-12 14:59:07,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 14:59:07,581 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2019-01-12 14:59:07,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:07,582 INFO L225 Difference]: With dead ends: 36 [2019-01-12 14:59:07,582 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 14:59:07,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-01-12 14:59:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 14:59:07,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-12 14:59:07,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-12 14:59:07,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-12 14:59:07,590 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 45 [2019-01-12 14:59:07,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:07,590 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-12 14:59:07,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-12 14:59:07,591 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-12 14:59:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:59:07,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:07,592 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:07,593 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:07,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:07,593 INFO L82 PathProgramCache]: Analyzing trace with hash -247823213, now seen corresponding path program 7 times [2019-01-12 14:59:07,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:07,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:07,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:07,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:07,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 14:59:07,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:07,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:07,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:07,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-01-12 14:59:08,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:08,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2019-01-12 14:59:08,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-12 14:59:08,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-12 14:59:08,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2019-01-12 14:59:08,107 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 29 states. [2019-01-12 14:59:08,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:08,718 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-12 14:59:08,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 14:59:08,719 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2019-01-12 14:59:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:08,721 INFO L225 Difference]: With dead ends: 39 [2019-01-12 14:59:08,721 INFO L226 Difference]: Without dead ends: 35 [2019-01-12 14:59:08,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=354, Invalid=1538, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 14:59:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-12 14:59:08,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-12 14:59:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-12 14:59:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-12 14:59:08,729 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 51 [2019-01-12 14:59:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:08,729 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-12 14:59:08,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-12 14:59:08,729 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-12 14:59:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 14:59:08,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:08,731 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:08,731 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:08,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:08,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1818636247, now seen corresponding path program 8 times [2019-01-12 14:59:08,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:08,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:08,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:08,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:08,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 14:59:08,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:08,885 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:08,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:59:08,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:59:08,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:08,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-01-12 14:59:08,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:08,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2019-01-12 14:59:08,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 14:59:08,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 14:59:08,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-12 14:59:08,995 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2019-01-12 14:59:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:09,161 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2019-01-12 14:59:09,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 14:59:09,163 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-01-12 14:59:09,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:09,164 INFO L225 Difference]: With dead ends: 42 [2019-01-12 14:59:09,164 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 14:59:09,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-12 14:59:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 14:59:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-12 14:59:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 14:59:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-01-12 14:59:09,173 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 57 [2019-01-12 14:59:09,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:09,173 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-01-12 14:59:09,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 14:59:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-01-12 14:59:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-12 14:59:09,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:09,174 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:09,175 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:09,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:09,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2055304301, now seen corresponding path program 9 times [2019-01-12 14:59:09,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:09,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:09,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:09,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:09,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 14:59:09,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:09,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:09,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:59:09,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-12 14:59:09,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:09,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-01-12 14:59:10,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:10,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 23] total 35 [2019-01-12 14:59:10,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-12 14:59:10,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-12 14:59:10,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2019-01-12 14:59:10,389 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 35 states. [2019-01-12 14:59:10,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:10,948 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2019-01-12 14:59:10,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 14:59:10,949 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 63 [2019-01-12 14:59:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:10,951 INFO L225 Difference]: With dead ends: 45 [2019-01-12 14:59:10,951 INFO L226 Difference]: Without dead ends: 41 [2019-01-12 14:59:10,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 466 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=531, Invalid=2331, Unknown=0, NotChecked=0, Total=2862 [2019-01-12 14:59:10,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-12 14:59:10,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-12 14:59:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-12 14:59:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-12 14:59:10,959 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 63 [2019-01-12 14:59:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:10,960 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-12 14:59:10,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-12 14:59:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-12 14:59:10,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-12 14:59:10,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:10,961 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:10,962 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:10,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:10,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1172322647, now seen corresponding path program 10 times [2019-01-12 14:59:10,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:10,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:10,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:10,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:10,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 14:59:11,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:11,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:11,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:59:11,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:59:11,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:11,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-01-12 14:59:11,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:11,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2019-01-12 14:59:11,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 14:59:11,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 14:59:11,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-12 14:59:11,314 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2019-01-12 14:59:11,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:11,523 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2019-01-12 14:59:11,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-12 14:59:11,525 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-01-12 14:59:11,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:11,526 INFO L225 Difference]: With dead ends: 48 [2019-01-12 14:59:11,526 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 14:59:11,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2019-01-12 14:59:11,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 14:59:11,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-12 14:59:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-12 14:59:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-12 14:59:11,533 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 69 [2019-01-12 14:59:11,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:11,534 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-12 14:59:11,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 14:59:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-12 14:59:11,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-12 14:59:11,535 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:11,535 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:11,536 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:11,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:11,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1452916077, now seen corresponding path program 11 times [2019-01-12 14:59:11,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:11,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:11,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:11,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:11,708 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 14:59:11,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:11,708 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:11,718 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:59:11,747 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-01-12 14:59:11,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:11,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-01-12 14:59:11,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:11,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2019-01-12 14:59:11,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-12 14:59:11,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-12 14:59:11,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2019-01-12 14:59:11,809 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2019-01-12 14:59:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:12,209 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-12 14:59:12,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 14:59:12,211 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 75 [2019-01-12 14:59:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:12,213 INFO L225 Difference]: With dead ends: 51 [2019-01-12 14:59:12,213 INFO L226 Difference]: Without dead ends: 47 [2019-01-12 14:59:12,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2019-01-12 14:59:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-12 14:59:12,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-12 14:59:12,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-12 14:59:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-12 14:59:12,221 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 75 [2019-01-12 14:59:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:12,221 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-12 14:59:12,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-12 14:59:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-12 14:59:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-12 14:59:12,222 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:12,223 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:12,223 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:12,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:12,223 INFO L82 PathProgramCache]: Analyzing trace with hash -461124311, now seen corresponding path program 12 times [2019-01-12 14:59:12,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:12,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:12,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:12,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:12,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:12,641 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 14:59:12,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:12,642 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:12,652 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:59:12,686 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-01-12 14:59:12,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:12,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:13,156 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 14:59:13,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:13,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 17] total 44 [2019-01-12 14:59:13,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-12 14:59:13,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-12 14:59:13,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1585, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 14:59:13,177 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 44 states. [2019-01-12 14:59:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:14,249 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2019-01-12 14:59:14,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-12 14:59:14,250 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 81 [2019-01-12 14:59:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:14,252 INFO L225 Difference]: With dead ends: 54 [2019-01-12 14:59:14,252 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 14:59:14,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=864, Invalid=3828, Unknown=0, NotChecked=0, Total=4692 [2019-01-12 14:59:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 14:59:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-12 14:59:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-12 14:59:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2019-01-12 14:59:14,261 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 81 [2019-01-12 14:59:14,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:14,263 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2019-01-12 14:59:14,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-12 14:59:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2019-01-12 14:59:14,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-12 14:59:14,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:14,266 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:14,266 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1887065709, now seen corresponding path program 13 times [2019-01-12 14:59:14,267 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:14,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:14,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:14,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:14,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 14:59:14,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:14,719 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:14,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:14,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-01-12 14:59:15,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:15,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 18] total 47 [2019-01-12 14:59:15,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-12 14:59:15,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-12 14:59:15,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=1811, Unknown=0, NotChecked=0, Total=2162 [2019-01-12 14:59:15,486 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 47 states. [2019-01-12 14:59:16,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:16,637 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2019-01-12 14:59:16,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-12 14:59:16,638 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 87 [2019-01-12 14:59:16,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:16,640 INFO L225 Difference]: With dead ends: 57 [2019-01-12 14:59:16,640 INFO L226 Difference]: Without dead ends: 53 [2019-01-12 14:59:16,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=993, Invalid=4409, Unknown=0, NotChecked=0, Total=5402 [2019-01-12 14:59:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-12 14:59:16,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-12 14:59:16,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-12 14:59:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-12 14:59:16,649 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 87 [2019-01-12 14:59:16,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:16,650 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-12 14:59:16,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-12 14:59:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-12 14:59:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-12 14:59:16,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:16,652 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:16,652 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:16,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:16,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1777212503, now seen corresponding path program 14 times [2019-01-12 14:59:16,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:16,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:16,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:16,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:16,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:17,056 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 14:59:17,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:17,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:17,065 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 14:59:17,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 14:59:17,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:17,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:17,517 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2019-01-12 14:59:17,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:17,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 19] total 50 [2019-01-12 14:59:17,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-12 14:59:17,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-12 14:59:17,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=2052, Unknown=0, NotChecked=0, Total=2450 [2019-01-12 14:59:17,542 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 50 states. [2019-01-12 14:59:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:18,322 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2019-01-12 14:59:18,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-12 14:59:18,324 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 93 [2019-01-12 14:59:18,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:18,325 INFO L225 Difference]: With dead ends: 60 [2019-01-12 14:59:18,325 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 14:59:18,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1131, Invalid=5031, Unknown=0, NotChecked=0, Total=6162 [2019-01-12 14:59:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 14:59:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-12 14:59:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-12 14:59:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-12 14:59:18,336 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 93 [2019-01-12 14:59:18,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:18,336 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-12 14:59:18,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-12 14:59:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-12 14:59:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-12 14:59:18,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:18,338 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:18,338 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:18,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash -948911981, now seen corresponding path program 15 times [2019-01-12 14:59:18,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:18,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:18,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:18,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:18,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 14:59:18,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:18,808 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:18,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-12 14:59:18,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-12 14:59:18,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:18,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:19,280 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2019-01-12 14:59:19,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:19,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 20] total 53 [2019-01-12 14:59:19,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-12 14:59:19,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-12 14:59:19,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=2308, Unknown=0, NotChecked=0, Total=2756 [2019-01-12 14:59:19,302 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 53 states. [2019-01-12 14:59:20,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:20,599 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-12 14:59:20,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-12 14:59:20,600 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 99 [2019-01-12 14:59:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:20,601 INFO L225 Difference]: With dead ends: 63 [2019-01-12 14:59:20,602 INFO L226 Difference]: Without dead ends: 59 [2019-01-12 14:59:20,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1278, Invalid=5694, Unknown=0, NotChecked=0, Total=6972 [2019-01-12 14:59:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-12 14:59:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-12 14:59:20,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-12 14:59:20,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-12 14:59:20,613 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 99 [2019-01-12 14:59:20,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:20,614 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-12 14:59:20,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-12 14:59:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-12 14:59:20,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-12 14:59:20,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:20,619 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:20,620 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:20,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:20,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1159072297, now seen corresponding path program 16 times [2019-01-12 14:59:20,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:20,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:20,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:20,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:20,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:21,536 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 14:59:21,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:21,537 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:21,547 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-12 14:59:21,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-12 14:59:21,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:21,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-01-12 14:59:22,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:22,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 21] total 56 [2019-01-12 14:59:22,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-12 14:59:22,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-12 14:59:22,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=2579, Unknown=0, NotChecked=0, Total=3080 [2019-01-12 14:59:22,131 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 56 states. [2019-01-12 14:59:23,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:23,181 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-01-12 14:59:23,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-12 14:59:23,182 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 105 [2019-01-12 14:59:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:23,184 INFO L225 Difference]: With dead ends: 66 [2019-01-12 14:59:23,184 INFO L226 Difference]: Without dead ends: 62 [2019-01-12 14:59:23,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1434, Invalid=6398, Unknown=0, NotChecked=0, Total=7832 [2019-01-12 14:59:23,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-12 14:59:23,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-12 14:59:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-12 14:59:23,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2019-01-12 14:59:23,196 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 105 [2019-01-12 14:59:23,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:23,196 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2019-01-12 14:59:23,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-12 14:59:23,196 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2019-01-12 14:59:23,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-12 14:59:23,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:23,199 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:23,199 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:23,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:23,199 INFO L82 PathProgramCache]: Analyzing trace with hash 2109441939, now seen corresponding path program 17 times [2019-01-12 14:59:23,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:23,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:23,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:23,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 14:59:23,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:23,598 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:23,608 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-12 14:59:23,649 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2019-01-12 14:59:23,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:23,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2019-01-12 14:59:23,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:23,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2019-01-12 14:59:23,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-12 14:59:23,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-12 14:59:23,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2019-01-12 14:59:23,712 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 22 states. [2019-01-12 14:59:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:24,013 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2019-01-12 14:59:24,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-12 14:59:24,014 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 111 [2019-01-12 14:59:24,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:24,016 INFO L225 Difference]: With dead ends: 69 [2019-01-12 14:59:24,016 INFO L226 Difference]: Without dead ends: 65 [2019-01-12 14:59:24,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2019-01-12 14:59:24,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-12 14:59:24,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-12 14:59:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-12 14:59:24,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-12 14:59:24,023 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 111 [2019-01-12 14:59:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:24,024 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-12 14:59:24,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-12 14:59:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-12 14:59:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-01-12 14:59:24,027 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:24,027 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:24,028 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:24,028 INFO L82 PathProgramCache]: Analyzing trace with hash 450642089, now seen corresponding path program 18 times [2019-01-12 14:59:24,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:24,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:24,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:24,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:24,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:24,398 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 14:59:24,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:24,398 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:24,408 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-12 14:59:24,451 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-01-12 14:59:24,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 14:59:24,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:24,493 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2019-01-12 14:59:24,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:24,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2019-01-12 14:59:24,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 14:59:24,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 14:59:24,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2019-01-12 14:59:24,516 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 23 states. [2019-01-12 14:59:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:24,887 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2019-01-12 14:59:24,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-12 14:59:24,889 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 117 [2019-01-12 14:59:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:24,890 INFO L225 Difference]: With dead ends: 72 [2019-01-12 14:59:24,890 INFO L226 Difference]: Without dead ends: 68 [2019-01-12 14:59:24,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2019-01-12 14:59:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-12 14:59:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-12 14:59:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-12 14:59:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-12 14:59:24,897 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 117 [2019-01-12 14:59:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:24,898 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-12 14:59:24,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 14:59:24,899 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-12 14:59:24,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-01-12 14:59:24,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:24,901 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:24,902 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:24,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:24,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1141244269, now seen corresponding path program 19 times [2019-01-12 14:59:24,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:24,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:24,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 14:59:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 14:59:25,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 14:59:25,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 14:59:25,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:59:25,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 14:59:25,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2019-01-12 14:59:25,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 14:59:25,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-01-12 14:59:25,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-12 14:59:25,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-12 14:59:25,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2019-01-12 14:59:25,329 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 24 states. [2019-01-12 14:59:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:59:25,853 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-12 14:59:25,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 14:59:25,855 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 123 [2019-01-12 14:59:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:59:25,857 INFO L225 Difference]: With dead ends: 75 [2019-01-12 14:59:25,857 INFO L226 Difference]: Without dead ends: 71 [2019-01-12 14:59:25,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2019-01-12 14:59:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-12 14:59:25,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-12 14:59:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-12 14:59:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-12 14:59:25,869 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 123 [2019-01-12 14:59:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:59:25,870 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-12 14:59:25,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-12 14:59:25,870 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-12 14:59:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 14:59:25,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:59:25,873 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:59:25,873 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:59:25,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:59:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1280276695, now seen corresponding path program 20 times [2019-01-12 14:59:25,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:59:25,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:59:25,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:25,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:59:25,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:59:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:59:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 14:59:25,945 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 14:59:26,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:59:26 BoogieIcfgContainer [2019-01-12 14:59:26,012 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:59:26,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:59:26,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:59:26,013 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:59:26,015 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:59:02" (3/4) ... [2019-01-12 14:59:26,018 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-12 14:59:26,124 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:59:26,128 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:59:26,129 INFO L168 Benchmark]: Toolchain (without parser) took 23950.66 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 402.7 MB). Free memory was 946.0 MB in the beginning and 836.3 MB in the end (delta: 109.7 MB). Peak memory consumption was 512.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:59:26,131 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:59:26,132 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.93 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:59:26,134 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.83 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:59:26,134 INFO L168 Benchmark]: Boogie Preprocessor took 15.04 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:59:26,135 INFO L168 Benchmark]: RCFGBuilder took 293.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:59:26,137 INFO L168 Benchmark]: TraceAbstraction took 23198.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.4 MB). Free memory was 1.1 GB in the beginning and 836.3 MB in the end (delta: 290.2 MB). Peak memory consumption was 546.5 MB. Max. memory is 11.5 GB. [2019-01-12 14:59:26,144 INFO L168 Benchmark]: Witness Printer took 115.76 ms. Allocated memory is still 1.4 GB. Free memory was 836.3 MB in the beginning and 836.3 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-12 14:59:26,146 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.93 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 35.83 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.04 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 293.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 23198.96 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.4 MB). Free memory was 1.1 GB in the beginning and 836.3 MB in the end (delta: 290.2 MB). Peak memory consumption was 546.5 MB. Max. memory is 11.5 GB. * Witness Printer took 115.76 ms. Allocated memory is still 1.4 GB. Free memory was 836.3 MB in the beginning and 836.3 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L10] int input = 20; [L11] CALL, EXPR id(input) VAL [\old(x)=20] [L5] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L6] CALL, EXPR id(x-1) VAL [\old(x)=19] [L5] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L6] CALL, EXPR id(x-1) VAL [\old(x)=18] [L5] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L6] CALL, EXPR id(x-1) VAL [\old(x)=17] [L5] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L6] CALL, EXPR id(x-1) VAL [\old(x)=16] [L5] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L6] CALL, EXPR id(x-1) VAL [\old(x)=15] [L5] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L6] CALL, EXPR id(x-1) VAL [\old(x)=14] [L5] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L6] CALL, EXPR id(x-1) VAL [\old(x)=13] [L5] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L6] CALL, EXPR id(x-1) VAL [\old(x)=12] [L5] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L6] CALL, EXPR id(x-1) VAL [\old(x)=11] [L5] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L6] CALL, EXPR id(x-1) VAL [\old(x)=10] [L5] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L6] CALL, EXPR id(x-1) VAL [\old(x)=9] [L5] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L6] CALL, EXPR id(x-1) VAL [\old(x)=8] [L5] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L6] CALL, EXPR id(x-1) VAL [\old(x)=7] [L5] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L6] CALL, EXPR id(x-1) VAL [\old(x)=6] [L5] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L6] CALL, EXPR id(x-1) VAL [\old(x)=5] [L5] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L6] CALL, EXPR id(x-1) VAL [\old(x)=4] [L5] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L6] CALL, EXPR id(x-1) VAL [\old(x)=3] [L5] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L6] CALL, EXPR id(x-1) VAL [\old(x)=2] [L5] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L6] CALL, EXPR id(x-1) VAL [\old(x)=1] [L5] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L6] CALL, EXPR id(x-1) VAL [\old(x)=0] [L5] COND TRUE x==0 [L5] return 0; VAL [\old(x)=0, \result=0, x=0] [L6] RET, EXPR id(x-1) VAL [\old(x)=1, id(x-1)=0, x=1] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=2, id(x-1)=1, x=2] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=3, id(x-1)=2, x=3] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=4, id(x-1)=3, x=4] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=5, id(x-1)=4, x=5] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=6, id(x-1)=5, x=6] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=7, id(x-1)=6, x=7] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=8, id(x-1)=7, x=8] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=9, id(x-1)=8, x=9] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=10, id(x-1)=9, x=10] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=11, id(x-1)=10, x=11] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=12, id(x-1)=11, x=12] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=13, id(x-1)=12, x=13] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=14, id(x-1)=13, x=14] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=15, id(x-1)=14, x=15] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=16, id(x-1)=15, x=16] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=17, id(x-1)=16, x=17] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=18, id(x-1)=17, x=18] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=19, id(x-1)=18, x=19] [L6] return id(x-1) + 1; [L6] RET, EXPR id(x-1) VAL [\old(x)=20, id(x-1)=19, x=20] [L6] return id(x-1) + 1; [L11] RET, EXPR id(input) [L11] int result = id(input); [L12] COND TRUE result == 20 [L13] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. UNSAFE Result, 23.1s OverallTime, 21 OverallIterations, 21 TraceHistogramMax, 10.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 176 SDtfs, 411 SDslu, 2194 SDs, 0 SdLazy, 2174 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2069 GetRequests, 1301 SyntacticMatches, 0 SemanticMatches, 768 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7293 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 2760 NumberOfCodeBlocks, 2760 NumberOfCodeBlocksAsserted, 142 NumberOfCheckSat, 2592 ConstructedInterpolants, 0 QuantifiedInterpolants, 531536 SizeOfPredicates, 211 NumberOfNonLiveVariables, 3116 ConjunctsInSsa, 456 ConjunctsInUnsatCore, 39 InterpolantComputations, 1 PerfectInterpolantSequences, 7600/15200 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...