./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-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 c5a3d22d49117f02662b197492bc1b16616a2878 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 16:10:20,140 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 16:10:20,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 16:10:20,162 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 16:10:20,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 16:10:20,163 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 16:10:20,165 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 16:10:20,166 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 16:10:20,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 16:10:20,169 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 16:10:20,170 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 16:10:20,170 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 16:10:20,171 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 16:10:20,172 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 16:10:20,173 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 16:10:20,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 16:10:20,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 16:10:20,176 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 16:10:20,178 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 16:10:20,180 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 16:10:20,181 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 16:10:20,182 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 16:10:20,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 16:10:20,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 16:10:20,185 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 16:10:20,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 16:10:20,187 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 16:10:20,188 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 16:10:20,189 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 16:10:20,190 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 16:10:20,190 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 16:10:20,191 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 16:10:20,191 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 16:10:20,192 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 16:10:20,193 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 16:10:20,193 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 16:10:20,194 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 16:10:20,209 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 16:10:20,209 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 16:10:20,211 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 16:10:20,211 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 16:10:20,211 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 16:10:20,211 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 16:10:20,211 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 16:10:20,212 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 16:10:20,212 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 16:10:20,212 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 16:10:20,212 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 16:10:20,212 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 16:10:20,213 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 16:10:20,213 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 16:10:20,213 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 16:10:20,213 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 16:10:20,213 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 16:10:20,213 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 16:10:20,214 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 16:10:20,214 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 16:10:20,214 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 16:10:20,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 16:10:20,214 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 16:10:20,215 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 16:10:20,215 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 16:10:20,215 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 16:10:20,215 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 16:10:20,215 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 16:10:20,215 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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-12-30 16:10:20,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 16:10:20,270 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 16:10:20,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 16:10:20,278 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 16:10:20,279 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 16:10:20,280 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:20,348 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4682684d7/918cb89e049e4d9e9cd7f0a5f18f5080/FLAG97adf6960 [2018-12-30 16:10:20,884 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 16:10:20,885 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:20,894 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4682684d7/918cb89e049e4d9e9cd7f0a5f18f5080/FLAG97adf6960 [2018-12-30 16:10:21,214 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4682684d7/918cb89e049e4d9e9cd7f0a5f18f5080 [2018-12-30 16:10:21,219 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 16:10:21,221 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 16:10:21,222 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:21,222 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 16:10:21,229 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 16:10:21,231 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:21" (1/1) ... [2018-12-30 16:10:21,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6212b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21, skipping insertion in model container [2018-12-30 16:10:21,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 04:10:21" (1/1) ... [2018-12-30 16:10:21,246 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 16:10:21,281 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 16:10:21,570 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:21,576 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 16:10:21,626 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 16:10:21,649 INFO L195 MainTranslator]: Completed translation [2018-12-30 16:10:21,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21 WrapperNode [2018-12-30 16:10:21,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 16:10:21,651 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:21,651 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 16:10:21,651 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 16:10:21,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21" (1/1) ... [2018-12-30 16:10:21,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21" (1/1) ... [2018-12-30 16:10:21,698 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 16:10:21,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 16:10:21,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 16:10:21,698 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 16:10:21,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21" (1/1) ... [2018-12-30 16:10:21,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21" (1/1) ... [2018-12-30 16:10:21,772 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21" (1/1) ... [2018-12-30 16:10:21,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21" (1/1) ... [2018-12-30 16:10:21,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21" (1/1) ... [2018-12-30 16:10:21,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21" (1/1) ... [2018-12-30 16:10:21,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21" (1/1) ... [2018-12-30 16:10:21,809 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 16:10:21,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 16:10:21,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 16:10:21,809 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 16:10:21,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21" (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 [2018-12-30 16:10:21,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 16:10:21,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 16:10:22,529 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 16:10:22,529 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-30 16:10:22,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:22 BoogieIcfgContainer [2018-12-30 16:10:22,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 16:10:22,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 16:10:22,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 16:10:22,534 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 16:10:22,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 04:10:21" (1/3) ... [2018-12-30 16:10:22,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc0110f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:22, skipping insertion in model container [2018-12-30 16:10:22,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 04:10:21" (2/3) ... [2018-12-30 16:10:22,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc0110f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 04:10:22, skipping insertion in model container [2018-12-30 16:10:22,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:22" (3/3) ... [2018-12-30 16:10:22,538 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-30 16:10:22,549 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 16:10:22,558 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 16:10:22,575 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 16:10:22,609 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 16:10:22,610 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 16:10:22,610 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 16:10:22,610 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 16:10:22,611 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 16:10:22,611 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 16:10:22,611 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 16:10:22,611 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 16:10:22,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 16:10:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-12-30 16:10:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:22,640 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:22,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:22,643 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:22,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:22,650 INFO L82 PathProgramCache]: Analyzing trace with hash 458325173, now seen corresponding path program 1 times [2018-12-30 16:10:22,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:22,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:22,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:22,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:22,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:22,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:22,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:22,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:22,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:22,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:22,906 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2018-12-30 16:10:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:22,995 INFO L93 Difference]: Finished difference Result 106 states and 192 transitions. [2018-12-30 16:10:22,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:22,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:22,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:23,013 INFO L225 Difference]: With dead ends: 106 [2018-12-30 16:10:23,013 INFO L226 Difference]: Without dead ends: 92 [2018-12-30 16:10:23,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-30 16:10:23,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2018-12-30 16:10:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-30 16:10:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 117 transitions. [2018-12-30 16:10:23,068 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 117 transitions. Word has length 20 [2018-12-30 16:10:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:23,069 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 117 transitions. [2018-12-30 16:10:23,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 117 transitions. [2018-12-30 16:10:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-30 16:10:23,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:23,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:23,071 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:23,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1130022729, now seen corresponding path program 1 times [2018-12-30 16:10:23,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:23,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:23,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:23,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:23,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:23,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:23,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:23,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:23,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:23,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:23,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,157 INFO L87 Difference]: Start difference. First operand 62 states and 117 transitions. Second operand 3 states. [2018-12-30 16:10:23,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:23,266 INFO L93 Difference]: Finished difference Result 153 states and 288 transitions. [2018-12-30 16:10:23,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:23,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-30 16:10:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:23,270 INFO L225 Difference]: With dead ends: 153 [2018-12-30 16:10:23,270 INFO L226 Difference]: Without dead ends: 92 [2018-12-30 16:10:23,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-30 16:10:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-12-30 16:10:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-30 16:10:23,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 169 transitions. [2018-12-30 16:10:23,285 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 169 transitions. Word has length 20 [2018-12-30 16:10:23,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:23,286 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 169 transitions. [2018-12-30 16:10:23,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 169 transitions. [2018-12-30 16:10:23,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:23,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:23,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:23,288 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:23,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:23,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1323390526, now seen corresponding path program 1 times [2018-12-30 16:10:23,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:23,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:23,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:23,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:23,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:23,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:23,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:23,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:23,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:23,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:23,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,405 INFO L87 Difference]: Start difference. First operand 90 states and 169 transitions. Second operand 3 states. [2018-12-30 16:10:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:23,480 INFO L93 Difference]: Finished difference Result 140 states and 257 transitions. [2018-12-30 16:10:23,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:23,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:23,485 INFO L225 Difference]: With dead ends: 140 [2018-12-30 16:10:23,486 INFO L226 Difference]: Without dead ends: 95 [2018-12-30 16:10:23,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-30 16:10:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-12-30 16:10:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-30 16:10:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 171 transitions. [2018-12-30 16:10:23,509 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 171 transitions. Word has length 21 [2018-12-30 16:10:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:23,509 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 171 transitions. [2018-12-30 16:10:23,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 171 transitions. [2018-12-30 16:10:23,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:23,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:23,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:23,512 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:23,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:23,512 INFO L82 PathProgramCache]: Analyzing trace with hash -670754180, now seen corresponding path program 1 times [2018-12-30 16:10:23,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:23,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:23,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:23,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:23,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:23,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:23,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:23,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:23,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:23,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:23,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,590 INFO L87 Difference]: Start difference. First operand 93 states and 171 transitions. Second operand 3 states. [2018-12-30 16:10:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:23,674 INFO L93 Difference]: Finished difference Result 180 states and 332 transitions. [2018-12-30 16:10:23,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:23,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:23,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:23,677 INFO L225 Difference]: With dead ends: 180 [2018-12-30 16:10:23,678 INFO L226 Difference]: Without dead ends: 178 [2018-12-30 16:10:23,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-30 16:10:23,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 124. [2018-12-30 16:10:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-30 16:10:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 228 transitions. [2018-12-30 16:10:23,692 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 228 transitions. Word has length 21 [2018-12-30 16:10:23,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:23,692 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 228 transitions. [2018-12-30 16:10:23,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 228 transitions. [2018-12-30 16:10:23,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-30 16:10:23,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:23,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:23,695 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:23,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2035865214, now seen corresponding path program 1 times [2018-12-30 16:10:23,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:23,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:23,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:23,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:23,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:23,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:23,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:23,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:23,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:23,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,805 INFO L87 Difference]: Start difference. First operand 124 states and 228 transitions. Second operand 3 states. [2018-12-30 16:10:23,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:23,839 INFO L93 Difference]: Finished difference Result 300 states and 554 transitions. [2018-12-30 16:10:23,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:23,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-30 16:10:23,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:23,845 INFO L225 Difference]: With dead ends: 300 [2018-12-30 16:10:23,845 INFO L226 Difference]: Without dead ends: 180 [2018-12-30 16:10:23,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-30 16:10:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2018-12-30 16:10:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-30 16:10:23,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 326 transitions. [2018-12-30 16:10:23,874 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 326 transitions. Word has length 21 [2018-12-30 16:10:23,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:23,874 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 326 transitions. [2018-12-30 16:10:23,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:23,875 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 326 transitions. [2018-12-30 16:10:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:23,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:23,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:23,877 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:23,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:23,877 INFO L82 PathProgramCache]: Analyzing trace with hash 681669292, now seen corresponding path program 1 times [2018-12-30 16:10:23,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:23,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:23,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:23,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:23,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:23,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:23,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:23,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:23,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:23,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:23,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:23,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,953 INFO L87 Difference]: Start difference. First operand 178 states and 326 transitions. Second operand 3 states. [2018-12-30 16:10:23,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:23,988 INFO L93 Difference]: Finished difference Result 269 states and 489 transitions. [2018-12-30 16:10:23,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:23,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:23,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:23,990 INFO L225 Difference]: With dead ends: 269 [2018-12-30 16:10:23,991 INFO L226 Difference]: Without dead ends: 182 [2018-12-30 16:10:23,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-30 16:10:24,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-12-30 16:10:24,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-30 16:10:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 326 transitions. [2018-12-30 16:10:24,016 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 326 transitions. Word has length 22 [2018-12-30 16:10:24,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:24,016 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 326 transitions. [2018-12-30 16:10:24,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:24,016 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 326 transitions. [2018-12-30 16:10:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:24,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:24,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:24,018 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:24,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:24,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1312475414, now seen corresponding path program 1 times [2018-12-30 16:10:24,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:24,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:24,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:24,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:24,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:24,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:24,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:24,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:24,082 INFO L87 Difference]: Start difference. First operand 180 states and 326 transitions. Second operand 3 states. [2018-12-30 16:10:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:24,208 INFO L93 Difference]: Finished difference Result 524 states and 952 transitions. [2018-12-30 16:10:24,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:24,210 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:24,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:24,213 INFO L225 Difference]: With dead ends: 524 [2018-12-30 16:10:24,213 INFO L226 Difference]: Without dead ends: 350 [2018-12-30 16:10:24,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-12-30 16:10:24,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2018-12-30 16:10:24,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-12-30 16:10:24,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 626 transitions. [2018-12-30 16:10:24,250 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 626 transitions. Word has length 22 [2018-12-30 16:10:24,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:24,251 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 626 transitions. [2018-12-30 16:10:24,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:24,251 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 626 transitions. [2018-12-30 16:10:24,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-30 16:10:24,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:24,253 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:24,259 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:24,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:24,260 INFO L82 PathProgramCache]: Analyzing trace with hash 275872488, now seen corresponding path program 1 times [2018-12-30 16:10:24,260 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:24,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:24,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:24,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:24,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:24,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:24,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:24,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:24,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:24,374 INFO L87 Difference]: Start difference. First operand 348 states and 626 transitions. Second operand 3 states. [2018-12-30 16:10:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:24,464 INFO L93 Difference]: Finished difference Result 448 states and 812 transitions. [2018-12-30 16:10:24,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:24,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-30 16:10:24,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:24,468 INFO L225 Difference]: With dead ends: 448 [2018-12-30 16:10:24,468 INFO L226 Difference]: Without dead ends: 446 [2018-12-30 16:10:24,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:24,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-12-30 16:10:24,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 348. [2018-12-30 16:10:24,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-12-30 16:10:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 622 transitions. [2018-12-30 16:10:24,486 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 622 transitions. Word has length 22 [2018-12-30 16:10:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:24,486 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 622 transitions. [2018-12-30 16:10:24,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 622 transitions. [2018-12-30 16:10:24,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:24,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:24,493 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:24,493 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:24,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:24,493 INFO L82 PathProgramCache]: Analyzing trace with hash -2031819437, now seen corresponding path program 1 times [2018-12-30 16:10:24,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:24,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:24,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:24,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:24,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:24,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:24,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:24,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:24,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:24,580 INFO L87 Difference]: Start difference. First operand 348 states and 622 transitions. Second operand 3 states. [2018-12-30 16:10:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:24,676 INFO L93 Difference]: Finished difference Result 660 states and 1192 transitions. [2018-12-30 16:10:24,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:24,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:24,682 INFO L225 Difference]: With dead ends: 660 [2018-12-30 16:10:24,682 INFO L226 Difference]: Without dead ends: 658 [2018-12-30 16:10:24,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2018-12-30 16:10:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 480. [2018-12-30 16:10:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-12-30 16:10:24,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 846 transitions. [2018-12-30 16:10:24,704 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 846 transitions. Word has length 23 [2018-12-30 16:10:24,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:24,704 INFO L480 AbstractCegarLoop]: Abstraction has 480 states and 846 transitions. [2018-12-30 16:10:24,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:24,704 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 846 transitions. [2018-12-30 16:10:24,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-30 16:10:24,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:24,706 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:24,706 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:24,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:24,707 INFO L82 PathProgramCache]: Analyzing trace with hash 674799957, now seen corresponding path program 1 times [2018-12-30 16:10:24,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:24,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:24,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:24,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:24,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:24,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:24,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:24,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:24,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:24,800 INFO L87 Difference]: Start difference. First operand 480 states and 846 transitions. Second operand 3 states. [2018-12-30 16:10:24,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:24,882 INFO L93 Difference]: Finished difference Result 1156 states and 2048 transitions. [2018-12-30 16:10:24,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:24,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-30 16:10:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:24,891 INFO L225 Difference]: With dead ends: 1156 [2018-12-30 16:10:24,892 INFO L226 Difference]: Without dead ends: 682 [2018-12-30 16:10:24,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-12-30 16:10:24,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2018-12-30 16:10:24,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-12-30 16:10:24,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1194 transitions. [2018-12-30 16:10:24,927 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1194 transitions. Word has length 23 [2018-12-30 16:10:24,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:24,928 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 1194 transitions. [2018-12-30 16:10:24,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:24,929 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1194 transitions. [2018-12-30 16:10:24,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:10:24,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:24,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:24,937 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:24,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:24,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1438319967, now seen corresponding path program 1 times [2018-12-30 16:10:24,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:24,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:24,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:24,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:25,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:25,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:25,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:25,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:25,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:25,030 INFO L87 Difference]: Start difference. First operand 680 states and 1194 transitions. Second operand 3 states. [2018-12-30 16:10:25,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:25,145 INFO L93 Difference]: Finished difference Result 1028 states and 1800 transitions. [2018-12-30 16:10:25,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:25,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:10:25,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:25,151 INFO L225 Difference]: With dead ends: 1028 [2018-12-30 16:10:25,152 INFO L226 Difference]: Without dead ends: 694 [2018-12-30 16:10:25,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-12-30 16:10:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2018-12-30 16:10:25,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2018-12-30 16:10:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1202 transitions. [2018-12-30 16:10:25,185 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1202 transitions. Word has length 24 [2018-12-30 16:10:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:25,186 INFO L480 AbstractCegarLoop]: Abstraction has 692 states and 1202 transitions. [2018-12-30 16:10:25,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1202 transitions. [2018-12-30 16:10:25,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:10:25,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:25,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:25,191 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:25,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:25,191 INFO L82 PathProgramCache]: Analyzing trace with hash -555824739, now seen corresponding path program 1 times [2018-12-30 16:10:25,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:25,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:25,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:25,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:25,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:25,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:25,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:25,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:25,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:25,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:25,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:25,273 INFO L87 Difference]: Start difference. First operand 692 states and 1202 transitions. Second operand 3 states. [2018-12-30 16:10:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:25,383 INFO L93 Difference]: Finished difference Result 1288 states and 2268 transitions. [2018-12-30 16:10:25,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:25,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:10:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:25,393 INFO L225 Difference]: With dead ends: 1288 [2018-12-30 16:10:25,394 INFO L226 Difference]: Without dead ends: 1286 [2018-12-30 16:10:25,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2018-12-30 16:10:25,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 964. [2018-12-30 16:10:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 964 states. [2018-12-30 16:10:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1642 transitions. [2018-12-30 16:10:25,437 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1642 transitions. Word has length 24 [2018-12-30 16:10:25,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:25,438 INFO L480 AbstractCegarLoop]: Abstraction has 964 states and 1642 transitions. [2018-12-30 16:10:25,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1642 transitions. [2018-12-30 16:10:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-30 16:10:25,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:25,442 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:25,442 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:25,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:25,443 INFO L82 PathProgramCache]: Analyzing trace with hash -2144172641, now seen corresponding path program 1 times [2018-12-30 16:10:25,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:25,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:25,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:25,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:25,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:25,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:25,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:25,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:25,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:25,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:25,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:25,527 INFO L87 Difference]: Start difference. First operand 964 states and 1642 transitions. Second operand 3 states. [2018-12-30 16:10:25,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:25,654 INFO L93 Difference]: Finished difference Result 2296 states and 3932 transitions. [2018-12-30 16:10:25,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:25,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-30 16:10:25,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:25,666 INFO L225 Difference]: With dead ends: 2296 [2018-12-30 16:10:25,667 INFO L226 Difference]: Without dead ends: 1350 [2018-12-30 16:10:25,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:25,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2018-12-30 16:10:25,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2018-12-30 16:10:25,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2018-12-30 16:10:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2290 transitions. [2018-12-30 16:10:25,722 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2290 transitions. Word has length 24 [2018-12-30 16:10:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:25,725 INFO L480 AbstractCegarLoop]: Abstraction has 1348 states and 2290 transitions. [2018-12-30 16:10:25,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2290 transitions. [2018-12-30 16:10:25,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:10:25,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:25,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:25,729 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:25,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:25,729 INFO L82 PathProgramCache]: Analyzing trace with hash -50484310, now seen corresponding path program 1 times [2018-12-30 16:10:25,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:25,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:25,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:25,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:25,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:25,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:25,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:25,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:25,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:25,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:25,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:25,807 INFO L87 Difference]: Start difference. First operand 1348 states and 2290 transitions. Second operand 3 states. [2018-12-30 16:10:25,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:25,929 INFO L93 Difference]: Finished difference Result 2024 states and 3428 transitions. [2018-12-30 16:10:25,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:25,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:10:25,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:25,939 INFO L225 Difference]: With dead ends: 2024 [2018-12-30 16:10:25,939 INFO L226 Difference]: Without dead ends: 1366 [2018-12-30 16:10:25,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:25,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2018-12-30 16:10:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1364. [2018-12-30 16:10:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1364 states. [2018-12-30 16:10:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 2290 transitions. [2018-12-30 16:10:25,999 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 2290 transitions. Word has length 25 [2018-12-30 16:10:25,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:25,999 INFO L480 AbstractCegarLoop]: Abstraction has 1364 states and 2290 transitions. [2018-12-30 16:10:25,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:25,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 2290 transitions. [2018-12-30 16:10:26,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:10:26,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:26,004 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:26,004 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:26,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:26,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2044629016, now seen corresponding path program 1 times [2018-12-30 16:10:26,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:26,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:26,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:26,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:26,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:26,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:26,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:26,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:26,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:26,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:26,082 INFO L87 Difference]: Start difference. First operand 1364 states and 2290 transitions. Second operand 3 states. [2018-12-30 16:10:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:26,218 INFO L93 Difference]: Finished difference Result 2504 states and 4276 transitions. [2018-12-30 16:10:26,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:26,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:10:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:26,236 INFO L225 Difference]: With dead ends: 2504 [2018-12-30 16:10:26,236 INFO L226 Difference]: Without dead ends: 2502 [2018-12-30 16:10:26,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:26,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2018-12-30 16:10:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 1924. [2018-12-30 16:10:26,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2018-12-30 16:10:26,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 3154 transitions. [2018-12-30 16:10:26,306 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 3154 transitions. Word has length 25 [2018-12-30 16:10:26,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:26,306 INFO L480 AbstractCegarLoop]: Abstraction has 1924 states and 3154 transitions. [2018-12-30 16:10:26,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:26,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 3154 transitions. [2018-12-30 16:10:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-30 16:10:26,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:26,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:26,314 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:26,314 INFO L82 PathProgramCache]: Analyzing trace with hash 661990378, now seen corresponding path program 1 times [2018-12-30 16:10:26,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:26,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:26,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:26,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:26,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:26,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:26,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:26,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:26,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:26,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:26,404 INFO L87 Difference]: Start difference. First operand 1924 states and 3154 transitions. Second operand 3 states. [2018-12-30 16:10:26,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:26,561 INFO L93 Difference]: Finished difference Result 4552 states and 7508 transitions. [2018-12-30 16:10:26,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:26,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-30 16:10:26,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:26,578 INFO L225 Difference]: With dead ends: 4552 [2018-12-30 16:10:26,579 INFO L226 Difference]: Without dead ends: 2662 [2018-12-30 16:10:26,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2662 states. [2018-12-30 16:10:26,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2660. [2018-12-30 16:10:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2018-12-30 16:10:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 4354 transitions. [2018-12-30 16:10:26,692 INFO L78 Accepts]: Start accepts. Automaton has 2660 states and 4354 transitions. Word has length 25 [2018-12-30 16:10:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:26,693 INFO L480 AbstractCegarLoop]: Abstraction has 2660 states and 4354 transitions. [2018-12-30 16:10:26,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:26,693 INFO L276 IsEmpty]: Start isEmpty. Operand 2660 states and 4354 transitions. [2018-12-30 16:10:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:10:26,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:26,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:26,700 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:26,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:26,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1041223700, now seen corresponding path program 1 times [2018-12-30 16:10:26,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:26,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:26,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:26,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:26,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:26,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:26,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:26,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:26,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:26,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:26,784 INFO L87 Difference]: Start difference. First operand 2660 states and 4354 transitions. Second operand 3 states. [2018-12-30 16:10:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:26,935 INFO L93 Difference]: Finished difference Result 3992 states and 6516 transitions. [2018-12-30 16:10:26,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:26,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:10:26,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:26,950 INFO L225 Difference]: With dead ends: 3992 [2018-12-30 16:10:26,951 INFO L226 Difference]: Without dead ends: 2694 [2018-12-30 16:10:26,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:26,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2694 states. [2018-12-30 16:10:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2694 to 2692. [2018-12-30 16:10:27,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2692 states. [2018-12-30 16:10:27,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2692 states to 2692 states and 4354 transitions. [2018-12-30 16:10:27,046 INFO L78 Accepts]: Start accepts. Automaton has 2692 states and 4354 transitions. Word has length 26 [2018-12-30 16:10:27,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:27,047 INFO L480 AbstractCegarLoop]: Abstraction has 2692 states and 4354 transitions. [2018-12-30 16:10:27,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2692 states and 4354 transitions. [2018-12-30 16:10:27,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:10:27,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:27,052 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:27,052 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:27,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:27,053 INFO L82 PathProgramCache]: Analyzing trace with hash -952921006, now seen corresponding path program 1 times [2018-12-30 16:10:27,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:27,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:27,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:27,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:27,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:27,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:27,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:27,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:27,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:27,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:27,130 INFO L87 Difference]: Start difference. First operand 2692 states and 4354 transitions. Second operand 3 states. [2018-12-30 16:10:27,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:27,296 INFO L93 Difference]: Finished difference Result 4872 states and 8036 transitions. [2018-12-30 16:10:27,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:27,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:10:27,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:27,324 INFO L225 Difference]: With dead ends: 4872 [2018-12-30 16:10:27,324 INFO L226 Difference]: Without dead ends: 4870 [2018-12-30 16:10:27,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:27,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4870 states. [2018-12-30 16:10:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4870 to 3844. [2018-12-30 16:10:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2018-12-30 16:10:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 6050 transitions. [2018-12-30 16:10:27,461 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 6050 transitions. Word has length 26 [2018-12-30 16:10:27,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:27,461 INFO L480 AbstractCegarLoop]: Abstraction has 3844 states and 6050 transitions. [2018-12-30 16:10:27,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:27,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 6050 transitions. [2018-12-30 16:10:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-30 16:10:27,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:27,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:27,470 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:27,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:27,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1753698388, now seen corresponding path program 1 times [2018-12-30 16:10:27,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:27,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:27,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:27,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:27,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:27,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:27,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:27,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:27,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:27,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:27,546 INFO L87 Difference]: Start difference. First operand 3844 states and 6050 transitions. Second operand 3 states. [2018-12-30 16:10:27,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:27,743 INFO L93 Difference]: Finished difference Result 9032 states and 14308 transitions. [2018-12-30 16:10:27,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:27,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-30 16:10:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:27,772 INFO L225 Difference]: With dead ends: 9032 [2018-12-30 16:10:27,772 INFO L226 Difference]: Without dead ends: 5254 [2018-12-30 16:10:27,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:27,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2018-12-30 16:10:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5252. [2018-12-30 16:10:27,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5252 states. [2018-12-30 16:10:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 8258 transitions. [2018-12-30 16:10:27,975 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 8258 transitions. Word has length 26 [2018-12-30 16:10:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:27,976 INFO L480 AbstractCegarLoop]: Abstraction has 5252 states and 8258 transitions. [2018-12-30 16:10:27,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 8258 transitions. [2018-12-30 16:10:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:10:27,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:27,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:27,984 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:27,986 INFO L82 PathProgramCache]: Analyzing trace with hash 524433983, now seen corresponding path program 1 times [2018-12-30 16:10:27,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:27,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:27,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:27,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:27,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:28,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:28,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:28,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:28,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:28,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:28,055 INFO L87 Difference]: Start difference. First operand 5252 states and 8258 transitions. Second operand 3 states. [2018-12-30 16:10:28,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:28,215 INFO L93 Difference]: Finished difference Result 7880 states and 12356 transitions. [2018-12-30 16:10:28,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:28,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:10:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:28,230 INFO L225 Difference]: With dead ends: 7880 [2018-12-30 16:10:28,231 INFO L226 Difference]: Without dead ends: 5318 [2018-12-30 16:10:28,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5318 states. [2018-12-30 16:10:28,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5318 to 5316. [2018-12-30 16:10:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5316 states. [2018-12-30 16:10:28,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5316 states to 5316 states and 8258 transitions. [2018-12-30 16:10:28,387 INFO L78 Accepts]: Start accepts. Automaton has 5316 states and 8258 transitions. Word has length 27 [2018-12-30 16:10:28,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:28,388 INFO L480 AbstractCegarLoop]: Abstraction has 5316 states and 8258 transitions. [2018-12-30 16:10:28,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 5316 states and 8258 transitions. [2018-12-30 16:10:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:10:28,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:28,395 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:28,395 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:28,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:28,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1469710723, now seen corresponding path program 1 times [2018-12-30 16:10:28,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:28,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:28,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:28,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:28,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:28,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:28,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:28,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:28,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:28,473 INFO L87 Difference]: Start difference. First operand 5316 states and 8258 transitions. Second operand 3 states. [2018-12-30 16:10:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:28,692 INFO L93 Difference]: Finished difference Result 9480 states and 15044 transitions. [2018-12-30 16:10:28,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:28,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:10:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:28,717 INFO L225 Difference]: With dead ends: 9480 [2018-12-30 16:10:28,717 INFO L226 Difference]: Without dead ends: 9478 [2018-12-30 16:10:28,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:28,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9478 states. [2018-12-30 16:10:28,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9478 to 7684. [2018-12-30 16:10:28,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7684 states. [2018-12-30 16:10:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7684 states to 7684 states and 11586 transitions. [2018-12-30 16:10:29,079 INFO L78 Accepts]: Start accepts. Automaton has 7684 states and 11586 transitions. Word has length 27 [2018-12-30 16:10:29,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:29,079 INFO L480 AbstractCegarLoop]: Abstraction has 7684 states and 11586 transitions. [2018-12-30 16:10:29,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:29,079 INFO L276 IsEmpty]: Start isEmpty. Operand 7684 states and 11586 transitions. [2018-12-30 16:10:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-30 16:10:29,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:29,092 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:29,093 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:29,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:29,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1236908671, now seen corresponding path program 1 times [2018-12-30 16:10:29,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:29,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:29,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:29,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:29,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:29,160 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:29,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:29,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:29,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:29,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:29,161 INFO L87 Difference]: Start difference. First operand 7684 states and 11586 transitions. Second operand 3 states. [2018-12-30 16:10:29,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:29,420 INFO L93 Difference]: Finished difference Result 17928 states and 27204 transitions. [2018-12-30 16:10:29,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:29,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-30 16:10:29,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:29,443 INFO L225 Difference]: With dead ends: 17928 [2018-12-30 16:10:29,443 INFO L226 Difference]: Without dead ends: 10374 [2018-12-30 16:10:29,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:29,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10374 states. [2018-12-30 16:10:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10374 to 10372. [2018-12-30 16:10:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10372 states. [2018-12-30 16:10:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10372 states to 10372 states and 15618 transitions. [2018-12-30 16:10:29,736 INFO L78 Accepts]: Start accepts. Automaton has 10372 states and 15618 transitions. Word has length 27 [2018-12-30 16:10:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:29,736 INFO L480 AbstractCegarLoop]: Abstraction has 10372 states and 15618 transitions. [2018-12-30 16:10:29,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 10372 states and 15618 transitions. [2018-12-30 16:10:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 16:10:29,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:29,747 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:29,748 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1683822281, now seen corresponding path program 1 times [2018-12-30 16:10:29,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:29,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:29,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:29,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:29,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:29,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:29,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:29,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:29,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:29,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:29,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:29,815 INFO L87 Difference]: Start difference. First operand 10372 states and 15618 transitions. Second operand 3 states. [2018-12-30 16:10:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:30,067 INFO L93 Difference]: Finished difference Result 15560 states and 23364 transitions. [2018-12-30 16:10:30,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:30,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-30 16:10:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:30,091 INFO L225 Difference]: With dead ends: 15560 [2018-12-30 16:10:30,091 INFO L226 Difference]: Without dead ends: 10502 [2018-12-30 16:10:30,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10502 states. [2018-12-30 16:10:30,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10502 to 10500. [2018-12-30 16:10:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10500 states. [2018-12-30 16:10:30,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10500 states to 10500 states and 15618 transitions. [2018-12-30 16:10:30,382 INFO L78 Accepts]: Start accepts. Automaton has 10500 states and 15618 transitions. Word has length 28 [2018-12-30 16:10:30,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:30,382 INFO L480 AbstractCegarLoop]: Abstraction has 10500 states and 15618 transitions. [2018-12-30 16:10:30,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 10500 states and 15618 transitions. [2018-12-30 16:10:30,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 16:10:30,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:30,393 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:30,394 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:30,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:30,394 INFO L82 PathProgramCache]: Analyzing trace with hash -310322425, now seen corresponding path program 1 times [2018-12-30 16:10:30,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:30,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:30,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:30,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:30,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:30,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:30,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:30,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:30,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:30,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:30,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:30,462 INFO L87 Difference]: Start difference. First operand 10500 states and 15618 transitions. Second operand 3 states. [2018-12-30 16:10:30,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:30,818 INFO L93 Difference]: Finished difference Result 18440 states and 28036 transitions. [2018-12-30 16:10:30,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:30,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-30 16:10:30,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:30,855 INFO L225 Difference]: With dead ends: 18440 [2018-12-30 16:10:30,855 INFO L226 Difference]: Without dead ends: 18438 [2018-12-30 16:10:30,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18438 states. [2018-12-30 16:10:31,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18438 to 15364. [2018-12-30 16:10:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15364 states. [2018-12-30 16:10:31,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15364 states to 15364 states and 22146 transitions. [2018-12-30 16:10:31,313 INFO L78 Accepts]: Start accepts. Automaton has 15364 states and 22146 transitions. Word has length 28 [2018-12-30 16:10:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:31,314 INFO L480 AbstractCegarLoop]: Abstraction has 15364 states and 22146 transitions. [2018-12-30 16:10:31,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 15364 states and 22146 transitions. [2018-12-30 16:10:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-30 16:10:31,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:31,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:31,335 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:31,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1898670327, now seen corresponding path program 1 times [2018-12-30 16:10:31,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:31,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:31,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:31,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:31,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:31,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:31,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:31,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:31,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:31,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:31,402 INFO L87 Difference]: Start difference. First operand 15364 states and 22146 transitions. Second operand 3 states. [2018-12-30 16:10:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:31,800 INFO L93 Difference]: Finished difference Result 35592 states and 51588 transitions. [2018-12-30 16:10:31,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:31,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-30 16:10:31,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:31,839 INFO L225 Difference]: With dead ends: 35592 [2018-12-30 16:10:31,840 INFO L226 Difference]: Without dead ends: 20486 [2018-12-30 16:10:31,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20486 states. [2018-12-30 16:10:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20486 to 20484. [2018-12-30 16:10:32,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20484 states. [2018-12-30 16:10:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20484 states to 20484 states and 29442 transitions. [2018-12-30 16:10:32,590 INFO L78 Accepts]: Start accepts. Automaton has 20484 states and 29442 transitions. Word has length 28 [2018-12-30 16:10:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:32,590 INFO L480 AbstractCegarLoop]: Abstraction has 20484 states and 29442 transitions. [2018-12-30 16:10:32,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:32,590 INFO L276 IsEmpty]: Start isEmpty. Operand 20484 states and 29442 transitions. [2018-12-30 16:10:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 16:10:32,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:32,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:32,612 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:32,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:32,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1029845804, now seen corresponding path program 1 times [2018-12-30 16:10:32,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:32,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:32,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:32,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:32,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:32,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:32,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:32,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:32,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:32,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:32,694 INFO L87 Difference]: Start difference. First operand 20484 states and 29442 transitions. Second operand 3 states. [2018-12-30 16:10:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:33,068 INFO L93 Difference]: Finished difference Result 30728 states and 44036 transitions. [2018-12-30 16:10:33,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:33,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-30 16:10:33,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:33,107 INFO L225 Difference]: With dead ends: 30728 [2018-12-30 16:10:33,107 INFO L226 Difference]: Without dead ends: 20742 [2018-12-30 16:10:33,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:33,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20742 states. [2018-12-30 16:10:33,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20742 to 20740. [2018-12-30 16:10:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20740 states. [2018-12-30 16:10:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20740 states to 20740 states and 29442 transitions. [2018-12-30 16:10:33,648 INFO L78 Accepts]: Start accepts. Automaton has 20740 states and 29442 transitions. Word has length 29 [2018-12-30 16:10:33,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:33,648 INFO L480 AbstractCegarLoop]: Abstraction has 20740 states and 29442 transitions. [2018-12-30 16:10:33,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:33,648 INFO L276 IsEmpty]: Start isEmpty. Operand 20740 states and 29442 transitions. [2018-12-30 16:10:33,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 16:10:33,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:33,670 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:33,670 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:33,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:33,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1270976786, now seen corresponding path program 1 times [2018-12-30 16:10:33,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:33,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:33,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:33,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:33,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:33,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:33,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:33,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:33,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:33,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:33,742 INFO L87 Difference]: Start difference. First operand 20740 states and 29442 transitions. Second operand 3 states. [2018-12-30 16:10:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:34,318 INFO L93 Difference]: Finished difference Result 35848 states and 51972 transitions. [2018-12-30 16:10:34,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:34,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-30 16:10:34,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:34,368 INFO L225 Difference]: With dead ends: 35848 [2018-12-30 16:10:34,368 INFO L226 Difference]: Without dead ends: 35846 [2018-12-30 16:10:34,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:34,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35846 states. [2018-12-30 16:10:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35846 to 30724. [2018-12-30 16:10:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30724 states. [2018-12-30 16:10:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30724 states to 30724 states and 42242 transitions. [2018-12-30 16:10:35,330 INFO L78 Accepts]: Start accepts. Automaton has 30724 states and 42242 transitions. Word has length 29 [2018-12-30 16:10:35,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:35,330 INFO L480 AbstractCegarLoop]: Abstraction has 30724 states and 42242 transitions. [2018-12-30 16:10:35,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:35,330 INFO L276 IsEmpty]: Start isEmpty. Operand 30724 states and 42242 transitions. [2018-12-30 16:10:35,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-30 16:10:35,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:35,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:35,359 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:35,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:35,360 INFO L82 PathProgramCache]: Analyzing trace with hash -317371116, now seen corresponding path program 1 times [2018-12-30 16:10:35,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:35,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:35,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:35,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:35,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:35,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:35,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:35,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:35,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:35,434 INFO L87 Difference]: Start difference. First operand 30724 states and 42242 transitions. Second operand 3 states. [2018-12-30 16:10:35,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:35,997 INFO L93 Difference]: Finished difference Result 70664 states and 97540 transitions. [2018-12-30 16:10:36,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:36,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-30 16:10:36,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:36,047 INFO L225 Difference]: With dead ends: 70664 [2018-12-30 16:10:36,048 INFO L226 Difference]: Without dead ends: 40454 [2018-12-30 16:10:36,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:36,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40454 states. [2018-12-30 16:10:37,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40454 to 40452. [2018-12-30 16:10:37,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40452 states. [2018-12-30 16:10:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40452 states to 40452 states and 55298 transitions. [2018-12-30 16:10:37,206 INFO L78 Accepts]: Start accepts. Automaton has 40452 states and 55298 transitions. Word has length 29 [2018-12-30 16:10:37,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:37,206 INFO L480 AbstractCegarLoop]: Abstraction has 40452 states and 55298 transitions. [2018-12-30 16:10:37,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 40452 states and 55298 transitions. [2018-12-30 16:10:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-30 16:10:37,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:37,224 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:37,224 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:37,225 INFO L82 PathProgramCache]: Analyzing trace with hash 745789822, now seen corresponding path program 1 times [2018-12-30 16:10:37,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:37,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:37,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:37,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:37,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:37,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:37,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:37,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:37,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:37,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:37,288 INFO L87 Difference]: Start difference. First operand 40452 states and 55298 transitions. Second operand 3 states. [2018-12-30 16:10:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:37,935 INFO L93 Difference]: Finished difference Result 60680 states and 82692 transitions. [2018-12-30 16:10:37,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:37,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-30 16:10:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:37,971 INFO L225 Difference]: With dead ends: 60680 [2018-12-30 16:10:37,971 INFO L226 Difference]: Without dead ends: 40966 [2018-12-30 16:10:37,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:38,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40966 states. [2018-12-30 16:10:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40966 to 40964. [2018-12-30 16:10:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40964 states. [2018-12-30 16:10:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40964 states to 40964 states and 55298 transitions. [2018-12-30 16:10:38,728 INFO L78 Accepts]: Start accepts. Automaton has 40964 states and 55298 transitions. Word has length 30 [2018-12-30 16:10:38,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:38,728 INFO L480 AbstractCegarLoop]: Abstraction has 40964 states and 55298 transitions. [2018-12-30 16:10:38,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 40964 states and 55298 transitions. [2018-12-30 16:10:38,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-30 16:10:38,752 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:38,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:38,752 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:38,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:38,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1248354884, now seen corresponding path program 1 times [2018-12-30 16:10:38,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:38,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:38,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:38,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:38,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:38,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:38,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:38,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:38,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:38,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:38,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:38,819 INFO L87 Difference]: Start difference. First operand 40964 states and 55298 transitions. Second operand 3 states. [2018-12-30 16:10:40,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:40,496 INFO L93 Difference]: Finished difference Result 119816 states and 159748 transitions. [2018-12-30 16:10:40,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:40,496 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-30 16:10:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:40,578 INFO L225 Difference]: With dead ends: 119816 [2018-12-30 16:10:40,578 INFO L226 Difference]: Without dead ends: 79878 [2018-12-30 16:10:40,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79878 states. [2018-12-30 16:10:42,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79878 to 79876. [2018-12-30 16:10:42,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79876 states. [2018-12-30 16:10:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79876 states to 79876 states and 104450 transitions. [2018-12-30 16:10:42,393 INFO L78 Accepts]: Start accepts. Automaton has 79876 states and 104450 transitions. Word has length 30 [2018-12-30 16:10:42,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:42,394 INFO L480 AbstractCegarLoop]: Abstraction has 79876 states and 104450 transitions. [2018-12-30 16:10:42,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:42,394 INFO L276 IsEmpty]: Start isEmpty. Operand 79876 states and 104450 transitions. [2018-12-30 16:10:42,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-30 16:10:42,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:42,437 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:42,437 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:42,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:42,437 INFO L82 PathProgramCache]: Analyzing trace with hash 339993018, now seen corresponding path program 1 times [2018-12-30 16:10:42,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:42,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:42,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:42,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:42,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:42,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:42,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:42,505 INFO L87 Difference]: Start difference. First operand 79876 states and 104450 transitions. Second operand 3 states. [2018-12-30 16:10:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:43,600 INFO L93 Difference]: Finished difference Result 88072 states and 118788 transitions. [2018-12-30 16:10:43,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:43,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-30 16:10:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:43,710 INFO L225 Difference]: With dead ends: 88072 [2018-12-30 16:10:43,711 INFO L226 Difference]: Without dead ends: 88070 [2018-12-30 16:10:43,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:43,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88070 states. [2018-12-30 16:10:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88070 to 79876. [2018-12-30 16:10:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79876 states. [2018-12-30 16:10:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79876 states to 79876 states and 103426 transitions. [2018-12-30 16:10:46,824 INFO L78 Accepts]: Start accepts. Automaton has 79876 states and 103426 transitions. Word has length 30 [2018-12-30 16:10:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:46,824 INFO L480 AbstractCegarLoop]: Abstraction has 79876 states and 103426 transitions. [2018-12-30 16:10:46,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 79876 states and 103426 transitions. [2018-12-30 16:10:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-30 16:10:46,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:46,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:46,874 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:46,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:46,874 INFO L82 PathProgramCache]: Analyzing trace with hash -44080279, now seen corresponding path program 1 times [2018-12-30 16:10:46,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:46,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:46,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:46,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:46,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:46,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:46,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:46,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:46,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:46,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:46,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:46,945 INFO L87 Difference]: Start difference. First operand 79876 states and 103426 transitions. Second operand 3 states. [2018-12-30 16:10:48,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:48,436 INFO L93 Difference]: Finished difference Result 134152 states and 176132 transitions. [2018-12-30 16:10:48,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:48,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-30 16:10:48,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:48,564 INFO L225 Difference]: With dead ends: 134152 [2018-12-30 16:10:48,564 INFO L226 Difference]: Without dead ends: 134150 [2018-12-30 16:10:48,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:48,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134150 states. [2018-12-30 16:10:50,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134150 to 121860. [2018-12-30 16:10:50,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121860 states. [2018-12-30 16:10:51,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121860 states to 121860 states and 153602 transitions. [2018-12-30 16:10:51,096 INFO L78 Accepts]: Start accepts. Automaton has 121860 states and 153602 transitions. Word has length 31 [2018-12-30 16:10:51,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:51,096 INFO L480 AbstractCegarLoop]: Abstraction has 121860 states and 153602 transitions. [2018-12-30 16:10:51,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 121860 states and 153602 transitions. [2018-12-30 16:10:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-30 16:10:51,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:10:51,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:10:51,151 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:10:51,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:10:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1632428181, now seen corresponding path program 1 times [2018-12-30 16:10:51,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:10:51,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:10:51,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:10:51,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:10:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:10:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:10:51,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:10:51,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:10:51,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:10:51,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:10:51,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:51,216 INFO L87 Difference]: Start difference. First operand 121860 states and 153602 transitions. Second operand 3 states. [2018-12-30 16:10:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:10:53,115 INFO L93 Difference]: Finished difference Result 277512 states and 350212 transitions. [2018-12-30 16:10:53,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:10:53,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-30 16:10:53,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:10:53,289 INFO L225 Difference]: With dead ends: 277512 [2018-12-30 16:10:53,289 INFO L226 Difference]: Without dead ends: 156678 [2018-12-30 16:10:53,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:10:53,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156678 states. [2018-12-30 16:10:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156678 to 156676. [2018-12-30 16:10:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156676 states. [2018-12-30 16:10:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156676 states to 156676 states and 194562 transitions. [2018-12-30 16:10:59,965 INFO L78 Accepts]: Start accepts. Automaton has 156676 states and 194562 transitions. Word has length 31 [2018-12-30 16:10:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:10:59,965 INFO L480 AbstractCegarLoop]: Abstraction has 156676 states and 194562 transitions. [2018-12-30 16:10:59,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:10:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 156676 states and 194562 transitions. [2018-12-30 16:11:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-30 16:11:00,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:11:00,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:11:00,024 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:11:00,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:11:00,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1366272847, now seen corresponding path program 1 times [2018-12-30 16:11:00,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:11:00,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:11:00,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:11:00,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:11:00,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:11:00,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:11:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:11:00,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:11:00,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:11:00,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:11:00,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:11:00,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:11:00,088 INFO L87 Difference]: Start difference. First operand 156676 states and 194562 transitions. Second operand 3 states. [2018-12-30 16:11:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:11:02,568 INFO L93 Difference]: Finished difference Result 236552 states and 293892 transitions. [2018-12-30 16:11:02,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:11:02,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-30 16:11:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:11:02,708 INFO L225 Difference]: With dead ends: 236552 [2018-12-30 16:11:02,709 INFO L226 Difference]: Without dead ends: 159750 [2018-12-30 16:11:02,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:11:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159750 states. [2018-12-30 16:11:05,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159750 to 159748. [2018-12-30 16:11:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159748 states. [2018-12-30 16:11:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159748 states to 159748 states and 196610 transitions. [2018-12-30 16:11:05,389 INFO L78 Accepts]: Start accepts. Automaton has 159748 states and 196610 transitions. Word has length 32 [2018-12-30 16:11:05,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:11:05,390 INFO L480 AbstractCegarLoop]: Abstraction has 159748 states and 196610 transitions. [2018-12-30 16:11:05,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:11:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 159748 states and 196610 transitions. [2018-12-30 16:11:05,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-30 16:11:05,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:11:05,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:11:05,453 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:11:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:11:05,453 INFO L82 PathProgramCache]: Analyzing trace with hash 934549743, now seen corresponding path program 1 times [2018-12-30 16:11:05,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:11:05,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:11:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:11:05,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:11:05,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:11:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:11:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:11:05,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:11:05,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:11:05,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:11:05,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:11:05,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:11:05,508 INFO L87 Difference]: Start difference. First operand 159748 states and 196610 transitions. Second operand 3 states. [2018-12-30 16:11:09,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:11:09,712 INFO L93 Difference]: Finished difference Result 262152 states and 323588 transitions. [2018-12-30 16:11:09,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:11:09,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-30 16:11:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:11:09,946 INFO L225 Difference]: With dead ends: 262152 [2018-12-30 16:11:09,946 INFO L226 Difference]: Without dead ends: 262150 [2018-12-30 16:11:09,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:11:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262150 states. [2018-12-30 16:11:14,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262150 to 245764. [2018-12-30 16:11:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245764 states. [2018-12-30 16:11:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245764 states to 245764 states and 294914 transitions. [2018-12-30 16:11:14,509 INFO L78 Accepts]: Start accepts. Automaton has 245764 states and 294914 transitions. Word has length 32 [2018-12-30 16:11:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:11:14,509 INFO L480 AbstractCegarLoop]: Abstraction has 245764 states and 294914 transitions. [2018-12-30 16:11:14,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:11:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 245764 states and 294914 transitions. [2018-12-30 16:11:14,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-30 16:11:14,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:11:14,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:11:14,630 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:11:14,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:11:14,631 INFO L82 PathProgramCache]: Analyzing trace with hash -653798159, now seen corresponding path program 1 times [2018-12-30 16:11:14,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:11:14,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:11:14,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:11:14,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:11:14,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:11:14,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:11:14,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:11:14,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:11:14,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:11:14,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:11:14,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:11:14,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:11:14,696 INFO L87 Difference]: Start difference. First operand 245764 states and 294914 transitions. Second operand 3 states. [2018-12-30 16:11:18,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:11:18,416 INFO L93 Difference]: Finished difference Result 552968 states and 659460 transitions. [2018-12-30 16:11:18,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:11:18,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-30 16:11:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:11:18,722 INFO L225 Difference]: With dead ends: 552968 [2018-12-30 16:11:18,722 INFO L226 Difference]: Without dead ends: 311302 [2018-12-30 16:11:18,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:11:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311302 states. [2018-12-30 16:11:29,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311302 to 311300. [2018-12-30 16:11:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311300 states. [2018-12-30 16:11:30,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311300 states to 311300 states and 364546 transitions. [2018-12-30 16:11:30,723 INFO L78 Accepts]: Start accepts. Automaton has 311300 states and 364546 transitions. Word has length 32 [2018-12-30 16:11:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:11:30,724 INFO L480 AbstractCegarLoop]: Abstraction has 311300 states and 364546 transitions. [2018-12-30 16:11:30,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:11:30,724 INFO L276 IsEmpty]: Start isEmpty. Operand 311300 states and 364546 transitions. [2018-12-30 16:11:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-30 16:11:30,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:11:30,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:11:30,864 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:11:30,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:11:30,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1093512896, now seen corresponding path program 1 times [2018-12-30 16:11:30,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:11:30,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:11:30,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:11:30,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:11:30,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:11:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:11:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:11:30,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:11:30,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:11:30,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:11:30,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:11:30,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:11:30,939 INFO L87 Difference]: Start difference. First operand 311300 states and 364546 transitions. Second operand 3 states. [2018-12-30 16:11:34,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:11:34,955 INFO L93 Difference]: Finished difference Result 466952 states and 544772 transitions. [2018-12-30 16:11:34,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:11:34,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-30 16:11:34,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:11:35,283 INFO L225 Difference]: With dead ends: 466952 [2018-12-30 16:11:35,283 INFO L226 Difference]: Without dead ends: 315398 [2018-12-30 16:11:35,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:11:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315398 states. [2018-12-30 16:11:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315398 to 315396. [2018-12-30 16:11:43,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315396 states. [2018-12-30 16:11:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315396 states to 315396 states and 364546 transitions. [2018-12-30 16:11:43,728 INFO L78 Accepts]: Start accepts. Automaton has 315396 states and 364546 transitions. Word has length 33 [2018-12-30 16:11:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:11:43,729 INFO L480 AbstractCegarLoop]: Abstraction has 315396 states and 364546 transitions. [2018-12-30 16:11:43,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:11:43,729 INFO L276 IsEmpty]: Start isEmpty. Operand 315396 states and 364546 transitions. [2018-12-30 16:11:43,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-30 16:11:43,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:11:43,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:11:43,864 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:11:43,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:11:43,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1207309694, now seen corresponding path program 1 times [2018-12-30 16:11:43,864 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:11:43,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:11:43,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:11:43,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:11:43,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:11:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:11:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:11:43,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:11:43,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:11:43,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:11:43,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:11:43,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:11:43,932 INFO L87 Difference]: Start difference. First operand 315396 states and 364546 transitions. Second operand 3 states. [2018-12-30 16:11:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:11:54,877 INFO L93 Difference]: Finished difference Result 507910 states and 581635 transitions. [2018-12-30 16:11:54,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:11:54,878 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-30 16:11:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:11:55,364 INFO L225 Difference]: With dead ends: 507910 [2018-12-30 16:11:55,364 INFO L226 Difference]: Without dead ends: 507908 [2018-12-30 16:11:55,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:11:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507908 states. [2018-12-30 16:12:03,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507908 to 491524. [2018-12-30 16:12:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491524 states. [2018-12-30 16:12:03,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491524 states to 491524 states and 557058 transitions. [2018-12-30 16:12:03,909 INFO L78 Accepts]: Start accepts. Automaton has 491524 states and 557058 transitions. Word has length 33 [2018-12-30 16:12:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:12:03,910 INFO L480 AbstractCegarLoop]: Abstraction has 491524 states and 557058 transitions. [2018-12-30 16:12:03,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:12:03,910 INFO L276 IsEmpty]: Start isEmpty. Operand 491524 states and 557058 transitions. [2018-12-30 16:12:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-30 16:12:04,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 16:12:04,181 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 16:12:04,181 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 16:12:04,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 16:12:04,181 INFO L82 PathProgramCache]: Analyzing trace with hash -381038208, now seen corresponding path program 1 times [2018-12-30 16:12:04,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 16:12:04,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 16:12:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:12:04,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 16:12:04,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 16:12:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 16:12:04,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 16:12:04,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 16:12:04,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 16:12:04,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 16:12:04,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 16:12:04,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:12:04,241 INFO L87 Difference]: Start difference. First operand 491524 states and 557058 transitions. Second operand 3 states. [2018-12-30 16:12:14,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 16:12:14,523 INFO L93 Difference]: Finished difference Result 1097732 states and 1228802 transitions. [2018-12-30 16:12:14,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 16:12:14,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-30 16:12:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 16:12:14,524 INFO L225 Difference]: With dead ends: 1097732 [2018-12-30 16:12:14,524 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 16:12:14,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 16:12:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 16:12:14,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 16:12:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 16:12:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 16:12:14,786 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-12-30 16:12:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 16:12:14,787 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 16:12:14,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 16:12:14,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 16:12:14,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 16:12:14,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 16:12:14,900 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,900 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,900 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,900 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 16:12:14,901 INFO L451 ceAbstractionStarter]: At program point L218(lines 4 219) the Hoare annotation is: true [2018-12-30 16:12:14,902 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-12-30 16:12:14,902 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-12-30 16:12:14,903 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-12-30 16:12:14,903 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,903 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,903 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-12-30 16:12:14,903 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,903 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,903 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,903 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-12-30 16:12:14,903 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,903 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-12-30 16:12:14,904 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,907 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-12-30 16:12:14,907 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,909 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,909 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 16:12:14,909 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-30 16:12:14,909 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,909 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-30 16:12:14,909 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,909 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,909 INFO L451 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-12-30 16:12:14,909 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,910 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-30 16:12:14,910 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,910 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 16:12:14,910 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-12-30 16:12:14,910 INFO L444 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-12-30 16:12:14,910 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,910 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,910 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-30 16:12:14,910 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-12-30 16:12:14,911 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,911 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,911 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-12-30 16:12:14,911 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,911 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,911 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,911 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-12-30 16:12:14,911 INFO L451 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-12-30 16:12:14,911 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,911 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,912 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-12-30 16:12:14,913 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-12-30 16:12:14,913 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-12-30 16:12:14,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 04:12:14 BoogieIcfgContainer [2018-12-30 16:12:14,921 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 16:12:14,922 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 16:12:14,922 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 16:12:14,922 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 16:12:14,923 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 04:10:22" (3/4) ... [2018-12-30 16:12:14,930 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 16:12:14,963 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-30 16:12:14,964 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 16:12:15,054 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 16:12:15,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 16:12:15,055 INFO L168 Benchmark]: Toolchain (without parser) took 113836.10 ms. Allocated memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: 4.9 GB). Free memory was 943.3 MB in the beginning and 1.3 GB in the end (delta: -337.1 MB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2018-12-30 16:12:15,058 INFO L168 Benchmark]: CDTParser took 0.18 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. [2018-12-30 16:12:15,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.14 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-30 16:12:15,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.86 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:12:15,059 INFO L168 Benchmark]: Boogie Preprocessor took 110.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-30 16:12:15,062 INFO L168 Benchmark]: RCFGBuilder took 721.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-12-30 16:12:15,062 INFO L168 Benchmark]: TraceAbstraction took 112390.51 ms. Allocated memory was 1.1 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -209.9 MB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2018-12-30 16:12:15,063 INFO L168 Benchmark]: Witness Printer took 132.62 ms. Allocated memory is still 5.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. [2018-12-30 16:12:15,068 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.18 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 428.14 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 932.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.86 ms. Allocated memory is still 1.0 GB. Free memory was 932.6 MB in the beginning and 927.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 110.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 721.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 112390.51 ms. Allocated memory was 1.1 GB in the beginning and 5.9 GB in the end (delta: 4.8 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -209.9 MB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. * Witness Printer took 132.62 ms. Allocated memory is still 5.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. SAFE Result, 112.3s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 51.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 4378 SDtfs, 2248 SDslu, 2956 SDs, 0 SdLazy, 207 SolverSat, 39 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491524occurred in iteration=38, 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: 56.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 65578 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 16393 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1039 NumberOfCodeBlocks, 1039 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1000 ConstructedInterpolants, 0 QuantifiedInterpolants, 58966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 39 InterpolantComputations, 39 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...