./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/locks/test_locks_9_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 5107685577f81a5867811396b2c0a05eb5630c95 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:00:20,978 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:00:20,980 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:00:20,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:00:20,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:00:20,992 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:00:20,994 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:00:20,996 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:00:20,997 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:00:20,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:00:20,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:00:21,000 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:00:21,000 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:00:21,002 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:00:21,003 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:00:21,004 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:00:21,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:00:21,007 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:00:21,009 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:00:21,011 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:00:21,012 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:00:21,013 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:00:21,016 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:00:21,016 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:00:21,017 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:00:21,018 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:00:21,019 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:00:21,020 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:00:21,021 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:00:21,022 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:00:21,022 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:00:21,023 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:00:21,023 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:00:21,023 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:00:21,025 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:00:21,026 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:00:21,026 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:00:21,041 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:00:21,041 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:00:21,042 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:00:21,042 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:00:21,042 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:00:21,043 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:00:21,043 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:00:21,043 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:00:21,043 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:00:21,043 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:00:21,043 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:00:21,044 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:00:21,045 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:00:21,045 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:00:21,045 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:00:21,046 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:00:21,046 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:00:21,046 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:00:21,046 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:00:21,046 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:00:21,046 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:00:21,048 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:00:21,048 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:00:21,048 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:00:21,048 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:00:21,048 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:00:21,049 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:00:21,049 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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2019-01-14 15:00:21,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:00:21,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:00:21,100 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:00:21,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:00:21,102 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:00:21,103 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 15:00:21,156 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09659eff4/27b291edf9f94147a807ba3ac5d9e412/FLAGfb17fff90 [2019-01-14 15:00:21,581 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:00:21,582 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 15:00:21,589 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09659eff4/27b291edf9f94147a807ba3ac5d9e412/FLAGfb17fff90 [2019-01-14 15:00:21,960 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09659eff4/27b291edf9f94147a807ba3ac5d9e412 [2019-01-14 15:00:21,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:00:21,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:00:21,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:00:21,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:00:21,969 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:00:21,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:21,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@453f9d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:21, skipping insertion in model container [2019-01-14 15:00:21,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:00:21" (1/1) ... [2019-01-14 15:00:21,981 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:00:22,002 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:00:22,182 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:00:22,187 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:00:22,232 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:00:22,250 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:00:22,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:22 WrapperNode [2019-01-14 15:00:22,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:00:22,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:00:22,252 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:00:22,252 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:00:22,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:22" (1/1) ... [2019-01-14 15:00:22,269 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:22" (1/1) ... [2019-01-14 15:00:22,292 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:00:22,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:00:22,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:00:22,293 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:00:22,303 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:22" (1/1) ... [2019-01-14 15:00:22,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:22" (1/1) ... [2019-01-14 15:00:22,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:22" (1/1) ... [2019-01-14 15:00:22,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:22" (1/1) ... [2019-01-14 15:00:22,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:22" (1/1) ... [2019-01-14 15:00:22,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:22" (1/1) ... [2019-01-14 15:00:22,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:22" (1/1) ... [2019-01-14 15:00:22,322 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:00:22,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:00:22,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:00:22,323 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:00:22,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:00:22,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:00:22,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:00:22,943 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:00:22,943 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 15:00:22,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:00:22 BoogieIcfgContainer [2019-01-14 15:00:22,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:00:22,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:00:22,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:00:22,949 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:00:22,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:00:21" (1/3) ... [2019-01-14 15:00:22,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b9665b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:00:22, skipping insertion in model container [2019-01-14 15:00:22,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:00:22" (2/3) ... [2019-01-14 15:00:22,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49b9665b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:00:22, skipping insertion in model container [2019-01-14 15:00:22,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:00:22" (3/3) ... [2019-01-14 15:00:22,953 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2019-01-14 15:00:22,964 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:00:22,972 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:00:22,986 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:00:23,018 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:00:23,018 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:00:23,019 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:00:23,019 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:00:23,019 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:00:23,019 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:00:23,020 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:00:23,020 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:00:23,020 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:00:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-01-14 15:00:23,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:00:23,040 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:23,043 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1076851140, now seen corresponding path program 1 times [2019-01-14 15:00:23,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:23,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,263 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-01-14 15:00:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,341 INFO L93 Difference]: Finished difference Result 76 states and 132 transitions. [2019-01-14 15:00:23,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 15:00:23,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,352 INFO L225 Difference]: With dead ends: 76 [2019-01-14 15:00:23,353 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 15:00:23,355 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 [2019-01-14 15:00:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 15:00:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 42. [2019-01-14 15:00:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-14 15:00:23,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 77 transitions. [2019-01-14 15:00:23,396 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 77 transitions. Word has length 15 [2019-01-14 15:00:23,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,396 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 77 transitions. [2019-01-14 15:00:23,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 77 transitions. [2019-01-14 15:00:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:00:23,398 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,398 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:23,399 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1335016578, now seen corresponding path program 1 times [2019-01-14 15:00:23,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:23,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,459 INFO L87 Difference]: Start difference. First operand 42 states and 77 transitions. Second operand 3 states. [2019-01-14 15:00:23,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,517 INFO L93 Difference]: Finished difference Result 103 states and 188 transitions. [2019-01-14 15:00:23,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-01-14 15:00:23,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,519 INFO L225 Difference]: With dead ends: 103 [2019-01-14 15:00:23,519 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 15:00:23,520 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 [2019-01-14 15:00:23,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 15:00:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-01-14 15:00:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 15:00:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 109 transitions. [2019-01-14 15:00:23,537 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 109 transitions. Word has length 15 [2019-01-14 15:00:23,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,539 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 109 transitions. [2019-01-14 15:00:23,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 109 transitions. [2019-01-14 15:00:23,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 15:00:23,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:23,541 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,541 INFO L82 PathProgramCache]: Analyzing trace with hash -977139357, now seen corresponding path program 1 times [2019-01-14 15:00:23,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:23,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,642 INFO L87 Difference]: Start difference. First operand 60 states and 109 transitions. Second operand 3 states. [2019-01-14 15:00:23,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,693 INFO L93 Difference]: Finished difference Result 95 states and 167 transitions. [2019-01-14 15:00:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-14 15:00:23,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,698 INFO L225 Difference]: With dead ends: 95 [2019-01-14 15:00:23,698 INFO L226 Difference]: Without dead ends: 65 [2019-01-14 15:00:23,699 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 [2019-01-14 15:00:23,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-14 15:00:23,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-01-14 15:00:23,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-14 15:00:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 111 transitions. [2019-01-14 15:00:23,707 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 111 transitions. Word has length 16 [2019-01-14 15:00:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,708 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 111 transitions. [2019-01-14 15:00:23,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2019-01-14 15:00:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 15:00:23,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:23,709 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1563945371, now seen corresponding path program 1 times [2019-01-14 15:00:23,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:23,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,783 INFO L87 Difference]: Start difference. First operand 63 states and 111 transitions. Second operand 3 states. [2019-01-14 15:00:23,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,837 INFO L93 Difference]: Finished difference Result 120 states and 212 transitions. [2019-01-14 15:00:23,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-14 15:00:23,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,840 INFO L225 Difference]: With dead ends: 120 [2019-01-14 15:00:23,840 INFO L226 Difference]: Without dead ends: 118 [2019-01-14 15:00:23,844 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 [2019-01-14 15:00:23,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-14 15:00:23,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 84. [2019-01-14 15:00:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-14 15:00:23,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 148 transitions. [2019-01-14 15:00:23,864 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 148 transitions. Word has length 16 [2019-01-14 15:00:23,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,865 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 148 transitions. [2019-01-14 15:00:23,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,867 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 148 transitions. [2019-01-14 15:00:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-14 15:00:23,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,869 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:23,870 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1305779933, now seen corresponding path program 1 times [2019-01-14 15:00:23,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:23,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:23,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:23,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:23,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:23,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:23,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:23,955 INFO L87 Difference]: Start difference. First operand 84 states and 148 transitions. Second operand 3 states. [2019-01-14 15:00:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:23,979 INFO L93 Difference]: Finished difference Result 200 states and 354 transitions. [2019-01-14 15:00:23,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:23,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-01-14 15:00:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:23,981 INFO L225 Difference]: With dead ends: 200 [2019-01-14 15:00:23,981 INFO L226 Difference]: Without dead ends: 120 [2019-01-14 15:00:23,982 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 [2019-01-14 15:00:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-14 15:00:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2019-01-14 15:00:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-14 15:00:23,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 206 transitions. [2019-01-14 15:00:23,994 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 206 transitions. Word has length 16 [2019-01-14 15:00:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:23,995 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 206 transitions. [2019-01-14 15:00:23,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:23,995 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 206 transitions. [2019-01-14 15:00:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:00:23,996 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:23,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:23,997 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:23,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1237452233, now seen corresponding path program 1 times [2019-01-14 15:00:23,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:23,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:23,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:24,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,035 INFO L87 Difference]: Start difference. First operand 118 states and 206 transitions. Second operand 3 states. [2019-01-14 15:00:24,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,093 INFO L93 Difference]: Finished difference Result 179 states and 309 transitions. [2019-01-14 15:00:24,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 15:00:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,096 INFO L225 Difference]: With dead ends: 179 [2019-01-14 15:00:24,097 INFO L226 Difference]: Without dead ends: 122 [2019-01-14 15:00:24,097 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 [2019-01-14 15:00:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-14 15:00:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-01-14 15:00:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-14 15:00:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 206 transitions. [2019-01-14 15:00:24,108 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 206 transitions. Word has length 17 [2019-01-14 15:00:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,109 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 206 transitions. [2019-01-14 15:00:24,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 206 transitions. [2019-01-14 15:00:24,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:00:24,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,112 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,112 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1824258247, now seen corresponding path program 1 times [2019-01-14 15:00:24,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:24,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,184 INFO L87 Difference]: Start difference. First operand 120 states and 206 transitions. Second operand 3 states. [2019-01-14 15:00:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,268 INFO L93 Difference]: Finished difference Result 344 states and 592 transitions. [2019-01-14 15:00:24,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 15:00:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,270 INFO L225 Difference]: With dead ends: 344 [2019-01-14 15:00:24,270 INFO L226 Difference]: Without dead ends: 230 [2019-01-14 15:00:24,271 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 [2019-01-14 15:00:24,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-14 15:00:24,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2019-01-14 15:00:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-01-14 15:00:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 386 transitions. [2019-01-14 15:00:24,287 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 386 transitions. Word has length 17 [2019-01-14 15:00:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,288 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 386 transitions. [2019-01-14 15:00:24,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 386 transitions. [2019-01-14 15:00:24,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:00:24,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,291 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,291 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2082423685, now seen corresponding path program 1 times [2019-01-14 15:00:24,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:24,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,355 INFO L87 Difference]: Start difference. First operand 228 states and 386 transitions. Second operand 3 states. [2019-01-14 15:00:24,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,382 INFO L93 Difference]: Finished difference Result 288 states and 492 transitions. [2019-01-14 15:00:24,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-01-14 15:00:24,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,385 INFO L225 Difference]: With dead ends: 288 [2019-01-14 15:00:24,385 INFO L226 Difference]: Without dead ends: 286 [2019-01-14 15:00:24,386 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 [2019-01-14 15:00:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-14 15:00:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 228. [2019-01-14 15:00:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-01-14 15:00:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 382 transitions. [2019-01-14 15:00:24,404 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 382 transitions. Word has length 17 [2019-01-14 15:00:24,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,404 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 382 transitions. [2019-01-14 15:00:24,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 382 transitions. [2019-01-14 15:00:24,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 15:00:24,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,408 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,409 INFO L82 PathProgramCache]: Analyzing trace with hash -717216456, now seen corresponding path program 1 times [2019-01-14 15:00:24,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:24,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,463 INFO L87 Difference]: Start difference. First operand 228 states and 382 transitions. Second operand 3 states. [2019-01-14 15:00:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,519 INFO L93 Difference]: Finished difference Result 420 states and 712 transitions. [2019-01-14 15:00:24,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 15:00:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,524 INFO L225 Difference]: With dead ends: 420 [2019-01-14 15:00:24,524 INFO L226 Difference]: Without dead ends: 418 [2019-01-14 15:00:24,525 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 [2019-01-14 15:00:24,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-01-14 15:00:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 320. [2019-01-14 15:00:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-01-14 15:00:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 526 transitions. [2019-01-14 15:00:24,539 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 526 transitions. Word has length 18 [2019-01-14 15:00:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,540 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 526 transitions. [2019-01-14 15:00:24,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 526 transitions. [2019-01-14 15:00:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 15:00:24,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,544 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,545 INFO L82 PathProgramCache]: Analyzing trace with hash -459051018, now seen corresponding path program 1 times [2019-01-14 15:00:24,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:24,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,627 INFO L87 Difference]: Start difference. First operand 320 states and 526 transitions. Second operand 3 states. [2019-01-14 15:00:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,722 INFO L93 Difference]: Finished difference Result 756 states and 1248 transitions. [2019-01-14 15:00:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-14 15:00:24,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,727 INFO L225 Difference]: With dead ends: 756 [2019-01-14 15:00:24,727 INFO L226 Difference]: Without dead ends: 442 [2019-01-14 15:00:24,728 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 [2019-01-14 15:00:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2019-01-14 15:00:24,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2019-01-14 15:00:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-01-14 15:00:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 714 transitions. [2019-01-14 15:00:24,747 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 714 transitions. Word has length 18 [2019-01-14 15:00:24,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,748 INFO L480 AbstractCegarLoop]: Abstraction has 440 states and 714 transitions. [2019-01-14 15:00:24,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 714 transitions. [2019-01-14 15:00:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:00:24,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,750 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,751 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,752 INFO L82 PathProgramCache]: Analyzing trace with hash -758658962, now seen corresponding path program 1 times [2019-01-14 15:00:24,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:24,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,825 INFO L87 Difference]: Start difference. First operand 440 states and 714 transitions. Second operand 3 states. [2019-01-14 15:00:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:24,895 INFO L93 Difference]: Finished difference Result 668 states and 1080 transitions. [2019-01-14 15:00:24,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:24,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 15:00:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:24,900 INFO L225 Difference]: With dead ends: 668 [2019-01-14 15:00:24,900 INFO L226 Difference]: Without dead ends: 454 [2019-01-14 15:00:24,901 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 [2019-01-14 15:00:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-01-14 15:00:24,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 452. [2019-01-14 15:00:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-01-14 15:00:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 722 transitions. [2019-01-14 15:00:24,920 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 722 transitions. Word has length 19 [2019-01-14 15:00:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:24,920 INFO L480 AbstractCegarLoop]: Abstraction has 452 states and 722 transitions. [2019-01-14 15:00:24,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 722 transitions. [2019-01-14 15:00:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:00:24,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:24,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:24,924 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:24,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:24,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1345464976, now seen corresponding path program 1 times [2019-01-14 15:00:24,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:24,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:24,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:24,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:24,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:24,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:24,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:24,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:24,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:24,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:24,998 INFO L87 Difference]: Start difference. First operand 452 states and 722 transitions. Second operand 3 states. [2019-01-14 15:00:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:25,088 INFO L93 Difference]: Finished difference Result 808 states and 1308 transitions. [2019-01-14 15:00:25,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:25,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 15:00:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:25,094 INFO L225 Difference]: With dead ends: 808 [2019-01-14 15:00:25,094 INFO L226 Difference]: Without dead ends: 806 [2019-01-14 15:00:25,095 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 [2019-01-14 15:00:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2019-01-14 15:00:25,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 644. [2019-01-14 15:00:25,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-01-14 15:00:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1002 transitions. [2019-01-14 15:00:25,120 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1002 transitions. Word has length 19 [2019-01-14 15:00:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:25,120 INFO L480 AbstractCegarLoop]: Abstraction has 644 states and 1002 transitions. [2019-01-14 15:00:25,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:25,120 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1002 transitions. [2019-01-14 15:00:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:00:25,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:25,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:00:25,124 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1087299538, now seen corresponding path program 1 times [2019-01-14 15:00:25,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:25,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:25,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:25,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:25,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:25,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:25,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:25,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:25,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,192 INFO L87 Difference]: Start difference. First operand 644 states and 1002 transitions. Second operand 3 states. [2019-01-14 15:00:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:25,289 INFO L93 Difference]: Finished difference Result 1496 states and 2332 transitions. [2019-01-14 15:00:25,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:25,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-01-14 15:00:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:25,295 INFO L225 Difference]: With dead ends: 1496 [2019-01-14 15:00:25,296 INFO L226 Difference]: Without dead ends: 870 [2019-01-14 15:00:25,297 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 [2019-01-14 15:00:25,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2019-01-14 15:00:25,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 868. [2019-01-14 15:00:25,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-01-14 15:00:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2019-01-14 15:00:25,335 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 19 [2019-01-14 15:00:25,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:25,336 INFO L480 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2019-01-14 15:00:25,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:25,336 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2019-01-14 15:00:25,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 15:00:25,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:25,341 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] [2019-01-14 15:00:25,341 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:25,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:25,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1240473739, now seen corresponding path program 1 times [2019-01-14 15:00:25,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:25,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:25,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:25,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:25,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:25,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:25,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:25,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:25,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,417 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand 3 states. [2019-01-14 15:00:25,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:25,525 INFO L93 Difference]: Finished difference Result 1304 states and 1988 transitions. [2019-01-14 15:00:25,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:25,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 15:00:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:25,533 INFO L225 Difference]: With dead ends: 1304 [2019-01-14 15:00:25,534 INFO L226 Difference]: Without dead ends: 886 [2019-01-14 15:00:25,535 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 [2019-01-14 15:00:25,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-01-14 15:00:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 884. [2019-01-14 15:00:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-01-14 15:00:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1330 transitions. [2019-01-14 15:00:25,574 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1330 transitions. Word has length 20 [2019-01-14 15:00:25,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:25,574 INFO L480 AbstractCegarLoop]: Abstraction has 884 states and 1330 transitions. [2019-01-14 15:00:25,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1330 transitions. [2019-01-14 15:00:25,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 15:00:25,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:25,577 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] [2019-01-14 15:00:25,578 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:25,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:25,579 INFO L82 PathProgramCache]: Analyzing trace with hash 653667725, now seen corresponding path program 1 times [2019-01-14 15:00:25,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:25,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:25,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:25,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:25,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:25,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:25,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,646 INFO L87 Difference]: Start difference. First operand 884 states and 1330 transitions. Second operand 3 states. [2019-01-14 15:00:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:25,752 INFO L93 Difference]: Finished difference Result 1544 states and 2356 transitions. [2019-01-14 15:00:25,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:25,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 15:00:25,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:25,761 INFO L225 Difference]: With dead ends: 1544 [2019-01-14 15:00:25,761 INFO L226 Difference]: Without dead ends: 1542 [2019-01-14 15:00:25,763 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 [2019-01-14 15:00:25,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-01-14 15:00:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1284. [2019-01-14 15:00:25,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1284 states. [2019-01-14 15:00:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1874 transitions. [2019-01-14 15:00:25,809 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1874 transitions. Word has length 20 [2019-01-14 15:00:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:25,809 INFO L480 AbstractCegarLoop]: Abstraction has 1284 states and 1874 transitions. [2019-01-14 15:00:25,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1874 transitions. [2019-01-14 15:00:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 15:00:25,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:25,814 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] [2019-01-14 15:00:25,815 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:25,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash 911833163, now seen corresponding path program 1 times [2019-01-14 15:00:25,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:25,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:25,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:25,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:25,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:25,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:25,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:25,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:25,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:25,887 INFO L87 Difference]: Start difference. First operand 1284 states and 1874 transitions. Second operand 3 states. [2019-01-14 15:00:26,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:26,018 INFO L93 Difference]: Finished difference Result 2952 states and 4308 transitions. [2019-01-14 15:00:26,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:26,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-01-14 15:00:26,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:26,028 INFO L225 Difference]: With dead ends: 2952 [2019-01-14 15:00:26,028 INFO L226 Difference]: Without dead ends: 1702 [2019-01-14 15:00:26,031 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 [2019-01-14 15:00:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-01-14 15:00:26,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1700. [2019-01-14 15:00:26,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1700 states. [2019-01-14 15:00:26,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1700 states to 1700 states and 2434 transitions. [2019-01-14 15:00:26,096 INFO L78 Accepts]: Start accepts. Automaton has 1700 states and 2434 transitions. Word has length 20 [2019-01-14 15:00:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:26,096 INFO L480 AbstractCegarLoop]: Abstraction has 1700 states and 2434 transitions. [2019-01-14 15:00:26,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1700 states and 2434 transitions. [2019-01-14 15:00:26,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 15:00:26,101 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:26,101 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] [2019-01-14 15:00:26,101 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:26,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1210921629, now seen corresponding path program 1 times [2019-01-14 15:00:26,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:26,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:26,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:26,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:26,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:26,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:26,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:26,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:26,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:26,157 INFO L87 Difference]: Start difference. First operand 1700 states and 2434 transitions. Second operand 3 states. [2019-01-14 15:00:26,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:26,247 INFO L93 Difference]: Finished difference Result 2552 states and 3636 transitions. [2019-01-14 15:00:26,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:26,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 15:00:26,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:26,256 INFO L225 Difference]: With dead ends: 2552 [2019-01-14 15:00:26,256 INFO L226 Difference]: Without dead ends: 1734 [2019-01-14 15:00:26,258 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 [2019-01-14 15:00:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2019-01-14 15:00:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1732. [2019-01-14 15:00:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1732 states. [2019-01-14 15:00:26,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 2434 transitions. [2019-01-14 15:00:26,315 INFO L78 Accepts]: Start accepts. Automaton has 1732 states and 2434 transitions. Word has length 21 [2019-01-14 15:00:26,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:26,316 INFO L480 AbstractCegarLoop]: Abstraction has 1732 states and 2434 transitions. [2019-01-14 15:00:26,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:26,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1732 states and 2434 transitions. [2019-01-14 15:00:26,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 15:00:26,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:26,320 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] [2019-01-14 15:00:26,321 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:26,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:26,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1797727643, now seen corresponding path program 1 times [2019-01-14 15:00:26,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:26,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:26,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:26,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:26,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:26,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:26,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:26,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:26,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:26,379 INFO L87 Difference]: Start difference. First operand 1732 states and 2434 transitions. Second operand 3 states. [2019-01-14 15:00:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:26,521 INFO L93 Difference]: Finished difference Result 2952 states and 4196 transitions. [2019-01-14 15:00:26,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:26,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 15:00:26,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:26,535 INFO L225 Difference]: With dead ends: 2952 [2019-01-14 15:00:26,535 INFO L226 Difference]: Without dead ends: 2950 [2019-01-14 15:00:26,537 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 [2019-01-14 15:00:26,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2950 states. [2019-01-14 15:00:26,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2950 to 2564. [2019-01-14 15:00:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2564 states. [2019-01-14 15:00:26,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2564 states to 2564 states and 3490 transitions. [2019-01-14 15:00:26,653 INFO L78 Accepts]: Start accepts. Automaton has 2564 states and 3490 transitions. Word has length 21 [2019-01-14 15:00:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:26,653 INFO L480 AbstractCegarLoop]: Abstraction has 2564 states and 3490 transitions. [2019-01-14 15:00:26,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 2564 states and 3490 transitions. [2019-01-14 15:00:26,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-14 15:00:26,660 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:26,660 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] [2019-01-14 15:00:26,660 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1539562205, now seen corresponding path program 1 times [2019-01-14 15:00:26,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:26,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:26,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:26,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:26,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:26,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:26,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:26,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:26,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:26,717 INFO L87 Difference]: Start difference. First operand 2564 states and 3490 transitions. Second operand 3 states. [2019-01-14 15:00:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:26,890 INFO L93 Difference]: Finished difference Result 5832 states and 7908 transitions. [2019-01-14 15:00:26,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:26,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-01-14 15:00:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:26,908 INFO L225 Difference]: With dead ends: 5832 [2019-01-14 15:00:26,908 INFO L226 Difference]: Without dead ends: 3334 [2019-01-14 15:00:26,913 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 [2019-01-14 15:00:26,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3334 states. [2019-01-14 15:00:27,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3334 to 3332. [2019-01-14 15:00:27,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3332 states. [2019-01-14 15:00:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3332 states to 3332 states and 4418 transitions. [2019-01-14 15:00:27,033 INFO L78 Accepts]: Start accepts. Automaton has 3332 states and 4418 transitions. Word has length 21 [2019-01-14 15:00:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:27,033 INFO L480 AbstractCegarLoop]: Abstraction has 3332 states and 4418 transitions. [2019-01-14 15:00:27,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3332 states and 4418 transitions. [2019-01-14 15:00:27,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 15:00:27,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:27,040 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] [2019-01-14 15:00:27,040 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:27,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:27,041 INFO L82 PathProgramCache]: Analyzing trace with hash 105233632, now seen corresponding path program 1 times [2019-01-14 15:00:27,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:27,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:27,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:27,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:27,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:27,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:27,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:27,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:27,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:27,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:27,109 INFO L87 Difference]: Start difference. First operand 3332 states and 4418 transitions. Second operand 3 states. [2019-01-14 15:00:27,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:27,252 INFO L93 Difference]: Finished difference Result 5000 states and 6596 transitions. [2019-01-14 15:00:27,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:27,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 15:00:27,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:27,270 INFO L225 Difference]: With dead ends: 5000 [2019-01-14 15:00:27,270 INFO L226 Difference]: Without dead ends: 3398 [2019-01-14 15:00:27,274 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 [2019-01-14 15:00:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2019-01-14 15:00:27,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3396. [2019-01-14 15:00:27,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2019-01-14 15:00:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4418 transitions. [2019-01-14 15:00:27,396 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4418 transitions. Word has length 22 [2019-01-14 15:00:27,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:27,396 INFO L480 AbstractCegarLoop]: Abstraction has 3396 states and 4418 transitions. [2019-01-14 15:00:27,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:27,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4418 transitions. [2019-01-14 15:00:27,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 15:00:27,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:27,403 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] [2019-01-14 15:00:27,403 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:27,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:27,404 INFO L82 PathProgramCache]: Analyzing trace with hash -481572382, now seen corresponding path program 1 times [2019-01-14 15:00:27,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:27,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:27,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:27,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:27,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:27,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:27,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:27,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:27,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:27,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:27,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:27,473 INFO L87 Difference]: Start difference. First operand 3396 states and 4418 transitions. Second operand 3 states. [2019-01-14 15:00:27,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:27,690 INFO L93 Difference]: Finished difference Result 5640 states and 7364 transitions. [2019-01-14 15:00:27,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:27,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 15:00:27,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:27,716 INFO L225 Difference]: With dead ends: 5640 [2019-01-14 15:00:27,716 INFO L226 Difference]: Without dead ends: 5638 [2019-01-14 15:00:27,720 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 [2019-01-14 15:00:27,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5638 states. [2019-01-14 15:00:27,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5638 to 5124. [2019-01-14 15:00:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5124 states. [2019-01-14 15:00:27,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5124 states to 5124 states and 6466 transitions. [2019-01-14 15:00:27,872 INFO L78 Accepts]: Start accepts. Automaton has 5124 states and 6466 transitions. Word has length 22 [2019-01-14 15:00:27,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:27,872 INFO L480 AbstractCegarLoop]: Abstraction has 5124 states and 6466 transitions. [2019-01-14 15:00:27,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 5124 states and 6466 transitions. [2019-01-14 15:00:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 15:00:27,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:27,882 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] [2019-01-14 15:00:27,882 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:27,882 INFO L82 PathProgramCache]: Analyzing trace with hash -223406944, now seen corresponding path program 1 times [2019-01-14 15:00:27,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:27,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:27,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:27,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:27,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:27,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:27,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:27,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:27,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:27,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:27,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:27,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:27,945 INFO L87 Difference]: Start difference. First operand 5124 states and 6466 transitions. Second operand 3 states. [2019-01-14 15:00:28,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:28,172 INFO L93 Difference]: Finished difference Result 11528 states and 14404 transitions. [2019-01-14 15:00:28,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:28,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-01-14 15:00:28,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:28,207 INFO L225 Difference]: With dead ends: 11528 [2019-01-14 15:00:28,207 INFO L226 Difference]: Without dead ends: 6534 [2019-01-14 15:00:28,214 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 [2019-01-14 15:00:28,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6534 states. [2019-01-14 15:00:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6534 to 6532. [2019-01-14 15:00:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6532 states. [2019-01-14 15:00:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6532 states to 6532 states and 7938 transitions. [2019-01-14 15:00:28,424 INFO L78 Accepts]: Start accepts. Automaton has 6532 states and 7938 transitions. Word has length 22 [2019-01-14 15:00:28,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:28,424 INFO L480 AbstractCegarLoop]: Abstraction has 6532 states and 7938 transitions. [2019-01-14 15:00:28,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 6532 states and 7938 transitions. [2019-01-14 15:00:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 15:00:28,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:28,436 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] [2019-01-14 15:00:28,437 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:28,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:28,437 INFO L82 PathProgramCache]: Analyzing trace with hash -2043625896, now seen corresponding path program 1 times [2019-01-14 15:00:28,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:28,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:28,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:28,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:28,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:28,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:28,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:28,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:28,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:28,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:28,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:28,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:28,517 INFO L87 Difference]: Start difference. First operand 6532 states and 7938 transitions. Second operand 3 states. [2019-01-14 15:00:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:28,765 INFO L93 Difference]: Finished difference Result 9800 states and 11844 transitions. [2019-01-14 15:00:28,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:28,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 15:00:28,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:28,779 INFO L225 Difference]: With dead ends: 9800 [2019-01-14 15:00:28,780 INFO L226 Difference]: Without dead ends: 6662 [2019-01-14 15:00:28,785 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 [2019-01-14 15:00:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6662 states. [2019-01-14 15:00:28,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6662 to 6660. [2019-01-14 15:00:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6660 states. [2019-01-14 15:00:28,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6660 states to 6660 states and 7938 transitions. [2019-01-14 15:00:28,963 INFO L78 Accepts]: Start accepts. Automaton has 6660 states and 7938 transitions. Word has length 23 [2019-01-14 15:00:28,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:28,964 INFO L480 AbstractCegarLoop]: Abstraction has 6660 states and 7938 transitions. [2019-01-14 15:00:28,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:28,964 INFO L276 IsEmpty]: Start isEmpty. Operand 6660 states and 7938 transitions. [2019-01-14 15:00:28,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 15:00:28,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:28,974 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] [2019-01-14 15:00:28,975 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:28,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:28,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1664535386, now seen corresponding path program 1 times [2019-01-14 15:00:28,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:28,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:28,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:28,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:28,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:29,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:29,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:29,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:29,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:29,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:29,044 INFO L87 Difference]: Start difference. First operand 6660 states and 7938 transitions. Second operand 3 states. [2019-01-14 15:00:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:29,316 INFO L93 Difference]: Finished difference Result 10758 states and 12675 transitions. [2019-01-14 15:00:29,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:29,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 15:00:29,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:29,335 INFO L225 Difference]: With dead ends: 10758 [2019-01-14 15:00:29,335 INFO L226 Difference]: Without dead ends: 10756 [2019-01-14 15:00:29,339 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 [2019-01-14 15:00:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10756 states. [2019-01-14 15:00:29,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10756 to 10244. [2019-01-14 15:00:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10244 states. [2019-01-14 15:00:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10244 states to 10244 states and 11906 transitions. [2019-01-14 15:00:29,591 INFO L78 Accepts]: Start accepts. Automaton has 10244 states and 11906 transitions. Word has length 23 [2019-01-14 15:00:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:29,591 INFO L480 AbstractCegarLoop]: Abstraction has 10244 states and 11906 transitions. [2019-01-14 15:00:29,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 10244 states and 11906 transitions. [2019-01-14 15:00:29,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 15:00:29,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:00:29,609 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] [2019-01-14 15:00:29,609 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:00:29,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:00:29,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1922700824, now seen corresponding path program 1 times [2019-01-14 15:00:29,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:00:29,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:00:29,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:29,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:00:29,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:00:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:00:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:00:29,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:00:29,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 15:00:29,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 15:00:29,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 15:00:29,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 15:00:29,682 INFO L87 Difference]: Start difference. First operand 10244 states and 11906 transitions. Second operand 3 states. [2019-01-14 15:00:30,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:00:30,015 INFO L93 Difference]: Finished difference Result 22788 states and 25986 transitions. [2019-01-14 15:00:30,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 15:00:30,016 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-01-14 15:00:30,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:00:30,017 INFO L225 Difference]: With dead ends: 22788 [2019-01-14 15:00:30,017 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 15:00:30,036 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 [2019-01-14 15:00:30,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 15:00:30,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 15:00:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 15:00:30,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 15:00:30,037 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-01-14 15:00:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:00:30,037 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 15:00:30,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 15:00:30,037 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 15:00:30,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 15:00:30,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 15:00:30,125 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,125 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,125 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-01-14 15:00:30,125 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,125 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-01-14 15:00:30,125 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,125 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 15:00:30,126 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2019-01-14 15:00:30,126 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 15:00:30,126 INFO L448 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,126 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,126 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-01-14 15:00:30,126 INFO L451 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-01-14 15:00:30,126 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,126 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-01-14 15:00:30,127 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,127 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-01-14 15:00:30,131 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-14 15:00:30,131 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,131 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,131 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,132 INFO L451 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-01-14 15:00:30,132 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,132 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,132 INFO L451 ceAbstractionStarter]: At program point L148(lines 4 149) the Hoare annotation is: true [2019-01-14 15:00:30,132 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-14 15:00:30,132 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-01-14 15:00:30,132 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-01-14 15:00:30,132 INFO L444 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-01-14 15:00:30,132 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,133 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 15:00:30,136 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,136 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-14 15:00:30,136 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-01-14 15:00:30,136 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,136 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-01-14 15:00:30,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:00:30 BoogieIcfgContainer [2019-01-14 15:00:30,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:00:30,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:00:30,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:00:30,147 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:00:30,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:00:22" (3/4) ... [2019-01-14 15:00:30,154 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 15:00:30,167 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 15:00:30,167 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 15:00:30,236 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:00:30,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:00:30,237 INFO L168 Benchmark]: Toolchain (without parser) took 8273.67 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 334.5 MB). Free memory was 942.0 MB in the beginning and 922.1 MB in the end (delta: 19.8 MB). Peak memory consumption was 354.3 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:30,240 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:30,240 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.15 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:30,241 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.57 ms. Allocated memory is still 1.0 GB. Free memory was 931.2 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:30,242 INFO L168 Benchmark]: Boogie Preprocessor took 30.08 ms. Allocated memory is still 1.0 GB. Free memory is still 925.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:30,242 INFO L168 Benchmark]: RCFGBuilder took 621.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:30,243 INFO L168 Benchmark]: TraceAbstraction took 7201.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 922.1 MB in the end (delta: 189.0 MB). Peak memory consumption was 381.5 MB. Max. memory is 11.5 GB. [2019-01-14 15:00:30,243 INFO L168 Benchmark]: Witness Printer took 89.23 ms. Allocated memory is still 1.4 GB. Free memory is still 922.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:00:30,247 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.15 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 931.2 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 40.57 ms. Allocated memory is still 1.0 GB. Free memory was 931.2 MB in the beginning and 925.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.08 ms. Allocated memory is still 1.0 GB. Free memory is still 925.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 621.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7201.39 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 192.4 MB). Free memory was 1.1 GB in the beginning and 922.1 MB in the end (delta: 189.0 MB). Peak memory consumption was 381.5 MB. Max. memory is 11.5 GB. * Witness Printer took 89.23 ms. Allocated memory is still 1.4 GB. Free memory is still 922.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 36]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. SAFE Result, 7.1s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 3.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1841 SDtfs, 922 SDslu, 1207 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10244occurred in iteration=24, 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: 1.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 455 ConstructedInterpolants, 0 QuantifiedInterpolants, 18136 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...