./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer --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 0f7b0b589689413087c164ce10eb80c902ee4046 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 02:40:39,742 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 02:40:39,743 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 02:40:39,749 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 02:40:39,749 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 02:40:39,749 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 02:40:39,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 02:40:39,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 02:40:39,751 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 02:40:39,752 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 02:40:39,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 02:40:39,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 02:40:39,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 02:40:39,753 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 02:40:39,754 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 02:40:39,754 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 02:40:39,754 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 02:40:39,755 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 02:40:39,756 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 02:40:39,757 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 02:40:39,757 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 02:40:39,758 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 02:40:39,759 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 02:40:39,759 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 02:40:39,759 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 02:40:39,759 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 02:40:39,760 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 02:40:39,760 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 02:40:39,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 02:40:39,761 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 02:40:39,761 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 02:40:39,762 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 02:40:39,762 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 02:40:39,762 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 02:40:39,762 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 02:40:39,762 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 02:40:39,763 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 02:40:39,769 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 02:40:39,769 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 02:40:39,770 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 02:40:39,770 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 02:40:39,770 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 02:40:39,770 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 02:40:39,770 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 02:40:39,770 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 02:40:39,771 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 02:40:39,771 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 02:40:39,771 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 02:40:39,771 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 02:40:39,771 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 02:40:39,771 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 02:40:39,771 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 02:40:39,771 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 02:40:39,771 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 02:40:39,771 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 02:40:39,771 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 02:40:39,772 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 02:40:39,772 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 02:40:39,772 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 02:40:39,772 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 02:40:39,772 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:40:39,772 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 02:40:39,772 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 02:40:39,772 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 02:40:39,772 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 02:40:39,772 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 02:40:39,773 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 02:40:39,773 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer 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 -> 0f7b0b589689413087c164ce10eb80c902ee4046 [2018-12-02 02:40:39,790 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 02:40:39,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 02:40:39,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 02:40:39,801 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 02:40:39,801 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 02:40:39,801 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 02:40:39,835 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer/data/32baafc01/730eff325a88462a8951767d4d948e51/FLAG6b803b179 [2018-12-02 02:40:40,159 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 02:40:40,159 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/sv-benchmarks/c/locks/test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 02:40:40,163 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer/data/32baafc01/730eff325a88462a8951767d4d948e51/FLAG6b803b179 [2018-12-02 02:40:40,572 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer/data/32baafc01/730eff325a88462a8951767d4d948e51 [2018-12-02 02:40:40,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 02:40:40,575 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 02:40:40,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 02:40:40,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 02:40:40,578 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 02:40:40,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:40:40" (1/1) ... [2018-12-02 02:40:40,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c96088f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40, skipping insertion in model container [2018-12-02 02:40:40,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:40:40" (1/1) ... [2018-12-02 02:40:40,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 02:40:40,600 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 02:40:40,709 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:40:40,712 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 02:40:40,730 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 02:40:40,741 INFO L195 MainTranslator]: Completed translation [2018-12-02 02:40:40,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40 WrapperNode [2018-12-02 02:40:40,742 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 02:40:40,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 02:40:40,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 02:40:40,742 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 02:40:40,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40" (1/1) ... [2018-12-02 02:40:40,751 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40" (1/1) ... [2018-12-02 02:40:40,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 02:40:40,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 02:40:40,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 02:40:40,756 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 02:40:40,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40" (1/1) ... [2018-12-02 02:40:40,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40" (1/1) ... [2018-12-02 02:40:40,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40" (1/1) ... [2018-12-02 02:40:40,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40" (1/1) ... [2018-12-02 02:40:40,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40" (1/1) ... [2018-12-02 02:40:40,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40" (1/1) ... [2018-12-02 02:40:40,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40" (1/1) ... [2018-12-02 02:40:40,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 02:40:40,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 02:40:40,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 02:40:40,804 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 02:40:40,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 02:40:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 02:40:40,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 02:40:40,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 02:40:40,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 02:40:40,839 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 02:40:40,839 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 02:40:40,985 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 02:40:40,985 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 02:40:40,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:40:40 BoogieIcfgContainer [2018-12-02 02:40:40,986 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 02:40:40,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 02:40:40,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 02:40:40,988 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 02:40:40,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:40:40" (1/3) ... [2018-12-02 02:40:40,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5579e1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:40:40, skipping insertion in model container [2018-12-02 02:40:40,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:40:40" (2/3) ... [2018-12-02 02:40:40,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5579e1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:40:40, skipping insertion in model container [2018-12-02 02:40:40,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:40:40" (3/3) ... [2018-12-02 02:40:40,990 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 02:40:40,996 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 02:40:41,000 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 02:40:41,010 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 02:40:41,028 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 02:40:41,029 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 02:40:41,029 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 02:40:41,029 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 02:40:41,029 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 02:40:41,029 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 02:40:41,029 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 02:40:41,029 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 02:40:41,029 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 02:40:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-12-02 02:40:41,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 02:40:41,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,047 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,050 INFO L82 PathProgramCache]: Analyzing trace with hash -917347053, now seen corresponding path program 1 times [2018-12-02 02:40:41,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,159 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 3 states. [2018-12-02 02:40:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,187 INFO L93 Difference]: Finished difference Result 87 states and 150 transitions. [2018-12-02 02:40:41,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 02:40:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,194 INFO L225 Difference]: With dead ends: 87 [2018-12-02 02:40:41,195 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 02:40:41,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 02:40:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 50. [2018-12-02 02:40:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-02 02:40:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 89 transitions. [2018-12-02 02:40:41,220 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 89 transitions. Word has length 20 [2018-12-02 02:40:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,220 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 89 transitions. [2018-12-02 02:40:41,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,220 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 89 transitions. [2018-12-02 02:40:41,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 02:40:41,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,221 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1504153067, now seen corresponding path program 1 times [2018-12-02 02:40:41,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,250 INFO L87 Difference]: Start difference. First operand 50 states and 89 transitions. Second operand 3 states. [2018-12-02 02:40:41,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,272 INFO L93 Difference]: Finished difference Result 117 states and 212 transitions. [2018-12-02 02:40:41,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 02:40:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,274 INFO L225 Difference]: With dead ends: 117 [2018-12-02 02:40:41,274 INFO L226 Difference]: Without dead ends: 72 [2018-12-02 02:40:41,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-02 02:40:41,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-12-02 02:40:41,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-02 02:40:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 125 transitions. [2018-12-02 02:40:41,282 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 125 transitions. Word has length 20 [2018-12-02 02:40:41,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,282 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 125 transitions. [2018-12-02 02:40:41,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 125 transitions. [2018-12-02 02:40:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 02:40:41,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,283 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1627225809, now seen corresponding path program 1 times [2018-12-02 02:40:41,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,306 INFO L87 Difference]: Start difference. First operand 70 states and 125 transitions. Second operand 3 states. [2018-12-02 02:40:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,317 INFO L93 Difference]: Finished difference Result 108 states and 189 transitions. [2018-12-02 02:40:41,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 02:40:41,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,317 INFO L225 Difference]: With dead ends: 108 [2018-12-02 02:40:41,318 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 02:40:41,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 02:40:41,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-12-02 02:40:41,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-02 02:40:41,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 127 transitions. [2018-12-02 02:40:41,322 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 127 transitions. Word has length 21 [2018-12-02 02:40:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,322 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 127 transitions. [2018-12-02 02:40:41,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2018-12-02 02:40:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 02:40:41,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,323 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,323 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,323 INFO L82 PathProgramCache]: Analyzing trace with hash 616108559, now seen corresponding path program 1 times [2018-12-02 02:40:41,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,345 INFO L87 Difference]: Start difference. First operand 73 states and 127 transitions. Second operand 3 states. [2018-12-02 02:40:41,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,355 INFO L93 Difference]: Finished difference Result 136 states and 240 transitions. [2018-12-02 02:40:41,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 02:40:41,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,356 INFO L225 Difference]: With dead ends: 136 [2018-12-02 02:40:41,356 INFO L226 Difference]: Without dead ends: 134 [2018-12-02 02:40:41,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-02 02:40:41,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-12-02 02:40:41,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-02 02:40:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 168 transitions. [2018-12-02 02:40:41,361 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 168 transitions. Word has length 21 [2018-12-02 02:40:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,361 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 168 transitions. [2018-12-02 02:40:41,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,361 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 168 transitions. [2018-12-02 02:40:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 02:40:41,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,362 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,362 INFO L82 PathProgramCache]: Analyzing trace with hash 29302545, now seen corresponding path program 1 times [2018-12-02 02:40:41,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,377 INFO L87 Difference]: Start difference. First operand 96 states and 168 transitions. Second operand 3 states. [2018-12-02 02:40:41,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,390 INFO L93 Difference]: Finished difference Result 224 states and 398 transitions. [2018-12-02 02:40:41,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 02:40:41,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,391 INFO L225 Difference]: With dead ends: 224 [2018-12-02 02:40:41,391 INFO L226 Difference]: Without dead ends: 136 [2018-12-02 02:40:41,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-02 02:40:41,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-12-02 02:40:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-02 02:40:41,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 234 transitions. [2018-12-02 02:40:41,400 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 234 transitions. Word has length 21 [2018-12-02 02:40:41,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,401 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 234 transitions. [2018-12-02 02:40:41,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,401 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 234 transitions. [2018-12-02 02:40:41,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 02:40:41,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,402 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1919709866, now seen corresponding path program 1 times [2018-12-02 02:40:41,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,420 INFO L87 Difference]: Start difference. First operand 134 states and 234 transitions. Second operand 3 states. [2018-12-02 02:40:41,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,428 INFO L93 Difference]: Finished difference Result 201 states and 349 transitions. [2018-12-02 02:40:41,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 02:40:41,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,429 INFO L225 Difference]: With dead ends: 201 [2018-12-02 02:40:41,429 INFO L226 Difference]: Without dead ends: 138 [2018-12-02 02:40:41,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-02 02:40:41,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-12-02 02:40:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-02 02:40:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 234 transitions. [2018-12-02 02:40:41,434 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 234 transitions. Word has length 22 [2018-12-02 02:40:41,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,434 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 234 transitions. [2018-12-02 02:40:41,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 234 transitions. [2018-12-02 02:40:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 02:40:41,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,435 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,435 INFO L82 PathProgramCache]: Analyzing trace with hash 908592616, now seen corresponding path program 1 times [2018-12-02 02:40:41,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,456 INFO L87 Difference]: Start difference. First operand 136 states and 234 transitions. Second operand 3 states. [2018-12-02 02:40:41,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,468 INFO L93 Difference]: Finished difference Result 252 states and 440 transitions. [2018-12-02 02:40:41,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 02:40:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,469 INFO L225 Difference]: With dead ends: 252 [2018-12-02 02:40:41,469 INFO L226 Difference]: Without dead ends: 250 [2018-12-02 02:40:41,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-02 02:40:41,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 184. [2018-12-02 02:40:41,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-02 02:40:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 314 transitions. [2018-12-02 02:40:41,476 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 314 transitions. Word has length 22 [2018-12-02 02:40:41,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,476 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 314 transitions. [2018-12-02 02:40:41,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,476 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 314 transitions. [2018-12-02 02:40:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 02:40:41,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,477 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,477 INFO L82 PathProgramCache]: Analyzing trace with hash 321786602, now seen corresponding path program 1 times [2018-12-02 02:40:41,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,497 INFO L87 Difference]: Start difference. First operand 184 states and 314 transitions. Second operand 3 states. [2018-12-02 02:40:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,510 INFO L93 Difference]: Finished difference Result 432 states and 744 transitions. [2018-12-02 02:40:41,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 02:40:41,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,511 INFO L225 Difference]: With dead ends: 432 [2018-12-02 02:40:41,511 INFO L226 Difference]: Without dead ends: 258 [2018-12-02 02:40:41,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-02 02:40:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-12-02 02:40:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-02 02:40:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 434 transitions. [2018-12-02 02:40:41,523 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 434 transitions. Word has length 22 [2018-12-02 02:40:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,523 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 434 transitions. [2018-12-02 02:40:41,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 434 transitions. [2018-12-02 02:40:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 02:40:41,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,525 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1898185914, now seen corresponding path program 1 times [2018-12-02 02:40:41,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,541 INFO L87 Difference]: Start difference. First operand 256 states and 434 transitions. Second operand 3 states. [2018-12-02 02:40:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,554 INFO L93 Difference]: Finished difference Result 384 states and 648 transitions. [2018-12-02 02:40:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 02:40:41,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,555 INFO L225 Difference]: With dead ends: 384 [2018-12-02 02:40:41,555 INFO L226 Difference]: Without dead ends: 262 [2018-12-02 02:40:41,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-12-02 02:40:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-12-02 02:40:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-02 02:40:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 434 transitions. [2018-12-02 02:40:41,562 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 434 transitions. Word has length 23 [2018-12-02 02:40:41,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,563 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 434 transitions. [2018-12-02 02:40:41,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,563 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 434 transitions. [2018-12-02 02:40:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 02:40:41,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,564 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1385664132, now seen corresponding path program 1 times [2018-12-02 02:40:41,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,585 INFO L87 Difference]: Start difference. First operand 260 states and 434 transitions. Second operand 3 states. [2018-12-02 02:40:41,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,599 INFO L93 Difference]: Finished difference Result 476 states and 808 transitions. [2018-12-02 02:40:41,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 02:40:41,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,601 INFO L225 Difference]: With dead ends: 476 [2018-12-02 02:40:41,601 INFO L226 Difference]: Without dead ends: 474 [2018-12-02 02:40:41,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-12-02 02:40:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 360. [2018-12-02 02:40:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-02 02:40:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 590 transitions. [2018-12-02 02:40:41,611 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 590 transitions. Word has length 23 [2018-12-02 02:40:41,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,611 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 590 transitions. [2018-12-02 02:40:41,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,611 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 590 transitions. [2018-12-02 02:40:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 02:40:41,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,612 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,612 INFO L82 PathProgramCache]: Analyzing trace with hash 798858118, now seen corresponding path program 1 times [2018-12-02 02:40:41,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,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-12-02 02:40:41,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,629 INFO L87 Difference]: Start difference. First operand 360 states and 590 transitions. Second operand 3 states. [2018-12-02 02:40:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,647 INFO L93 Difference]: Finished difference Result 844 states and 1392 transitions. [2018-12-02 02:40:41,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 02:40:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,649 INFO L225 Difference]: With dead ends: 844 [2018-12-02 02:40:41,649 INFO L226 Difference]: Without dead ends: 498 [2018-12-02 02:40:41,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-12-02 02:40:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2018-12-02 02:40:41,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-12-02 02:40:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 806 transitions. [2018-12-02 02:40:41,666 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 806 transitions. Word has length 23 [2018-12-02 02:40:41,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,666 INFO L480 AbstractCegarLoop]: Abstraction has 496 states and 806 transitions. [2018-12-02 02:40:41,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,666 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 806 transitions. [2018-12-02 02:40:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 02:40:41,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,668 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash 6129535, now seen corresponding path program 1 times [2018-12-02 02:40:41,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,686 INFO L87 Difference]: Start difference. First operand 496 states and 806 transitions. Second operand 3 states. [2018-12-02 02:40:41,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,705 INFO L93 Difference]: Finished difference Result 744 states and 1204 transitions. [2018-12-02 02:40:41,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 02:40:41,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,707 INFO L225 Difference]: With dead ends: 744 [2018-12-02 02:40:41,707 INFO L226 Difference]: Without dead ends: 506 [2018-12-02 02:40:41,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2018-12-02 02:40:41,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 504. [2018-12-02 02:40:41,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-12-02 02:40:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 806 transitions. [2018-12-02 02:40:41,720 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 806 transitions. Word has length 24 [2018-12-02 02:40:41,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,720 INFO L480 AbstractCegarLoop]: Abstraction has 504 states and 806 transitions. [2018-12-02 02:40:41,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 806 transitions. [2018-12-02 02:40:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 02:40:41,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,721 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1004987715, now seen corresponding path program 1 times [2018-12-02 02:40:41,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,737 INFO L87 Difference]: Start difference. First operand 504 states and 806 transitions. Second operand 3 states. [2018-12-02 02:40:41,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,757 INFO L93 Difference]: Finished difference Result 908 states and 1480 transitions. [2018-12-02 02:40:41,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 02:40:41,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,759 INFO L225 Difference]: With dead ends: 908 [2018-12-02 02:40:41,759 INFO L226 Difference]: Without dead ends: 906 [2018-12-02 02:40:41,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-12-02 02:40:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 712. [2018-12-02 02:40:41,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2018-12-02 02:40:41,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1110 transitions. [2018-12-02 02:40:41,773 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1110 transitions. Word has length 24 [2018-12-02 02:40:41,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,773 INFO L480 AbstractCegarLoop]: Abstraction has 712 states and 1110 transitions. [2018-12-02 02:40:41,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,774 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1110 transitions. [2018-12-02 02:40:41,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 02:40:41,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,775 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1591793729, now seen corresponding path program 1 times [2018-12-02 02:40:41,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,786 INFO L87 Difference]: Start difference. First operand 712 states and 1110 transitions. Second operand 3 states. [2018-12-02 02:40:41,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,804 INFO L93 Difference]: Finished difference Result 1660 states and 2600 transitions. [2018-12-02 02:40:41,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 02:40:41,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,806 INFO L225 Difference]: With dead ends: 1660 [2018-12-02 02:40:41,806 INFO L226 Difference]: Without dead ends: 970 [2018-12-02 02:40:41,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2018-12-02 02:40:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 968. [2018-12-02 02:40:41,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-12-02 02:40:41,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1494 transitions. [2018-12-02 02:40:41,826 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1494 transitions. Word has length 24 [2018-12-02 02:40:41,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,826 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1494 transitions. [2018-12-02 02:40:41,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1494 transitions. [2018-12-02 02:40:41,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 02:40:41,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,828 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1089633349, now seen corresponding path program 1 times [2018-12-02 02:40:41,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,838 INFO L87 Difference]: Start difference. First operand 968 states and 1494 transitions. Second operand 3 states. [2018-12-02 02:40:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,868 INFO L93 Difference]: Finished difference Result 1452 states and 2232 transitions. [2018-12-02 02:40:41,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 02:40:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,872 INFO L225 Difference]: With dead ends: 1452 [2018-12-02 02:40:41,872 INFO L226 Difference]: Without dead ends: 986 [2018-12-02 02:40:41,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2018-12-02 02:40:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 984. [2018-12-02 02:40:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2018-12-02 02:40:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1494 transitions. [2018-12-02 02:40:41,893 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1494 transitions. Word has length 25 [2018-12-02 02:40:41,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,894 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 1494 transitions. [2018-12-02 02:40:41,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1494 transitions. [2018-12-02 02:40:41,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 02:40:41,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,895 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2100750599, now seen corresponding path program 1 times [2018-12-02 02:40:41,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,909 INFO L87 Difference]: Start difference. First operand 984 states and 1494 transitions. Second operand 3 states. [2018-12-02 02:40:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:41,945 INFO L93 Difference]: Finished difference Result 1740 states and 2696 transitions. [2018-12-02 02:40:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:41,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 02:40:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:41,951 INFO L225 Difference]: With dead ends: 1740 [2018-12-02 02:40:41,951 INFO L226 Difference]: Without dead ends: 1738 [2018-12-02 02:40:41,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-12-02 02:40:41,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1416. [2018-12-02 02:40:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1416 states. [2018-12-02 02:40:41,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 2086 transitions. [2018-12-02 02:40:41,978 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 2086 transitions. Word has length 25 [2018-12-02 02:40:41,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:41,979 INFO L480 AbstractCegarLoop]: Abstraction has 1416 states and 2086 transitions. [2018-12-02 02:40:41,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:41,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 2086 transitions. [2018-12-02 02:40:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 02:40:41,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:41,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:41,981 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:41,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:41,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1607410683, now seen corresponding path program 1 times [2018-12-02 02:40:41,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:41,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:41,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:41,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:41,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:41,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:41,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:41,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:41,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:41,993 INFO L87 Difference]: Start difference. First operand 1416 states and 2086 transitions. Second operand 3 states. [2018-12-02 02:40:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:42,047 INFO L93 Difference]: Finished difference Result 3276 states and 4840 transitions. [2018-12-02 02:40:42,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:42,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 02:40:42,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:42,052 INFO L225 Difference]: With dead ends: 3276 [2018-12-02 02:40:42,053 INFO L226 Difference]: Without dead ends: 1898 [2018-12-02 02:40:42,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1898 states. [2018-12-02 02:40:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1898 to 1896. [2018-12-02 02:40:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1896 states. [2018-12-02 02:40:42,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1896 states to 1896 states and 2758 transitions. [2018-12-02 02:40:42,094 INFO L78 Accepts]: Start accepts. Automaton has 1896 states and 2758 transitions. Word has length 25 [2018-12-02 02:40:42,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:42,095 INFO L480 AbstractCegarLoop]: Abstraction has 1896 states and 2758 transitions. [2018-12-02 02:40:42,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:42,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1896 states and 2758 transitions. [2018-12-02 02:40:42,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 02:40:42,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:42,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:42,096 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:42,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:42,096 INFO L82 PathProgramCache]: Analyzing trace with hash -698544044, now seen corresponding path program 1 times [2018-12-02 02:40:42,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:42,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:42,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:42,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:42,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:42,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:42,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:42,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:42,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:42,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,110 INFO L87 Difference]: Start difference. First operand 1896 states and 2758 transitions. Second operand 3 states. [2018-12-02 02:40:42,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:42,139 INFO L93 Difference]: Finished difference Result 2844 states and 4120 transitions. [2018-12-02 02:40:42,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:42,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 02:40:42,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:42,142 INFO L225 Difference]: With dead ends: 2844 [2018-12-02 02:40:42,142 INFO L226 Difference]: Without dead ends: 1930 [2018-12-02 02:40:42,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1930 states. [2018-12-02 02:40:42,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1930 to 1928. [2018-12-02 02:40:42,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-12-02 02:40:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2758 transitions. [2018-12-02 02:40:42,176 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2758 transitions. Word has length 26 [2018-12-02 02:40:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:42,177 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 2758 transitions. [2018-12-02 02:40:42,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2758 transitions. [2018-12-02 02:40:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 02:40:42,178 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:42,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:42,178 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:42,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:42,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1709661294, now seen corresponding path program 1 times [2018-12-02 02:40:42,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:42,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:42,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:42,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:42,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:42,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:42,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:42,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:42,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:42,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:42,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,196 INFO L87 Difference]: Start difference. First operand 1928 states and 2758 transitions. Second operand 3 states. [2018-12-02 02:40:42,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:42,234 INFO L93 Difference]: Finished difference Result 3340 states and 4872 transitions. [2018-12-02 02:40:42,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:42,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 02:40:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:42,239 INFO L225 Difference]: With dead ends: 3340 [2018-12-02 02:40:42,240 INFO L226 Difference]: Without dead ends: 3338 [2018-12-02 02:40:42,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-12-02 02:40:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 2824. [2018-12-02 02:40:42,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2824 states. [2018-12-02 02:40:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 3910 transitions. [2018-12-02 02:40:42,287 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 3910 transitions. Word has length 26 [2018-12-02 02:40:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:42,287 INFO L480 AbstractCegarLoop]: Abstraction has 2824 states and 3910 transitions. [2018-12-02 02:40:42,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 3910 transitions. [2018-12-02 02:40:42,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 02:40:42,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:42,289 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:42,289 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:42,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:42,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1998499988, now seen corresponding path program 1 times [2018-12-02 02:40:42,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:42,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:42,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:42,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:42,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:42,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:42,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:42,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:42,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:42,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,300 INFO L87 Difference]: Start difference. First operand 2824 states and 3910 transitions. Second operand 3 states. [2018-12-02 02:40:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:42,353 INFO L93 Difference]: Finished difference Result 6476 states and 8968 transitions. [2018-12-02 02:40:42,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:42,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 02:40:42,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:42,359 INFO L225 Difference]: With dead ends: 6476 [2018-12-02 02:40:42,359 INFO L226 Difference]: Without dead ends: 3722 [2018-12-02 02:40:42,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3722 states. [2018-12-02 02:40:42,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3722 to 3720. [2018-12-02 02:40:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3720 states. [2018-12-02 02:40:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3720 states to 3720 states and 5062 transitions. [2018-12-02 02:40:42,426 INFO L78 Accepts]: Start accepts. Automaton has 3720 states and 5062 transitions. Word has length 26 [2018-12-02 02:40:42,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:42,426 INFO L480 AbstractCegarLoop]: Abstraction has 3720 states and 5062 transitions. [2018-12-02 02:40:42,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3720 states and 5062 transitions. [2018-12-02 02:40:42,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 02:40:42,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:42,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:42,429 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:42,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:42,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1459677136, now seen corresponding path program 1 times [2018-12-02 02:40:42,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:42,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:42,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:42,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:42,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:42,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:42,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:42,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:42,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:42,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,438 INFO L87 Difference]: Start difference. First operand 3720 states and 5062 transitions. Second operand 3 states. [2018-12-02 02:40:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:42,494 INFO L93 Difference]: Finished difference Result 5580 states and 7560 transitions. [2018-12-02 02:40:42,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:42,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 02:40:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:42,501 INFO L225 Difference]: With dead ends: 5580 [2018-12-02 02:40:42,501 INFO L226 Difference]: Without dead ends: 3786 [2018-12-02 02:40:42,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2018-12-02 02:40:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3784. [2018-12-02 02:40:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2018-12-02 02:40:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5062 transitions. [2018-12-02 02:40:42,565 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5062 transitions. Word has length 27 [2018-12-02 02:40:42,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:42,565 INFO L480 AbstractCegarLoop]: Abstraction has 3784 states and 5062 transitions. [2018-12-02 02:40:42,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5062 transitions. [2018-12-02 02:40:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 02:40:42,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:42,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:42,568 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:42,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:42,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1824172910, now seen corresponding path program 1 times [2018-12-02 02:40:42,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:42,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:42,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:42,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:42,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:42,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:42,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:42,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:42,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,588 INFO L87 Difference]: Start difference. First operand 3784 states and 5062 transitions. Second operand 3 states. [2018-12-02 02:40:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:42,673 INFO L93 Difference]: Finished difference Result 10956 states and 14408 transitions. [2018-12-02 02:40:42,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:42,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 02:40:42,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:42,684 INFO L225 Difference]: With dead ends: 10956 [2018-12-02 02:40:42,684 INFO L226 Difference]: Without dead ends: 7306 [2018-12-02 02:40:42,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7306 states. [2018-12-02 02:40:42,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7306 to 7304. [2018-12-02 02:40:42,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-12-02 02:40:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9350 transitions. [2018-12-02 02:40:42,802 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9350 transitions. Word has length 27 [2018-12-02 02:40:42,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:42,803 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9350 transitions. [2018-12-02 02:40:42,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:42,803 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9350 transitions. [2018-12-02 02:40:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 02:40:42,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:42,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:42,807 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:42,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:42,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1883988372, now seen corresponding path program 1 times [2018-12-02 02:40:42,807 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:42,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:42,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:42,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:42,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:42,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:42,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:42,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:42,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:42,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,821 INFO L87 Difference]: Start difference. First operand 7304 states and 9350 transitions. Second operand 3 states. [2018-12-02 02:40:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:42,916 INFO L93 Difference]: Finished difference Result 8076 states and 10632 transitions. [2018-12-02 02:40:42,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:42,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 02:40:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:42,925 INFO L225 Difference]: With dead ends: 8076 [2018-12-02 02:40:42,925 INFO L226 Difference]: Without dead ends: 8074 [2018-12-02 02:40:42,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8074 states. [2018-12-02 02:40:43,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8074 to 7304. [2018-12-02 02:40:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7304 states. [2018-12-02 02:40:43,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7304 states to 7304 states and 9222 transitions. [2018-12-02 02:40:43,030 INFO L78 Accepts]: Start accepts. Automaton has 7304 states and 9222 transitions. Word has length 27 [2018-12-02 02:40:43,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:43,030 INFO L480 AbstractCegarLoop]: Abstraction has 7304 states and 9222 transitions. [2018-12-02 02:40:43,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 7304 states and 9222 transitions. [2018-12-02 02:40:43,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 02:40:43,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:43,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:43,034 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:43,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:43,035 INFO L82 PathProgramCache]: Analyzing trace with hash 715001129, now seen corresponding path program 1 times [2018-12-02 02:40:43,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:43,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:43,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:43,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:43,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:43,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:43,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:43,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:43,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:43,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:43,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:43,046 INFO L87 Difference]: Start difference. First operand 7304 states and 9222 transitions. Second operand 3 states. [2018-12-02 02:40:43,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:43,187 INFO L93 Difference]: Finished difference Result 12172 states and 15496 transitions. [2018-12-02 02:40:43,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:43,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 02:40:43,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:43,197 INFO L225 Difference]: With dead ends: 12172 [2018-12-02 02:40:43,197 INFO L226 Difference]: Without dead ends: 12170 [2018-12-02 02:40:43,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:43,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-12-02 02:40:43,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 11144. [2018-12-02 02:40:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-12-02 02:40:43,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 13702 transitions. [2018-12-02 02:40:43,320 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 13702 transitions. Word has length 28 [2018-12-02 02:40:43,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:43,320 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 13702 transitions. [2018-12-02 02:40:43,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 13702 transitions. [2018-12-02 02:40:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 02:40:43,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:43,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:43,328 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:43,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:43,329 INFO L82 PathProgramCache]: Analyzing trace with hash 128195115, now seen corresponding path program 1 times [2018-12-02 02:40:43,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:43,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:43,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:43,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:43,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:43,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:43,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:43,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:43,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:43,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:43,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:43,341 INFO L87 Difference]: Start difference. First operand 11144 states and 13702 transitions. Second operand 3 states. [2018-12-02 02:40:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:43,479 INFO L93 Difference]: Finished difference Result 25228 states and 30856 transitions. [2018-12-02 02:40:43,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:43,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 02:40:43,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:43,498 INFO L225 Difference]: With dead ends: 25228 [2018-12-02 02:40:43,498 INFO L226 Difference]: Without dead ends: 14218 [2018-12-02 02:40:43,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:43,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14218 states. [2018-12-02 02:40:43,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14218 to 14216. [2018-12-02 02:40:43,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14216 states. [2018-12-02 02:40:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14216 states to 14216 states and 16902 transitions. [2018-12-02 02:40:43,723 INFO L78 Accepts]: Start accepts. Automaton has 14216 states and 16902 transitions. Word has length 28 [2018-12-02 02:40:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:43,723 INFO L480 AbstractCegarLoop]: Abstraction has 14216 states and 16902 transitions. [2018-12-02 02:40:43,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 14216 states and 16902 transitions. [2018-12-02 02:40:43,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:40:43,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:43,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:43,729 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:43,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:43,729 INFO L82 PathProgramCache]: Analyzing trace with hash 690414627, now seen corresponding path program 1 times [2018-12-02 02:40:43,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:43,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:43,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:43,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:43,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:43,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:43,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:43,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:43,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:43,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:43,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:43,742 INFO L87 Difference]: Start difference. First operand 14216 states and 16902 transitions. Second operand 3 states. [2018-12-02 02:40:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:43,869 INFO L93 Difference]: Finished difference Result 21516 states and 25608 transitions. [2018-12-02 02:40:43,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:43,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 02:40:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:43,883 INFO L225 Difference]: With dead ends: 21516 [2018-12-02 02:40:43,883 INFO L226 Difference]: Without dead ends: 14602 [2018-12-02 02:40:43,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14602 states. [2018-12-02 02:40:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14602 to 14600. [2018-12-02 02:40:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14600 states. [2018-12-02 02:40:44,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14600 states to 14600 states and 17158 transitions. [2018-12-02 02:40:44,068 INFO L78 Accepts]: Start accepts. Automaton has 14600 states and 17158 transitions. Word has length 29 [2018-12-02 02:40:44,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:44,068 INFO L480 AbstractCegarLoop]: Abstraction has 14600 states and 17158 transitions. [2018-12-02 02:40:44,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:44,068 INFO L276 IsEmpty]: Start isEmpty. Operand 14600 states and 17158 transitions. [2018-12-02 02:40:44,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:40:44,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:44,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:44,075 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:44,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash -320702623, now seen corresponding path program 1 times [2018-12-02 02:40:44,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:44,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:44,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:44,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:44,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:44,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:44,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:44,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:44,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:44,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:44,097 INFO L87 Difference]: Start difference. First operand 14600 states and 17158 transitions. Second operand 3 states. [2018-12-02 02:40:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:44,349 INFO L93 Difference]: Finished difference Result 23562 states and 27399 transitions. [2018-12-02 02:40:44,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:44,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 02:40:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:44,365 INFO L225 Difference]: With dead ends: 23562 [2018-12-02 02:40:44,366 INFO L226 Difference]: Without dead ends: 23560 [2018-12-02 02:40:44,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:44,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23560 states. [2018-12-02 02:40:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23560 to 22536. [2018-12-02 02:40:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22536 states. [2018-12-02 02:40:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22536 states to 22536 states and 25862 transitions. [2018-12-02 02:40:44,601 INFO L78 Accepts]: Start accepts. Automaton has 22536 states and 25862 transitions. Word has length 29 [2018-12-02 02:40:44,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:44,601 INFO L480 AbstractCegarLoop]: Abstraction has 22536 states and 25862 transitions. [2018-12-02 02:40:44,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 22536 states and 25862 transitions. [2018-12-02 02:40:44,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 02:40:44,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 02:40:44,610 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 02:40:44,610 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 02:40:44,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 02:40:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash -907508637, now seen corresponding path program 1 times [2018-12-02 02:40:44,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 02:40:44,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 02:40:44,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:44,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 02:40:44,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 02:40:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 02:40:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 02:40:44,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 02:40:44,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 02:40:44,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 02:40:44,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 02:40:44,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 02:40:44,620 INFO L87 Difference]: Start difference. First operand 22536 states and 25862 transitions. Second operand 3 states. [2018-12-02 02:40:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 02:40:44,895 INFO L93 Difference]: Finished difference Result 50184 states and 56582 transitions. [2018-12-02 02:40:44,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 02:40:44,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 02:40:44,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 02:40:44,896 INFO L225 Difference]: With dead ends: 50184 [2018-12-02 02:40:44,896 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 02:40:44,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-12-02 02:40:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 02:40:44,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 02:40:44,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 02:40:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 02:40:44,922 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-12-02 02:40:44,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 02:40:44,922 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 02:40:44,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 02:40:44,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 02:40:44,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 02:40:44,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 02:40:44,945 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 02:40:44,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 02:40:44,945 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 02:40:44,945 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 02:40:44,946 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L451 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point L70-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L451 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2018-12-02 02:40:44,946 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-02 02:40:44,946 INFO L444 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 68) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L66-2(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-12-02 02:40:44,947 INFO L448 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2018-12-02 02:40:44,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:40:44 BoogieIcfgContainer [2018-12-02 02:40:44,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 02:40:44,953 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 02:40:44,953 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 02:40:44,953 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 02:40:44,954 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:40:40" (3/4) ... [2018-12-02 02:40:44,956 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 02:40:44,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 02:40:44,961 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 02:40:44,964 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 02:40:44,964 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 02:40:44,964 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 02:40:44,997 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9a63c887-a27a-40fd-bf44-47b898cacc70/bin-2019/uautomizer/witness.graphml [2018-12-02 02:40:44,997 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 02:40:44,997 INFO L168 Benchmark]: Toolchain (without parser) took 4422.96 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 542.6 MB). Free memory was 956.0 MB in the beginning and 1.3 GB in the end (delta: -358.8 MB). Peak memory consumption was 183.9 MB. Max. memory is 11.5 GB. [2018-12-02 02:40:44,998 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 02:40:44,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.24 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 02:40:44,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.35 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:40:44,999 INFO L168 Benchmark]: Boogie Preprocessor took 48.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-02 02:40:44,999 INFO L168 Benchmark]: RCFGBuilder took 181.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-02 02:40:44,999 INFO L168 Benchmark]: TraceAbstraction took 3966.88 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 447.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -248.1 MB). Peak memory consumption was 199.6 MB. Max. memory is 11.5 GB. [2018-12-02 02:40:45,000 INFO L168 Benchmark]: Witness Printer took 43.79 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2018-12-02 02:40:45,001 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.24 ms. Allocated memory is still 1.0 GB. Free memory was 956.0 MB in the beginning and 945.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.35 ms. Allocated memory is still 1.0 GB. Free memory was 945.3 MB in the beginning and 939.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 48.03 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -150.4 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 181.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3966.88 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 447.7 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -248.1 MB). Peak memory consumption was 199.6 MB. Max. memory is 11.5 GB. * Witness Printer took 43.79 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: 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, 44 locations, 1 error locations. SAFE Result, 3.9s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2384 SDtfs, 1153 SDslu, 1624 SDs, 0 SdLazy, 149 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22536occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 4124 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 659 ConstructedInterpolants, 0 QuantifiedInterpolants, 31265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...