./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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_11_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 56f043bec3037ec37b4a132611abd4a337934428 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 16:10:14,709 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 16:10:14,711 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 16:10:14,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 16:10:14,725 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 16:10:14,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 16:10:14,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 16:10:14,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 16:10:14,732 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 16:10:14,733 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 16:10:14,734 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 16:10:14,734 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 16:10:14,735 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 16:10:14,736 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 16:10:14,737 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 16:10:14,739 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 16:10:14,740 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 16:10:14,742 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 16:10:14,744 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 16:10:14,746 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 16:10:14,747 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 16:10:14,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 16:10:14,751 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 16:10:14,751 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 16:10:14,751 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 16:10:14,752 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 16:10:14,754 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 16:10:14,755 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 16:10:14,756 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 16:10:14,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 16:10:14,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 16:10:14,759 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 16:10:14,759 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 16:10:14,759 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 16:10:14,760 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 16:10:14,761 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 16:10:14,761 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 16:10:14,792 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 16:10:14,792 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 16:10:14,794 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 16:10:14,794 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 16:10:14,794 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 16:10:14,795 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 16:10:14,795 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 16:10:14,795 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 16:10:14,795 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 16:10:14,795 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 16:10:14,797 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 16:10:14,797 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 16:10:14,797 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 16:10:14,797 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 16:10:14,797 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 16:10:14,798 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 16:10:14,798 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 16:10:14,798 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 16:10:14,798 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 16:10:14,798 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 16:10:14,798 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 16:10:14,800 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 16:10:14,800 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 16:10:14,800 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:10:14,801 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 16:10:14,801 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 16:10:14,801 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 16:10:14,801 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 16:10:14,801 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 16:10:14,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 16:10:14,802 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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-11-28 16:10:14,869 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 16:10:14,886 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 16:10:14,892 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 16:10:14,893 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 16:10:14,894 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 16:10:14,894 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:14,975 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfeabe617/921a7c57eef8424e9d85cd1304b48fb2/FLAG3e01357fa [2018-11-28 16:10:15,387 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 16:10:15,388 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:15,397 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfeabe617/921a7c57eef8424e9d85cd1304b48fb2/FLAG3e01357fa [2018-11-28 16:10:15,740 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfeabe617/921a7c57eef8424e9d85cd1304b48fb2 [2018-11-28 16:10:15,744 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 16:10:15,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 16:10:15,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:15,746 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 16:10:15,750 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 16:10:15,751 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:15" (1/1) ... [2018-11-28 16:10:15,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43c9800d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:15, skipping insertion in model container [2018-11-28 16:10:15,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:10:15" (1/1) ... [2018-11-28 16:10:15,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 16:10:15,796 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 16:10:16,033 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:16,039 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 16:10:16,074 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 16:10:16,090 INFO L195 MainTranslator]: Completed translation [2018-11-28 16:10:16,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16 WrapperNode [2018-11-28 16:10:16,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 16:10:16,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:16,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 16:10:16,092 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 16:10:16,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,109 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,116 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 16:10:16,116 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 16:10:16,116 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 16:10:16,117 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 16:10:16,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... [2018-11-28 16:10:16,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 16:10:16,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 16:10:16,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 16:10:16,150 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 16:10:16,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 16:10:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 16:10:16,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 16:10:16,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 16:10:16,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 16:10:16,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 16:10:16,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 16:10:16,994 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 16:10:16,994 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-28 16:10:16,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:16 BoogieIcfgContainer [2018-11-28 16:10:16,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 16:10:16,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 16:10:16,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 16:10:17,001 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 16:10:17,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:10:15" (1/3) ... [2018-11-28 16:10:17,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d940070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:17, skipping insertion in model container [2018-11-28 16:10:17,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:10:16" (2/3) ... [2018-11-28 16:10:17,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d940070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:10:17, skipping insertion in model container [2018-11-28 16:10:17,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:16" (3/3) ... [2018-11-28 16:10:17,006 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-28 16:10:17,018 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 16:10:17,028 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 16:10:17,050 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 16:10:17,088 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 16:10:17,089 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 16:10:17,089 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 16:10:17,089 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 16:10:17,091 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 16:10:17,091 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 16:10:17,092 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 16:10:17,092 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 16:10:17,092 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 16:10:17,115 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2018-11-28 16:10:17,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:17,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:17,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:17,128 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:17,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:17,135 INFO L82 PathProgramCache]: Analyzing trace with hash -316470182, now seen corresponding path program 1 times [2018-11-28 16:10:17,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:17,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:17,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:17,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:17,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:17,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:17,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:17,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:17,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:17,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:17,471 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 3 states. [2018-11-28 16:10:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:17,563 INFO L93 Difference]: Finished difference Result 93 states and 162 transitions. [2018-11-28 16:10:17,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:17,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:17,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:17,577 INFO L225 Difference]: With dead ends: 93 [2018-11-28 16:10:17,578 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 16:10:17,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:17,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 16:10:17,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2018-11-28 16:10:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 16:10:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 97 transitions. [2018-11-28 16:10:17,630 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 97 transitions. Word has length 21 [2018-11-28 16:10:17,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:17,630 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 97 transitions. [2018-11-28 16:10:17,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 97 transitions. [2018-11-28 16:10:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 16:10:17,632 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:17,632 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:17,632 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:17,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:17,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1327587432, now seen corresponding path program 1 times [2018-11-28 16:10:17,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:17,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:17,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:17,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:17,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:17,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:17,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:17,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:17,714 INFO L87 Difference]: Start difference. First operand 54 states and 97 transitions. Second operand 3 states. [2018-11-28 16:10:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:17,780 INFO L93 Difference]: Finished difference Result 127 states and 232 transitions. [2018-11-28 16:10:17,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:17,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-28 16:10:17,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:17,783 INFO L225 Difference]: With dead ends: 127 [2018-11-28 16:10:17,783 INFO L226 Difference]: Without dead ends: 78 [2018-11-28 16:10:17,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 [2018-11-28 16:10:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-28 16:10:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-28 16:10:17,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-28 16:10:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 137 transitions. [2018-11-28 16:10:17,801 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 137 transitions. Word has length 21 [2018-11-28 16:10:17,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:17,801 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 137 transitions. [2018-11-28 16:10:17,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:17,803 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 137 transitions. [2018-11-28 16:10:17,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:17,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:17,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:17,804 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:17,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1220427994, now seen corresponding path program 1 times [2018-11-28 16:10:17,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:17,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:17,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:17,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:17,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:17,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:17,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:17,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:17,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:17,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:17,904 INFO L87 Difference]: Start difference. First operand 76 states and 137 transitions. Second operand 3 states. [2018-11-28 16:10:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:17,984 INFO L93 Difference]: Finished difference Result 117 states and 207 transitions. [2018-11-28 16:10:17,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:17,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:17,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:17,987 INFO L225 Difference]: With dead ends: 117 [2018-11-28 16:10:17,987 INFO L226 Difference]: Without dead ends: 81 [2018-11-28 16:10:17,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-28 16:10:18,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-11-28 16:10:18,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-28 16:10:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 139 transitions. [2018-11-28 16:10:18,006 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 139 transitions. Word has length 22 [2018-11-28 16:10:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,006 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 139 transitions. [2018-11-28 16:10:18,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,006 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2018-11-28 16:10:18,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:18,008 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:18,008 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1794675624, now seen corresponding path program 1 times [2018-11-28 16:10:18,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:18,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,103 INFO L87 Difference]: Start difference. First operand 79 states and 139 transitions. Second operand 3 states. [2018-11-28 16:10:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,147 INFO L93 Difference]: Finished difference Result 148 states and 264 transitions. [2018-11-28 16:10:18,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,149 INFO L225 Difference]: With dead ends: 148 [2018-11-28 16:10:18,150 INFO L226 Difference]: Without dead ends: 146 [2018-11-28 16:10:18,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-28 16:10:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2018-11-28 16:10:18,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-28 16:10:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 184 transitions. [2018-11-28 16:10:18,161 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 184 transitions. Word has length 22 [2018-11-28 16:10:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,162 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 184 transitions. [2018-11-28 16:10:18,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 184 transitions. [2018-11-28 16:10:18,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-28 16:10:18,163 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,163 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:18,164 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,164 INFO L82 PathProgramCache]: Analyzing trace with hash 783558374, now seen corresponding path program 1 times [2018-11-28 16:10:18,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:18,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,260 INFO L87 Difference]: Start difference. First operand 104 states and 184 transitions. Second operand 3 states. [2018-11-28 16:10:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,346 INFO L93 Difference]: Finished difference Result 244 states and 438 transitions. [2018-11-28 16:10:18,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-28 16:10:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,349 INFO L225 Difference]: With dead ends: 244 [2018-11-28 16:10:18,349 INFO L226 Difference]: Without dead ends: 148 [2018-11-28 16:10:18,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-28 16:10:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-11-28 16:10:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-28 16:10:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 258 transitions. [2018-11-28 16:10:18,381 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 258 transitions. Word has length 22 [2018-11-28 16:10:18,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,382 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 258 transitions. [2018-11-28 16:10:18,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 258 transitions. [2018-11-28 16:10:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:18,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:18,388 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,391 INFO L82 PathProgramCache]: Analyzing trace with hash -199417107, now seen corresponding path program 1 times [2018-11-28 16:10:18,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:18,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,472 INFO L87 Difference]: Start difference. First operand 146 states and 258 transitions. Second operand 3 states. [2018-11-28 16:10:18,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,522 INFO L93 Difference]: Finished difference Result 219 states and 385 transitions. [2018-11-28 16:10:18,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,523 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:18,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,525 INFO L225 Difference]: With dead ends: 219 [2018-11-28 16:10:18,525 INFO L226 Difference]: Without dead ends: 150 [2018-11-28 16:10:18,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-28 16:10:18,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-11-28 16:10:18,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-11-28 16:10:18,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 258 transitions. [2018-11-28 16:10:18,537 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 258 transitions. Word has length 23 [2018-11-28 16:10:18,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,538 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 258 transitions. [2018-11-28 16:10:18,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,538 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 258 transitions. [2018-11-28 16:10:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:18,539 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,539 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:18,540 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1479280785, now seen corresponding path program 1 times [2018-11-28 16:10:18,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:18,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,595 INFO L87 Difference]: Start difference. First operand 148 states and 258 transitions. Second operand 3 states. [2018-11-28 16:10:18,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,649 INFO L93 Difference]: Finished difference Result 276 states and 488 transitions. [2018-11-28 16:10:18,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:18,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,653 INFO L225 Difference]: With dead ends: 276 [2018-11-28 16:10:18,653 INFO L226 Difference]: Without dead ends: 274 [2018-11-28 16:10:18,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-11-28 16:10:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 200. [2018-11-28 16:10:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-28 16:10:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 346 transitions. [2018-11-28 16:10:18,668 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 346 transitions. Word has length 23 [2018-11-28 16:10:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,669 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 346 transitions. [2018-11-28 16:10:18,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,670 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 346 transitions. [2018-11-28 16:10:18,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-28 16:10:18,672 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,672 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:18,672 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1804569261, now seen corresponding path program 1 times [2018-11-28 16:10:18,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:18,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,740 INFO L87 Difference]: Start difference. First operand 200 states and 346 transitions. Second operand 3 states. [2018-11-28 16:10:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,800 INFO L93 Difference]: Finished difference Result 472 states and 824 transitions. [2018-11-28 16:10:18,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-28 16:10:18,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:18,804 INFO L225 Difference]: With dead ends: 472 [2018-11-28 16:10:18,805 INFO L226 Difference]: Without dead ends: 282 [2018-11-28 16:10:18,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-11-28 16:10:18,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-11-28 16:10:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-11-28 16:10:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 482 transitions. [2018-11-28 16:10:18,829 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 482 transitions. Word has length 23 [2018-11-28 16:10:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:18,829 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 482 transitions. [2018-11-28 16:10:18,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 482 transitions. [2018-11-28 16:10:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 16:10:18,831 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:18,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:18,832 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:18,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1387149659, now seen corresponding path program 1 times [2018-11-28 16:10:18,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:18,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:18,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:18,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:18,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:18,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:18,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:18,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:18,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:18,948 INFO L87 Difference]: Start difference. First operand 280 states and 482 transitions. Second operand 3 states. [2018-11-28 16:10:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:18,998 INFO L93 Difference]: Finished difference Result 420 states and 720 transitions. [2018-11-28 16:10:18,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:18,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 16:10:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,002 INFO L225 Difference]: With dead ends: 420 [2018-11-28 16:10:19,002 INFO L226 Difference]: Without dead ends: 286 [2018-11-28 16:10:19,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-11-28 16:10:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-11-28 16:10:19,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-11-28 16:10:19,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 482 transitions. [2018-11-28 16:10:19,022 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 482 transitions. Word has length 24 [2018-11-28 16:10:19,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,022 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 482 transitions. [2018-11-28 16:10:19,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 482 transitions. [2018-11-28 16:10:19,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 16:10:19,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:19,029 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,030 INFO L82 PathProgramCache]: Analyzing trace with hash 107285981, now seen corresponding path program 1 times [2018-11-28 16:10:19,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:19,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,116 INFO L87 Difference]: Start difference. First operand 284 states and 482 transitions. Second operand 3 states. [2018-11-28 16:10:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:19,211 INFO L93 Difference]: Finished difference Result 524 states and 904 transitions. [2018-11-28 16:10:19,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:19,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 16:10:19,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,218 INFO L225 Difference]: With dead ends: 524 [2018-11-28 16:10:19,218 INFO L226 Difference]: Without dead ends: 522 [2018-11-28 16:10:19,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-11-28 16:10:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 392. [2018-11-28 16:10:19,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-28 16:10:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 654 transitions. [2018-11-28 16:10:19,244 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 654 transitions. Word has length 24 [2018-11-28 16:10:19,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,244 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 654 transitions. [2018-11-28 16:10:19,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 654 transitions. [2018-11-28 16:10:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-28 16:10:19,246 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:19,246 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,247 INFO L82 PathProgramCache]: Analyzing trace with hash -903831269, now seen corresponding path program 1 times [2018-11-28 16:10:19,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:19,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,335 INFO L87 Difference]: Start difference. First operand 392 states and 654 transitions. Second operand 3 states. [2018-11-28 16:10:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:19,449 INFO L93 Difference]: Finished difference Result 924 states and 1552 transitions. [2018-11-28 16:10:19,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:19,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-28 16:10:19,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,453 INFO L225 Difference]: With dead ends: 924 [2018-11-28 16:10:19,454 INFO L226 Difference]: Without dead ends: 546 [2018-11-28 16:10:19,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-11-28 16:10:19,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 544. [2018-11-28 16:10:19,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-11-28 16:10:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 902 transitions. [2018-11-28 16:10:19,478 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 902 transitions. Word has length 24 [2018-11-28 16:10:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,478 INFO L480 AbstractCegarLoop]: Abstraction has 544 states and 902 transitions. [2018-11-28 16:10:19,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 902 transitions. [2018-11-28 16:10:19,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:10:19,480 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:19,483 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,484 INFO L82 PathProgramCache]: Analyzing trace with hash -968887806, now seen corresponding path program 1 times [2018-11-28 16:10:19,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:19,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,569 INFO L87 Difference]: Start difference. First operand 544 states and 902 transitions. Second operand 3 states. [2018-11-28 16:10:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:19,663 INFO L93 Difference]: Finished difference Result 816 states and 1348 transitions. [2018-11-28 16:10:19,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:19,663 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 16:10:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,669 INFO L225 Difference]: With dead ends: 816 [2018-11-28 16:10:19,669 INFO L226 Difference]: Without dead ends: 554 [2018-11-28 16:10:19,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-11-28 16:10:19,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 552. [2018-11-28 16:10:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2018-11-28 16:10:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 902 transitions. [2018-11-28 16:10:19,698 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 902 transitions. Word has length 25 [2018-11-28 16:10:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,698 INFO L480 AbstractCegarLoop]: Abstraction has 552 states and 902 transitions. [2018-11-28 16:10:19,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,700 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 902 transitions. [2018-11-28 16:10:19,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:10:19,702 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:19,702 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2046215812, now seen corresponding path program 1 times [2018-11-28 16:10:19,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:19,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:19,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:19,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:19,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:19,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:19,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,787 INFO L87 Difference]: Start difference. First operand 552 states and 902 transitions. Second operand 3 states. [2018-11-28 16:10:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:19,895 INFO L93 Difference]: Finished difference Result 1004 states and 1672 transitions. [2018-11-28 16:10:19,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:19,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 16:10:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:19,903 INFO L225 Difference]: With dead ends: 1004 [2018-11-28 16:10:19,903 INFO L226 Difference]: Without dead ends: 1002 [2018-11-28 16:10:19,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2018-11-28 16:10:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 776. [2018-11-28 16:10:19,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-11-28 16:10:19,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1238 transitions. [2018-11-28 16:10:19,941 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1238 transitions. Word has length 25 [2018-11-28 16:10:19,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:19,941 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1238 transitions. [2018-11-28 16:10:19,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:19,941 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1238 transitions. [2018-11-28 16:10:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 16:10:19,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:19,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:19,945 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:19,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:19,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1035098562, now seen corresponding path program 1 times [2018-11-28 16:10:19,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:19,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:19,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:19,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:20,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:20,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:20,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:20,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:20,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,023 INFO L87 Difference]: Start difference. First operand 776 states and 1238 transitions. Second operand 3 states. [2018-11-28 16:10:20,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:20,153 INFO L93 Difference]: Finished difference Result 1820 states and 2920 transitions. [2018-11-28 16:10:20,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:20,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 16:10:20,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:20,162 INFO L225 Difference]: With dead ends: 1820 [2018-11-28 16:10:20,164 INFO L226 Difference]: Without dead ends: 1066 [2018-11-28 16:10:20,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2018-11-28 16:10:20,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1064. [2018-11-28 16:10:20,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2018-11-28 16:10:20,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1686 transitions. [2018-11-28 16:10:20,218 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1686 transitions. Word has length 25 [2018-11-28 16:10:20,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:20,219 INFO L480 AbstractCegarLoop]: Abstraction has 1064 states and 1686 transitions. [2018-11-28 16:10:20,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:20,220 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1686 transitions. [2018-11-28 16:10:20,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 16:10:20,223 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:20,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:20,223 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:20,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:20,224 INFO L82 PathProgramCache]: Analyzing trace with hash -991604848, now seen corresponding path program 1 times [2018-11-28 16:10:20,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:20,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:20,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:20,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:20,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:20,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:20,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:20,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:20,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:20,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,317 INFO L87 Difference]: Start difference. First operand 1064 states and 1686 transitions. Second operand 3 states. [2018-11-28 16:10:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:20,426 INFO L93 Difference]: Finished difference Result 1596 states and 2520 transitions. [2018-11-28 16:10:20,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:20,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 16:10:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:20,433 INFO L225 Difference]: With dead ends: 1596 [2018-11-28 16:10:20,434 INFO L226 Difference]: Without dead ends: 1082 [2018-11-28 16:10:20,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2018-11-28 16:10:20,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1080. [2018-11-28 16:10:20,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-11-28 16:10:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1686 transitions. [2018-11-28 16:10:20,485 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1686 transitions. Word has length 26 [2018-11-28 16:10:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:20,485 INFO L480 AbstractCegarLoop]: Abstraction has 1080 states and 1686 transitions. [2018-11-28 16:10:20,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1686 transitions. [2018-11-28 16:10:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 16:10:20,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:20,489 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:20,489 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:20,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2023498770, now seen corresponding path program 1 times [2018-11-28 16:10:20,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:20,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:20,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:20,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:20,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:20,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:20,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,562 INFO L87 Difference]: Start difference. First operand 1080 states and 1686 transitions. Second operand 3 states. [2018-11-28 16:10:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:20,677 INFO L93 Difference]: Finished difference Result 1932 states and 3080 transitions. [2018-11-28 16:10:20,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:20,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 16:10:20,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:20,688 INFO L225 Difference]: With dead ends: 1932 [2018-11-28 16:10:20,689 INFO L226 Difference]: Without dead ends: 1930 [2018-11-28 16:10:20,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-11-28 16:10:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1544. [2018-11-28 16:10:20,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-11-28 16:10:20,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2342 transitions. [2018-11-28 16:10:20,748 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2342 transitions. Word has length 26 [2018-11-28 16:10:20,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:20,748 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 2342 transitions. [2018-11-28 16:10:20,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2342 transitions. [2018-11-28 16:10:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-28 16:10:20,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:20,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:20,752 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:20,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:20,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1012381520, now seen corresponding path program 1 times [2018-11-28 16:10:20,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:20,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:20,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:20,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:20,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:20,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:20,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:20,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:20,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,825 INFO L87 Difference]: Start difference. First operand 1544 states and 2342 transitions. Second operand 3 states. [2018-11-28 16:10:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:20,941 INFO L93 Difference]: Finished difference Result 3596 states and 5480 transitions. [2018-11-28 16:10:20,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:20,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-28 16:10:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:20,953 INFO L225 Difference]: With dead ends: 3596 [2018-11-28 16:10:20,953 INFO L226 Difference]: Without dead ends: 2090 [2018-11-28 16:10:20,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:20,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2018-11-28 16:10:21,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2088. [2018-11-28 16:10:21,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2088 states. [2018-11-28 16:10:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 3142 transitions. [2018-11-28 16:10:21,041 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 3142 transitions. Word has length 26 [2018-11-28 16:10:21,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:21,041 INFO L480 AbstractCegarLoop]: Abstraction has 2088 states and 3142 transitions. [2018-11-28 16:10:21,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 3142 transitions. [2018-11-28 16:10:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 16:10:21,045 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:21,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:21,046 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:21,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:21,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1695832809, now seen corresponding path program 1 times [2018-11-28 16:10:21,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:21,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:21,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:21,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:21,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:21,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:21,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:21,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:21,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:21,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:21,114 INFO L87 Difference]: Start difference. First operand 2088 states and 3142 transitions. Second operand 3 states. [2018-11-28 16:10:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:21,237 INFO L93 Difference]: Finished difference Result 3132 states and 4696 transitions. [2018-11-28 16:10:21,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:21,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 16:10:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:21,249 INFO L225 Difference]: With dead ends: 3132 [2018-11-28 16:10:21,249 INFO L226 Difference]: Without dead ends: 2122 [2018-11-28 16:10:21,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-11-28 16:10:21,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2120. [2018-11-28 16:10:21,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2120 states. [2018-11-28 16:10:21,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2120 states to 2120 states and 3142 transitions. [2018-11-28 16:10:21,360 INFO L78 Accepts]: Start accepts. Automaton has 2120 states and 3142 transitions. Word has length 27 [2018-11-28 16:10:21,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:21,360 INFO L480 AbstractCegarLoop]: Abstraction has 2120 states and 3142 transitions. [2018-11-28 16:10:21,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 2120 states and 3142 transitions. [2018-11-28 16:10:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 16:10:21,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:21,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:21,367 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:21,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:21,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1319270809, now seen corresponding path program 1 times [2018-11-28 16:10:21,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:21,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:21,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:21,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:21,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:21,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:21,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:21,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:21,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:21,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:21,444 INFO L87 Difference]: Start difference. First operand 2120 states and 3142 transitions. Second operand 3 states. [2018-11-28 16:10:21,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:21,584 INFO L93 Difference]: Finished difference Result 3724 states and 5640 transitions. [2018-11-28 16:10:21,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:21,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 16:10:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:21,601 INFO L225 Difference]: With dead ends: 3724 [2018-11-28 16:10:21,602 INFO L226 Difference]: Without dead ends: 3722 [2018-11-28 16:10:21,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:21,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-11-28 16:10:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3080. [2018-11-28 16:10:21,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2018-11-28 16:10:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4422 transitions. [2018-11-28 16:10:21,701 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4422 transitions. Word has length 27 [2018-11-28 16:10:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:21,701 INFO L480 AbstractCegarLoop]: Abstraction has 3080 states and 4422 transitions. [2018-11-28 16:10:21,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:21,702 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4422 transitions. [2018-11-28 16:10:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-28 16:10:21,708 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:21,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:21,709 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:21,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 308153559, now seen corresponding path program 1 times [2018-11-28 16:10:21,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:21,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:21,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:21,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:21,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:21,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:21,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:21,779 INFO L87 Difference]: Start difference. First operand 3080 states and 4422 transitions. Second operand 3 states. [2018-11-28 16:10:21,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:21,922 INFO L93 Difference]: Finished difference Result 7116 states and 10248 transitions. [2018-11-28 16:10:21,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:21,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-28 16:10:21,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:21,941 INFO L225 Difference]: With dead ends: 7116 [2018-11-28 16:10:21,941 INFO L226 Difference]: Without dead ends: 4106 [2018-11-28 16:10:21,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-11-28 16:10:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 4104. [2018-11-28 16:10:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-11-28 16:10:22,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 5830 transitions. [2018-11-28 16:10:22,083 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 5830 transitions. Word has length 27 [2018-11-28 16:10:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:22,083 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 5830 transitions. [2018-11-28 16:10:22,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 5830 transitions. [2018-11-28 16:10:22,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 16:10:22,089 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:22,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:22,090 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:22,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:22,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2052062779, now seen corresponding path program 1 times [2018-11-28 16:10:22,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:22,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:22,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:22,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:22,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:22,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:22,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:22,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:22,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:22,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:22,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:22,157 INFO L87 Difference]: Start difference. First operand 4104 states and 5830 transitions. Second operand 3 states. [2018-11-28 16:10:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:22,309 INFO L93 Difference]: Finished difference Result 6156 states and 8712 transitions. [2018-11-28 16:10:22,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:22,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 16:10:22,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:22,336 INFO L225 Difference]: With dead ends: 6156 [2018-11-28 16:10:22,336 INFO L226 Difference]: Without dead ends: 4170 [2018-11-28 16:10:22,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2018-11-28 16:10:22,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2018-11-28 16:10:22,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4168 states. [2018-11-28 16:10:22,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 5830 transitions. [2018-11-28 16:10:22,491 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 5830 transitions. Word has length 28 [2018-11-28 16:10:22,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:22,492 INFO L480 AbstractCegarLoop]: Abstraction has 4168 states and 5830 transitions. [2018-11-28 16:10:22,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:22,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 5830 transitions. [2018-11-28 16:10:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 16:10:22,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:22,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:22,498 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:22,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:22,498 INFO L82 PathProgramCache]: Analyzing trace with hash 963040839, now seen corresponding path program 1 times [2018-11-28 16:10:22,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:22,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:22,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:22,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:22,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:22,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:22,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:22,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:22,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:22,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:22,562 INFO L87 Difference]: Start difference. First operand 4168 states and 5830 transitions. Second operand 3 states. [2018-11-28 16:10:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:22,802 INFO L93 Difference]: Finished difference Result 12108 states and 16712 transitions. [2018-11-28 16:10:22,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:22,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 16:10:22,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:22,840 INFO L225 Difference]: With dead ends: 12108 [2018-11-28 16:10:22,840 INFO L226 Difference]: Without dead ends: 8074 [2018-11-28 16:10:22,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:22,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-11-28 16:10:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 8072. [2018-11-28 16:10:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-11-28 16:10:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10886 transitions. [2018-11-28 16:10:23,095 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10886 transitions. Word has length 28 [2018-11-28 16:10:23,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:23,095 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10886 transitions. [2018-11-28 16:10:23,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10886 transitions. [2018-11-28 16:10:23,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 16:10:23,106 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:23,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:23,107 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:23,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:23,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1974158089, now seen corresponding path program 1 times [2018-11-28 16:10:23,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:23,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:23,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:23,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:23,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:23,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:23,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:23,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:23,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:23,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:23,176 INFO L87 Difference]: Start difference. First operand 8072 states and 10886 transitions. Second operand 3 states. [2018-11-28 16:10:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:23,431 INFO L93 Difference]: Finished difference Result 9100 states and 12680 transitions. [2018-11-28 16:10:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:23,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-28 16:10:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:23,451 INFO L225 Difference]: With dead ends: 9100 [2018-11-28 16:10:23,452 INFO L226 Difference]: Without dead ends: 9098 [2018-11-28 16:10:23,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9098 states. [2018-11-28 16:10:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9098 to 8072. [2018-11-28 16:10:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8072 states. [2018-11-28 16:10:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8072 states to 8072 states and 10758 transitions. [2018-11-28 16:10:23,739 INFO L78 Accepts]: Start accepts. Automaton has 8072 states and 10758 transitions. Word has length 28 [2018-11-28 16:10:23,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:23,739 INFO L480 AbstractCegarLoop]: Abstraction has 8072 states and 10758 transitions. [2018-11-28 16:10:23,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:23,740 INFO L276 IsEmpty]: Start isEmpty. Operand 8072 states and 10758 transitions. [2018-11-28 16:10:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 16:10:23,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:23,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:23,750 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:23,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:23,750 INFO L82 PathProgramCache]: Analyzing trace with hash -210289620, now seen corresponding path program 1 times [2018-11-28 16:10:23,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:23,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:23,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:23,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:23,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:23,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:23,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:23,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:23,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:23,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:23,817 INFO L87 Difference]: Start difference. First operand 8072 states and 10758 transitions. Second operand 3 states. [2018-11-28 16:10:24,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:24,111 INFO L93 Difference]: Finished difference Result 13708 states and 18568 transitions. [2018-11-28 16:10:24,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:24,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 16:10:24,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:24,140 INFO L225 Difference]: With dead ends: 13708 [2018-11-28 16:10:24,141 INFO L226 Difference]: Without dead ends: 13706 [2018-11-28 16:10:24,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13706 states. [2018-11-28 16:10:24,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13706 to 12168. [2018-11-28 16:10:24,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12168 states. [2018-11-28 16:10:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12168 states to 12168 states and 15750 transitions. [2018-11-28 16:10:24,444 INFO L78 Accepts]: Start accepts. Automaton has 12168 states and 15750 transitions. Word has length 29 [2018-11-28 16:10:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:24,444 INFO L480 AbstractCegarLoop]: Abstraction has 12168 states and 15750 transitions. [2018-11-28 16:10:24,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 12168 states and 15750 transitions. [2018-11-28 16:10:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-28 16:10:24,463 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:24,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:24,463 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:24,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1221406870, now seen corresponding path program 1 times [2018-11-28 16:10:24,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:24,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:24,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:24,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:24,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:24,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:24,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:24,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:24,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:24,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:24,531 INFO L87 Difference]: Start difference. First operand 12168 states and 15750 transitions. Second operand 3 states. [2018-11-28 16:10:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:24,884 INFO L93 Difference]: Finished difference Result 27788 states and 35976 transitions. [2018-11-28 16:10:24,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:24,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-28 16:10:24,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:24,915 INFO L225 Difference]: With dead ends: 27788 [2018-11-28 16:10:24,915 INFO L226 Difference]: Without dead ends: 15754 [2018-11-28 16:10:24,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15754 states. [2018-11-28 16:10:25,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15754 to 15752. [2018-11-28 16:10:25,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15752 states. [2018-11-28 16:10:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15752 states to 15752 states and 19974 transitions. [2018-11-28 16:10:25,454 INFO L78 Accepts]: Start accepts. Automaton has 15752 states and 19974 transitions. Word has length 29 [2018-11-28 16:10:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:25,454 INFO L480 AbstractCegarLoop]: Abstraction has 15752 states and 19974 transitions. [2018-11-28 16:10:25,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 15752 states and 19974 transitions. [2018-11-28 16:10:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 16:10:25,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:25,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:25,475 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:25,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:25,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2071172156, now seen corresponding path program 1 times [2018-11-28 16:10:25,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:25,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:25,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:25,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:25,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:25,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:25,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:25,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:25,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:25,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:25,541 INFO L87 Difference]: Start difference. First operand 15752 states and 19974 transitions. Second operand 3 states. [2018-11-28 16:10:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:25,870 INFO L93 Difference]: Finished difference Result 23820 states and 30216 transitions. [2018-11-28 16:10:25,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:25,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 16:10:25,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:25,903 INFO L225 Difference]: With dead ends: 23820 [2018-11-28 16:10:25,903 INFO L226 Difference]: Without dead ends: 16138 [2018-11-28 16:10:25,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:25,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16138 states. [2018-11-28 16:10:26,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16138 to 16136. [2018-11-28 16:10:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16136 states. [2018-11-28 16:10:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16136 states to 16136 states and 20230 transitions. [2018-11-28 16:10:26,338 INFO L78 Accepts]: Start accepts. Automaton has 16136 states and 20230 transitions. Word has length 30 [2018-11-28 16:10:26,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:26,339 INFO L480 AbstractCegarLoop]: Abstraction has 16136 states and 20230 transitions. [2018-11-28 16:10:26,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 16136 states and 20230 transitions. [2018-11-28 16:10:26,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 16:10:26,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:26,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:26,354 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:26,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:26,354 INFO L82 PathProgramCache]: Analyzing trace with hash 791308478, now seen corresponding path program 1 times [2018-11-28 16:10:26,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:26,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:26,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:26,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:26,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:26,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:26,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:26,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:26,402 INFO L87 Difference]: Start difference. First operand 16136 states and 20230 transitions. Second operand 3 states. [2018-11-28 16:10:26,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:26,993 INFO L93 Difference]: Finished difference Result 26636 states and 33544 transitions. [2018-11-28 16:10:26,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:26,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 16:10:26,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:27,031 INFO L225 Difference]: With dead ends: 26636 [2018-11-28 16:10:27,032 INFO L226 Difference]: Without dead ends: 26634 [2018-11-28 16:10:27,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26634 states. [2018-11-28 16:10:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26634 to 24584. [2018-11-28 16:10:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24584 states. [2018-11-28 16:10:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24584 states to 24584 states and 29958 transitions. [2018-11-28 16:10:27,561 INFO L78 Accepts]: Start accepts. Automaton has 24584 states and 29958 transitions. Word has length 30 [2018-11-28 16:10:27,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:27,561 INFO L480 AbstractCegarLoop]: Abstraction has 24584 states and 29958 transitions. [2018-11-28 16:10:27,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:27,561 INFO L276 IsEmpty]: Start isEmpty. Operand 24584 states and 29958 transitions. [2018-11-28 16:10:27,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-28 16:10:27,592 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:27,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:27,592 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:27,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:27,592 INFO L82 PathProgramCache]: Analyzing trace with hash -219808772, now seen corresponding path program 1 times [2018-11-28 16:10:27,593 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:27,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:27,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:27,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:27,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:27,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:27,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:27,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:27,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:27,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:27,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:27,661 INFO L87 Difference]: Start difference. First operand 24584 states and 29958 transitions. Second operand 3 states. [2018-11-28 16:10:28,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:28,140 INFO L93 Difference]: Finished difference Result 55308 states and 66824 transitions. [2018-11-28 16:10:28,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:28,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-28 16:10:28,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:28,183 INFO L225 Difference]: With dead ends: 55308 [2018-11-28 16:10:28,184 INFO L226 Difference]: Without dead ends: 31242 [2018-11-28 16:10:28,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:28,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31242 states. [2018-11-28 16:10:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31242 to 31240. [2018-11-28 16:10:29,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31240 states. [2018-11-28 16:10:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31240 states to 31240 states and 36870 transitions. [2018-11-28 16:10:29,146 INFO L78 Accepts]: Start accepts. Automaton has 31240 states and 36870 transitions. Word has length 30 [2018-11-28 16:10:29,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:29,147 INFO L480 AbstractCegarLoop]: Abstraction has 31240 states and 36870 transitions. [2018-11-28 16:10:29,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 31240 states and 36870 transitions. [2018-11-28 16:10:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 16:10:29,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:29,166 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:29,167 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:29,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:29,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1239024833, now seen corresponding path program 1 times [2018-11-28 16:10:29,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:29,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:29,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:29,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:29,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:29,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:29,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:29,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:29,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:29,232 INFO L87 Difference]: Start difference. First operand 31240 states and 36870 transitions. Second operand 3 states. [2018-11-28 16:10:29,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:29,715 INFO L93 Difference]: Finished difference Result 46860 states and 55048 transitions. [2018-11-28 16:10:29,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:29,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 16:10:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:29,748 INFO L225 Difference]: With dead ends: 46860 [2018-11-28 16:10:29,748 INFO L226 Difference]: Without dead ends: 31754 [2018-11-28 16:10:29,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31754 states. [2018-11-28 16:10:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31754 to 31752. [2018-11-28 16:10:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31752 states. [2018-11-28 16:10:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31752 states to 31752 states and 36870 transitions. [2018-11-28 16:10:30,682 INFO L78 Accepts]: Start accepts. Automaton has 31752 states and 36870 transitions. Word has length 31 [2018-11-28 16:10:30,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:30,683 INFO L480 AbstractCegarLoop]: Abstraction has 31752 states and 36870 transitions. [2018-11-28 16:10:30,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:30,683 INFO L276 IsEmpty]: Start isEmpty. Operand 31752 states and 36870 transitions. [2018-11-28 16:10:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 16:10:30,700 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:30,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:30,701 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:30,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:30,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1776078785, now seen corresponding path program 1 times [2018-11-28 16:10:30,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:30,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:30,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:30,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:30,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:30,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:30,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:30,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:30,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:30,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:30,775 INFO L87 Difference]: Start difference. First operand 31752 states and 36870 transitions. Second operand 3 states. [2018-11-28 16:10:31,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:31,529 INFO L93 Difference]: Finished difference Result 51210 states and 58887 transitions. [2018-11-28 16:10:31,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:31,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 16:10:31,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:31,583 INFO L225 Difference]: With dead ends: 51210 [2018-11-28 16:10:31,583 INFO L226 Difference]: Without dead ends: 51208 [2018-11-28 16:10:31,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:31,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51208 states. [2018-11-28 16:10:32,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51208 to 49160. [2018-11-28 16:10:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49160 states. [2018-11-28 16:10:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49160 states to 49160 states and 55814 transitions. [2018-11-28 16:10:32,518 INFO L78 Accepts]: Start accepts. Automaton has 49160 states and 55814 transitions. Word has length 31 [2018-11-28 16:10:32,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:32,518 INFO L480 AbstractCegarLoop]: Abstraction has 49160 states and 55814 transitions. [2018-11-28 16:10:32,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 49160 states and 55814 transitions. [2018-11-28 16:10:32,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 16:10:32,561 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 16:10:32,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 16:10:32,561 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 16:10:32,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 16:10:32,563 INFO L82 PathProgramCache]: Analyzing trace with hash 764961535, now seen corresponding path program 1 times [2018-11-28 16:10:32,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 16:10:32,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 16:10:32,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 16:10:32,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 16:10:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 16:10:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 16:10:32,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 16:10:32,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 16:10:32,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 16:10:32,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 16:10:32,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:32,629 INFO L87 Difference]: Start difference. First operand 49160 states and 55814 transitions. Second operand 3 states. [2018-11-28 16:10:33,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 16:10:33,987 INFO L93 Difference]: Finished difference Result 109576 states and 122374 transitions. [2018-11-28 16:10:33,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 16:10:33,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-28 16:10:33,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 16:10:33,988 INFO L225 Difference]: With dead ends: 109576 [2018-11-28 16:10:33,988 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 16:10:34,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 16:10:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 16:10:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 16:10:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 16:10:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 16:10:34,085 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-11-28 16:10:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 16:10:34,085 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 16:10:34,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 16:10:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 16:10:34,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 16:10:34,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 16:10:34,166 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-28 16:10:34,166 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:34,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 16:10:34,167 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 16:10:34,167 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 16:10:34,167 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 16:10:34,167 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-11-28 16:10:34,167 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-28 16:10:34,167 INFO L448 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-11-28 16:10:34,167 INFO L448 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-11-28 16:10:34,167 INFO L448 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-28 16:10:34,167 INFO L444 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-11-28 16:10:34,168 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,168 INFO L448 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,168 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,168 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,168 INFO L448 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-11-28 16:10:34,168 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,168 INFO L448 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-28 16:10:34,168 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,168 INFO L448 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,168 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-11-28 16:10:34,168 INFO L448 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,169 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-11-28 16:10:34,169 INFO L448 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,169 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,169 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-11-28 16:10:34,169 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-28 16:10:34,169 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-28 16:10:34,169 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-11-28 16:10:34,170 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,170 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,170 INFO L448 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-28 16:10:34,170 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-28 16:10:34,170 INFO L451 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-11-28 16:10:34,170 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,170 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,170 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,170 INFO L448 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,171 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,171 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,171 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,171 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-28 16:10:34,171 INFO L448 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-11-28 16:10:34,171 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,171 INFO L448 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-11-28 16:10:34,171 INFO L451 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-11-28 16:10:34,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:10:34 BoogieIcfgContainer [2018-11-28 16:10:34,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 16:10:34,197 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 16:10:34,197 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 16:10:34,199 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 16:10:34,200 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:10:16" (3/4) ... [2018-11-28 16:10:34,211 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 16:10:34,219 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 16:10:34,220 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 16:10:34,228 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-28 16:10:34,229 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-28 16:10:34,230 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-28 16:10:34,332 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 16:10:34,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 16:10:34,333 INFO L168 Benchmark]: Toolchain (without parser) took 18589.27 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 946.3 MB). Free memory was 946.0 MB in the beginning and 1.2 GB in the end (delta: -260.3 MB). Peak memory consumption was 686.0 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:34,341 INFO L168 Benchmark]: CDTParser took 0.71 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:34,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.01 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:34,342 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.80 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:34,343 INFO L168 Benchmark]: Boogie Preprocessor took 32.73 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:34,343 INFO L168 Benchmark]: RCFGBuilder took 845.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:34,343 INFO L168 Benchmark]: TraceAbstraction took 17199.75 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 831.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -123.0 MB). Peak memory consumption was 708.0 MB. Max. memory is 11.5 GB. [2018-11-28 16:10:34,344 INFO L168 Benchmark]: Witness Printer took 135.36 ms. Allocated memory is still 2.0 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 16:10:34,347 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.71 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 345.01 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.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 24.80 ms. Allocated memory is still 1.0 GB. Free memory was 935.2 MB in the beginning and 929.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 32.73 ms. Allocated memory is still 1.0 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 845.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17199.75 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 831.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -123.0 MB). Peak memory consumption was 708.0 MB. Max. memory is 11.5 GB. * Witness Printer took 135.36 ms. Allocated memory is still 2.0 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. SAFE Result, 17.0s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2877 SDtfs, 1405 SDslu, 1967 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49160occurred in iteration=30, 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: 6.0s AutomataMinimizationTime, 31 MinimizatonAttempts, 8224 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 777 ConstructedInterpolants, 0 QuantifiedInterpolants, 39912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...