./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/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 f2cbbf56a13532141372a32a461d64a9d1351c0e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:03:49,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:03:50,000 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:03:50,010 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:03:50,011 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:03:50,012 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:03:50,012 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:03:50,013 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:03:50,017 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:03:50,022 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:03:50,023 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:03:50,023 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:03:50,024 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:03:50,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:03:50,025 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:03:50,026 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:03:50,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:03:50,027 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:03:50,028 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:03:50,029 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:03:50,030 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:03:50,031 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:03:50,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:03:50,032 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:03:50,033 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:03:50,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:03:50,034 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:03:50,034 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:03:50,035 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:03:50,036 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:03:50,036 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:03:50,036 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:03:50,036 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:03:50,037 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:03:50,037 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:03:50,038 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:03:50,038 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-26 20:03:50,049 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:03:50,049 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:03:50,050 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:03:50,050 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-26 20:03:50,050 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-26 20:03:50,050 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-26 20:03:50,050 INFO L133 SettingsManager]: * Use SBE=true [2018-10-26 20:03:50,051 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:03:50,051 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:03:50,051 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:03:50,051 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:03:50,051 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:03:50,051 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:03:50,051 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:03:50,051 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:03:50,052 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:03:50,052 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:03:50,052 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:03:50,052 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:03:50,052 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:03:50,052 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:03:50,052 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:03:50,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:03:50,053 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:03:50,053 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:03:50,053 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:03:50,053 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-26 20:03:50,053 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:03:50,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:03:50,054 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_8949f6ae-fa0b-400a-a50b-11420022f66c/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2018-10-26 20:03:50,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:03:50,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:03:50,108 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:03:50,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:03:50,109 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:03:50,112 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 20:03:50,160 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/bin-2019/uautomizer/data/525964ca4/9882ece583cd4d678c29002f4918004e/FLAGc097358e4 [2018-10-26 20:03:50,531 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:03:50,533 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 20:03:50,540 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/bin-2019/uautomizer/data/525964ca4/9882ece583cd4d678c29002f4918004e/FLAGc097358e4 [2018-10-26 20:03:50,552 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/bin-2019/uautomizer/data/525964ca4/9882ece583cd4d678c29002f4918004e [2018-10-26 20:03:50,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:03:50,558 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-26 20:03:50,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:03:50,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:03:50,562 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:03:50,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:03:50" (1/1) ... [2018-10-26 20:03:50,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e0c1537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:50, skipping insertion in model container [2018-10-26 20:03:50,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:03:50" (1/1) ... [2018-10-26 20:03:50,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:03:50,592 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:03:50,703 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:03:50,706 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:03:50,721 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:03:50,732 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:03:50,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:50 WrapperNode [2018-10-26 20:03:50,732 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:03:50,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:03:50,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:03:50,733 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:03:50,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:50" (1/1) ... [2018-10-26 20:03:50,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:50" (1/1) ... [2018-10-26 20:03:50,748 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:50" (1/1) ... [2018-10-26 20:03:50,748 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:50" (1/1) ... [2018-10-26 20:03:50,751 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:50" (1/1) ... [2018-10-26 20:03:50,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:50" (1/1) ... [2018-10-26 20:03:50,757 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:50" (1/1) ... [2018-10-26 20:03:50,759 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:03:50,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:03:50,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:03:50,759 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:03:50,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/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-10-26 20:03:50,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:03:50,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:03:50,896 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:03:50,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-10-26 20:03:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-10-26 20:03:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:03:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:03:50,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:03:51,325 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:03:51,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:03:51 BoogieIcfgContainer [2018-10-26 20:03:51,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:03:51,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:03:51,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:03:51,329 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:03:51,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:03:50" (1/3) ... [2018-10-26 20:03:51,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e48f4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:03:51, skipping insertion in model container [2018-10-26 20:03:51,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:03:50" (2/3) ... [2018-10-26 20:03:51,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e48f4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:03:51, skipping insertion in model container [2018-10-26 20:03:51,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:03:51" (3/3) ... [2018-10-26 20:03:51,334 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 20:03:51,341 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:03:51,346 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:03:51,356 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:03:51,379 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-26 20:03:51,380 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:03:51,380 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:03:51,380 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:03:51,380 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:03:51,380 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:03:51,380 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:03:51,380 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:03:51,380 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:03:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-10-26 20:03:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-26 20:03:51,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:51,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:03:51,401 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:51,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:51,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1244268193, now seen corresponding path program 1 times [2018-10-26 20:03:51,407 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:51,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:51,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:51,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:51,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:51,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:51,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:51,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:51,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:51,617 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-10-26 20:03:51,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:51,687 INFO L93 Difference]: Finished difference Result 77 states and 128 transitions. [2018-10-26 20:03:51,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:51,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-26 20:03:51,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:51,696 INFO L225 Difference]: With dead ends: 77 [2018-10-26 20:03:51,696 INFO L226 Difference]: Without dead ends: 62 [2018-10-26 20:03:51,699 INFO L605 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-10-26 20:03:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-26 20:03:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-10-26 20:03:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-26 20:03:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2018-10-26 20:03:51,727 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2018-10-26 20:03:51,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:51,727 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2018-10-26 20:03:51,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:51,728 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2018-10-26 20:03:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-26 20:03:51,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:51,728 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:03:51,729 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:51,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:51,729 INFO L82 PathProgramCache]: Analyzing trace with hash -543203615, now seen corresponding path program 1 times [2018-10-26 20:03:51,729 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:51,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:51,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:51,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:51,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:51,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:51,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:51,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:51,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:51,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:51,777 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand 3 states. [2018-10-26 20:03:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:51,817 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2018-10-26 20:03:51,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:51,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-10-26 20:03:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:51,819 INFO L225 Difference]: With dead ends: 100 [2018-10-26 20:03:51,819 INFO L226 Difference]: Without dead ends: 62 [2018-10-26 20:03:51,820 INFO L605 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-10-26 20:03:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-26 20:03:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-10-26 20:03:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-26 20:03:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 103 transitions. [2018-10-26 20:03:51,826 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 103 transitions. Word has length 19 [2018-10-26 20:03:51,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:51,827 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 103 transitions. [2018-10-26 20:03:51,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:51,827 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2018-10-26 20:03:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 20:03:51,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:51,828 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:03:51,828 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:51,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:51,828 INFO L82 PathProgramCache]: Analyzing trace with hash 82605710, now seen corresponding path program 1 times [2018-10-26 20:03:51,828 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:51,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:51,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:51,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:51,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:51,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:51,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:51,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:51,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:51,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:51,878 INFO L87 Difference]: Start difference. First operand 60 states and 103 transitions. Second operand 3 states. [2018-10-26 20:03:51,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:51,943 INFO L93 Difference]: Finished difference Result 94 states and 157 transitions. [2018-10-26 20:03:51,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:51,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-26 20:03:51,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:51,944 INFO L225 Difference]: With dead ends: 94 [2018-10-26 20:03:51,944 INFO L226 Difference]: Without dead ends: 66 [2018-10-26 20:03:51,945 INFO L605 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-10-26 20:03:51,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-26 20:03:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-10-26 20:03:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-26 20:03:51,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2018-10-26 20:03:51,952 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 20 [2018-10-26 20:03:51,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:51,952 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2018-10-26 20:03:51,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:51,952 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2018-10-26 20:03:51,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 20:03:51,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:51,953 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:03:51,953 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:51,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:51,954 INFO L82 PathProgramCache]: Analyzing trace with hash 340771148, now seen corresponding path program 1 times [2018-10-26 20:03:51,954 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:51,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:51,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:51,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:51,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:51,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:51,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:51,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:51,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:51,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:51,996 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 3 states. [2018-10-26 20:03:52,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:52,054 INFO L93 Difference]: Finished difference Result 117 states and 197 transitions. [2018-10-26 20:03:52,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:52,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-26 20:03:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:52,056 INFO L225 Difference]: With dead ends: 117 [2018-10-26 20:03:52,056 INFO L226 Difference]: Without dead ends: 115 [2018-10-26 20:03:52,056 INFO L605 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-10-26 20:03:52,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-26 20:03:52,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2018-10-26 20:03:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-26 20:03:52,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 139 transitions. [2018-10-26 20:03:52,071 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 139 transitions. Word has length 20 [2018-10-26 20:03:52,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:52,071 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 139 transitions. [2018-10-26 20:03:52,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:52,071 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 139 transitions. [2018-10-26 20:03:52,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-26 20:03:52,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:52,072 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-26 20:03:52,076 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:52,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:52,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1041835726, now seen corresponding path program 1 times [2018-10-26 20:03:52,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:52,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:52,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:52,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:52,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:52,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:52,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:52,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:52,148 INFO L87 Difference]: Start difference. First operand 83 states and 139 transitions. Second operand 3 states. [2018-10-26 20:03:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:52,198 INFO L93 Difference]: Finished difference Result 191 states and 325 transitions. [2018-10-26 20:03:52,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:52,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-10-26 20:03:52,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:52,200 INFO L225 Difference]: With dead ends: 191 [2018-10-26 20:03:52,200 INFO L226 Difference]: Without dead ends: 117 [2018-10-26 20:03:52,201 INFO L605 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-10-26 20:03:52,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-26 20:03:52,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-26 20:03:52,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-26 20:03:52,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 191 transitions. [2018-10-26 20:03:52,214 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 191 transitions. Word has length 20 [2018-10-26 20:03:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:52,216 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 191 transitions. [2018-10-26 20:03:52,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:52,217 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 191 transitions. [2018-10-26 20:03:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:03:52,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:52,217 INFO L375 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-10-26 20:03:52,218 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:52,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:52,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1974185366, now seen corresponding path program 1 times [2018-10-26 20:03:52,218 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:52,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:52,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:52,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:52,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:52,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:52,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:52,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:52,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:52,271 INFO L87 Difference]: Start difference. First operand 115 states and 191 transitions. Second operand 3 states. [2018-10-26 20:03:52,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:52,320 INFO L93 Difference]: Finished difference Result 172 states and 284 transitions. [2018-10-26 20:03:52,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:52,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-26 20:03:52,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:52,321 INFO L225 Difference]: With dead ends: 172 [2018-10-26 20:03:52,321 INFO L226 Difference]: Without dead ends: 119 [2018-10-26 20:03:52,322 INFO L605 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-10-26 20:03:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-26 20:03:52,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-10-26 20:03:52,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-26 20:03:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 191 transitions. [2018-10-26 20:03:52,336 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 191 transitions. Word has length 21 [2018-10-26 20:03:52,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:52,337 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 191 transitions. [2018-10-26 20:03:52,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 191 transitions. [2018-10-26 20:03:52,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:03:52,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:52,338 INFO L375 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-10-26 20:03:52,338 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:52,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:52,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2062616492, now seen corresponding path program 1 times [2018-10-26 20:03:52,338 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:52,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:52,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:52,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:52,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:52,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:52,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:52,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:52,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:52,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:52,423 INFO L87 Difference]: Start difference. First operand 117 states and 191 transitions. Second operand 3 states. [2018-10-26 20:03:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:52,503 INFO L93 Difference]: Finished difference Result 213 states and 353 transitions. [2018-10-26 20:03:52,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:52,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-26 20:03:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:52,505 INFO L225 Difference]: With dead ends: 213 [2018-10-26 20:03:52,505 INFO L226 Difference]: Without dead ends: 211 [2018-10-26 20:03:52,506 INFO L605 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-10-26 20:03:52,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-26 20:03:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 157. [2018-10-26 20:03:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-26 20:03:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 255 transitions. [2018-10-26 20:03:52,516 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 255 transitions. Word has length 21 [2018-10-26 20:03:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:52,517 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 255 transitions. [2018-10-26 20:03:52,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 255 transitions. [2018-10-26 20:03:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-26 20:03:52,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:52,518 INFO L375 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-10-26 20:03:52,518 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:52,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1361551914, now seen corresponding path program 1 times [2018-10-26 20:03:52,519 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:52,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:52,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:52,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:52,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:52,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:52,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:52,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:52,608 INFO L87 Difference]: Start difference. First operand 157 states and 255 transitions. Second operand 3 states. [2018-10-26 20:03:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:52,667 INFO L93 Difference]: Finished difference Result 365 states and 597 transitions. [2018-10-26 20:03:52,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:52,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-26 20:03:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:52,668 INFO L225 Difference]: With dead ends: 365 [2018-10-26 20:03:52,668 INFO L226 Difference]: Without dead ends: 219 [2018-10-26 20:03:52,669 INFO L605 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-10-26 20:03:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-26 20:03:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-10-26 20:03:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-26 20:03:52,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 347 transitions. [2018-10-26 20:03:52,681 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 347 transitions. Word has length 21 [2018-10-26 20:03:52,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:52,681 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 347 transitions. [2018-10-26 20:03:52,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 347 transitions. [2018-10-26 20:03:52,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 20:03:52,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:52,683 INFO L375 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-10-26 20:03:52,683 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:52,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:52,683 INFO L82 PathProgramCache]: Analyzing trace with hash 483612899, now seen corresponding path program 1 times [2018-10-26 20:03:52,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:52,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:52,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:52,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:52,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:52,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:52,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:52,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:52,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:52,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:52,715 INFO L87 Difference]: Start difference. First operand 217 states and 347 transitions. Second operand 3 states. [2018-10-26 20:03:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:52,742 INFO L93 Difference]: Finished difference Result 325 states and 517 transitions. [2018-10-26 20:03:52,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:52,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-26 20:03:52,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:52,744 INFO L225 Difference]: With dead ends: 325 [2018-10-26 20:03:52,744 INFO L226 Difference]: Without dead ends: 223 [2018-10-26 20:03:52,744 INFO L605 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-10-26 20:03:52,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-26 20:03:52,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-10-26 20:03:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-26 20:03:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2018-10-26 20:03:52,757 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 22 [2018-10-26 20:03:52,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:52,758 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2018-10-26 20:03:52,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2018-10-26 20:03:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 20:03:52,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:52,766 INFO L375 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-10-26 20:03:52,767 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:52,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:52,767 INFO L82 PathProgramCache]: Analyzing trace with hash 741778337, now seen corresponding path program 1 times [2018-10-26 20:03:52,767 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:52,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:52,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:52,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:52,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:52,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:52,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:52,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:52,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:52,816 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand 3 states. [2018-10-26 20:03:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:52,847 INFO L93 Difference]: Finished difference Result 397 states and 633 transitions. [2018-10-26 20:03:52,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:52,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-26 20:03:52,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:52,850 INFO L225 Difference]: With dead ends: 397 [2018-10-26 20:03:52,850 INFO L226 Difference]: Without dead ends: 395 [2018-10-26 20:03:52,850 INFO L605 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-10-26 20:03:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-26 20:03:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 305. [2018-10-26 20:03:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-26 20:03:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 471 transitions. [2018-10-26 20:03:52,861 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 471 transitions. Word has length 22 [2018-10-26 20:03:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:52,862 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 471 transitions. [2018-10-26 20:03:52,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:52,863 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 471 transitions. [2018-10-26 20:03:52,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 20:03:52,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:52,864 INFO L375 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-10-26 20:03:52,864 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:52,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:52,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842915, now seen corresponding path program 1 times [2018-10-26 20:03:52,865 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:52,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:52,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:52,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:52,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:52,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:52,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:52,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:52,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:52,904 INFO L87 Difference]: Start difference. First operand 305 states and 471 transitions. Second operand 3 states. [2018-10-26 20:03:52,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:52,952 INFO L93 Difference]: Finished difference Result 709 states and 1097 transitions. [2018-10-26 20:03:52,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:52,953 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-26 20:03:52,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:52,955 INFO L225 Difference]: With dead ends: 709 [2018-10-26 20:03:52,955 INFO L226 Difference]: Without dead ends: 419 [2018-10-26 20:03:52,956 INFO L605 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-10-26 20:03:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-26 20:03:52,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2018-10-26 20:03:52,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-26 20:03:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 631 transitions. [2018-10-26 20:03:52,969 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 631 transitions. Word has length 22 [2018-10-26 20:03:52,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:52,970 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 631 transitions. [2018-10-26 20:03:52,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:52,970 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 631 transitions. [2018-10-26 20:03:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:03:52,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:52,971 INFO L375 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-10-26 20:03:52,971 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:52,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:52,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1520507019, now seen corresponding path program 1 times [2018-10-26 20:03:52,972 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:52,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:52,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:52,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:53,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:53,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:53,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:53,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:53,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:53,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:53,012 INFO L87 Difference]: Start difference. First operand 417 states and 631 transitions. Second operand 3 states. [2018-10-26 20:03:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:53,053 INFO L93 Difference]: Finished difference Result 625 states and 941 transitions. [2018-10-26 20:03:53,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:53,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 20:03:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:53,056 INFO L225 Difference]: With dead ends: 625 [2018-10-26 20:03:53,056 INFO L226 Difference]: Without dead ends: 427 [2018-10-26 20:03:53,056 INFO L605 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-10-26 20:03:53,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-10-26 20:03:53,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2018-10-26 20:03:53,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-26 20:03:53,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 631 transitions. [2018-10-26 20:03:53,072 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 631 transitions. Word has length 23 [2018-10-26 20:03:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:53,072 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 631 transitions. [2018-10-26 20:03:53,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:53,073 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 631 transitions. [2018-10-26 20:03:53,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:03:53,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:53,074 INFO L375 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-10-26 20:03:53,074 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:53,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:53,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1778672457, now seen corresponding path program 1 times [2018-10-26 20:03:53,076 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:53,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:53,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:53,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:53,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:53,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:53,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:53,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:53,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:53,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:53,144 INFO L87 Difference]: Start difference. First operand 425 states and 631 transitions. Second operand 3 states. [2018-10-26 20:03:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:53,255 INFO L93 Difference]: Finished difference Result 1213 states and 1785 transitions. [2018-10-26 20:03:53,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:53,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 20:03:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:53,259 INFO L225 Difference]: With dead ends: 1213 [2018-10-26 20:03:53,259 INFO L226 Difference]: Without dead ends: 811 [2018-10-26 20:03:53,261 INFO L605 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-10-26 20:03:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2018-10-26 20:03:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 809. [2018-10-26 20:03:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-10-26 20:03:53,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1159 transitions. [2018-10-26 20:03:53,287 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1159 transitions. Word has length 23 [2018-10-26 20:03:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:53,288 INFO L481 AbstractCegarLoop]: Abstraction has 809 states and 1159 transitions. [2018-10-26 20:03:53,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:53,288 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1159 transitions. [2018-10-26 20:03:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:03:53,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:53,289 INFO L375 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-10-26 20:03:53,289 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:53,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:53,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1077607879, now seen corresponding path program 1 times [2018-10-26 20:03:53,290 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:53,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:53,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:53,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:53,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:53,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:53,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:53,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:53,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:53,361 INFO L87 Difference]: Start difference. First operand 809 states and 1159 transitions. Second operand 3 states. [2018-10-26 20:03:53,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:53,440 INFO L93 Difference]: Finished difference Result 957 states and 1401 transitions. [2018-10-26 20:03:53,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:53,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 20:03:53,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:53,444 INFO L225 Difference]: With dead ends: 957 [2018-10-26 20:03:53,444 INFO L226 Difference]: Without dead ends: 955 [2018-10-26 20:03:53,445 INFO L605 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-10-26 20:03:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-10-26 20:03:53,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 809. [2018-10-26 20:03:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-10-26 20:03:53,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1143 transitions. [2018-10-26 20:03:53,480 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1143 transitions. Word has length 23 [2018-10-26 20:03:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:53,481 INFO L481 AbstractCegarLoop]: Abstraction has 809 states and 1143 transitions. [2018-10-26 20:03:53,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:53,481 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1143 transitions. [2018-10-26 20:03:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:03:53,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:53,482 INFO L375 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-10-26 20:03:53,483 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:53,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:53,483 INFO L82 PathProgramCache]: Analyzing trace with hash -695513288, now seen corresponding path program 1 times [2018-10-26 20:03:53,483 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:53,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:53,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:53,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:53,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:53,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:53,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:53,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:53,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:53,554 INFO L87 Difference]: Start difference. First operand 809 states and 1143 transitions. Second operand 3 states. [2018-10-26 20:03:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:53,656 INFO L93 Difference]: Finished difference Result 1405 states and 2009 transitions. [2018-10-26 20:03:53,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:53,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 20:03:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:53,661 INFO L225 Difference]: With dead ends: 1405 [2018-10-26 20:03:53,661 INFO L226 Difference]: Without dead ends: 1403 [2018-10-26 20:03:53,661 INFO L605 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-10-26 20:03:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-10-26 20:03:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1177. [2018-10-26 20:03:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-10-26 20:03:53,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1623 transitions. [2018-10-26 20:03:53,701 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1623 transitions. Word has length 24 [2018-10-26 20:03:53,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:53,702 INFO L481 AbstractCegarLoop]: Abstraction has 1177 states and 1623 transitions. [2018-10-26 20:03:53,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1623 transitions. [2018-10-26 20:03:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:03:53,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:53,705 INFO L375 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-10-26 20:03:53,705 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:53,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:53,706 INFO L82 PathProgramCache]: Analyzing trace with hash 5551290, now seen corresponding path program 1 times [2018-10-26 20:03:53,707 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:53,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:53,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:53,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:53,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:53,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:53,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:53,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:53,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:53,772 INFO L87 Difference]: Start difference. First operand 1177 states and 1623 transitions. Second operand 3 states. [2018-10-26 20:03:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:53,869 INFO L93 Difference]: Finished difference Result 2717 states and 3737 transitions. [2018-10-26 20:03:53,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:53,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 20:03:53,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:53,875 INFO L225 Difference]: With dead ends: 2717 [2018-10-26 20:03:53,875 INFO L226 Difference]: Without dead ends: 1563 [2018-10-26 20:03:53,877 INFO L605 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-10-26 20:03:53,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2018-10-26 20:03:53,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1561. [2018-10-26 20:03:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-10-26 20:03:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2087 transitions. [2018-10-26 20:03:53,929 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2087 transitions. Word has length 24 [2018-10-26 20:03:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:53,929 INFO L481 AbstractCegarLoop]: Abstraction has 1561 states and 2087 transitions. [2018-10-26 20:03:53,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:53,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2087 transitions. [2018-10-26 20:03:53,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:03:53,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:53,933 INFO L375 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-10-26 20:03:53,933 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:53,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash -85859714, now seen corresponding path program 1 times [2018-10-26 20:03:53,934 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:53,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:53,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:53,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:54,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:54,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:54,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:54,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:54,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:54,009 INFO L87 Difference]: Start difference. First operand 1561 states and 2087 transitions. Second operand 3 states. [2018-10-26 20:03:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:54,088 INFO L93 Difference]: Finished difference Result 2365 states and 3161 transitions. [2018-10-26 20:03:54,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:54,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 20:03:54,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:54,093 INFO L225 Difference]: With dead ends: 2365 [2018-10-26 20:03:54,093 INFO L226 Difference]: Without dead ends: 1611 [2018-10-26 20:03:54,096 INFO L605 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-10-26 20:03:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-10-26 20:03:54,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1609. [2018-10-26 20:03:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2018-10-26 20:03:54,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2119 transitions. [2018-10-26 20:03:54,141 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2119 transitions. Word has length 25 [2018-10-26 20:03:54,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:54,141 INFO L481 AbstractCegarLoop]: Abstraction has 1609 states and 2119 transitions. [2018-10-26 20:03:54,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2119 transitions. [2018-10-26 20:03:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:03:54,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:54,145 INFO L375 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-10-26 20:03:54,145 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:54,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:54,145 INFO L82 PathProgramCache]: Analyzing trace with hash 172305724, now seen corresponding path program 1 times [2018-10-26 20:03:54,146 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:54,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:54,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:54,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:54,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:54,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:54,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:54,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:54,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:54,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:54,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:54,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:54,216 INFO L87 Difference]: Start difference. First operand 1609 states and 2119 transitions. Second operand 3 states. [2018-10-26 20:03:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:54,348 INFO L93 Difference]: Finished difference Result 2701 states and 3561 transitions. [2018-10-26 20:03:54,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:54,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 20:03:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:54,355 INFO L225 Difference]: With dead ends: 2701 [2018-10-26 20:03:54,356 INFO L226 Difference]: Without dead ends: 2699 [2018-10-26 20:03:54,357 INFO L605 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-10-26 20:03:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2018-10-26 20:03:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2377. [2018-10-26 20:03:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-10-26 20:03:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3047 transitions. [2018-10-26 20:03:54,425 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3047 transitions. Word has length 25 [2018-10-26 20:03:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:54,426 INFO L481 AbstractCegarLoop]: Abstraction has 2377 states and 3047 transitions. [2018-10-26 20:03:54,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3047 transitions. [2018-10-26 20:03:54,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:03:54,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:54,431 INFO L375 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-10-26 20:03:54,431 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:54,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:54,431 INFO L82 PathProgramCache]: Analyzing trace with hash 873370302, now seen corresponding path program 1 times [2018-10-26 20:03:54,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:54,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:54,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:54,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:54,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:54,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:54,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:54,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:54,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:54,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:54,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:54,504 INFO L87 Difference]: Start difference. First operand 2377 states and 3047 transitions. Second operand 3 states. [2018-10-26 20:03:54,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:54,672 INFO L93 Difference]: Finished difference Result 5389 states and 6825 transitions. [2018-10-26 20:03:54,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:54,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 20:03:54,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:54,681 INFO L225 Difference]: With dead ends: 5389 [2018-10-26 20:03:54,681 INFO L226 Difference]: Without dead ends: 3083 [2018-10-26 20:03:54,684 INFO L605 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-10-26 20:03:54,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-10-26 20:03:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3081. [2018-10-26 20:03:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2018-10-26 20:03:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 3783 transitions. [2018-10-26 20:03:54,807 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 3783 transitions. Word has length 25 [2018-10-26 20:03:54,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:54,807 INFO L481 AbstractCegarLoop]: Abstraction has 3081 states and 3783 transitions. [2018-10-26 20:03:54,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:54,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 3783 transitions. [2018-10-26 20:03:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 20:03:54,810 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:54,810 INFO L375 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-10-26 20:03:54,810 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:54,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:54,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1046726223, now seen corresponding path program 1 times [2018-10-26 20:03:54,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:54,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:54,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:54,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:54,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:54,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:54,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:54,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:54,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:54,872 INFO L87 Difference]: Start difference. First operand 3081 states and 3783 transitions. Second operand 3 states. [2018-10-26 20:03:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:54,998 INFO L93 Difference]: Finished difference Result 4621 states and 5641 transitions. [2018-10-26 20:03:54,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:54,999 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 20:03:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:55,007 INFO L225 Difference]: With dead ends: 4621 [2018-10-26 20:03:55,007 INFO L226 Difference]: Without dead ends: 3147 [2018-10-26 20:03:55,009 INFO L605 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-10-26 20:03:55,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2018-10-26 20:03:55,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 3145. [2018-10-26 20:03:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-10-26 20:03:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 3783 transitions. [2018-10-26 20:03:55,093 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 3783 transitions. Word has length 26 [2018-10-26 20:03:55,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:55,094 INFO L481 AbstractCegarLoop]: Abstraction has 3145 states and 3783 transitions. [2018-10-26 20:03:55,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 3783 transitions. [2018-10-26 20:03:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 20:03:55,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:55,096 INFO L375 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-10-26 20:03:55,097 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:55,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:55,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1304891661, now seen corresponding path program 1 times [2018-10-26 20:03:55,097 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:55,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:55,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:55,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:55,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:55,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:55,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:55,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:55,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:55,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:55,164 INFO L87 Difference]: Start difference. First operand 3145 states and 3783 transitions. Second operand 3 states. [2018-10-26 20:03:55,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:55,338 INFO L93 Difference]: Finished difference Result 5131 states and 6088 transitions. [2018-10-26 20:03:55,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:55,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 20:03:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:55,351 INFO L225 Difference]: With dead ends: 5131 [2018-10-26 20:03:55,351 INFO L226 Difference]: Without dead ends: 5129 [2018-10-26 20:03:55,353 INFO L605 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-10-26 20:03:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2018-10-26 20:03:55,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 4745. [2018-10-26 20:03:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2018-10-26 20:03:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 5575 transitions. [2018-10-26 20:03:55,467 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 5575 transitions. Word has length 26 [2018-10-26 20:03:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:55,467 INFO L481 AbstractCegarLoop]: Abstraction has 4745 states and 5575 transitions. [2018-10-26 20:03:55,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 5575 transitions. [2018-10-26 20:03:55,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 20:03:55,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:03:55,472 INFO L375 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-10-26 20:03:55,473 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:03:55,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:03:55,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2005956239, now seen corresponding path program 1 times [2018-10-26 20:03:55,473 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-26 20:03:55,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-26 20:03:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:55,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:03:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:03:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:03:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:03:55,546 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:03:55,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:03:55,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:03:55,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:03:55,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:03:55,547 INFO L87 Difference]: Start difference. First operand 4745 states and 5575 transitions. Second operand 3 states. [2018-10-26 20:03:55,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:03:55,740 INFO L93 Difference]: Finished difference Result 10633 states and 12231 transitions. [2018-10-26 20:03:55,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:03:55,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 20:03:55,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:03:55,742 INFO L225 Difference]: With dead ends: 10633 [2018-10-26 20:03:55,742 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 20:03:55,759 INFO L605 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-10-26 20:03:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 20:03:55,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 20:03:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 20:03:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 20:03:55,760 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-10-26 20:03:55,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:03:55,760 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 20:03:55,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:03:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 20:03:55,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 20:03:55,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 20:03:55,887 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 20:03:55,887 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 20:03:55,887 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 20:03:55,887 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 20:03:55,887 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 20:03:55,887 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 20:03:55,887 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-10-26 20:03:55,887 INFO L421 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-10-26 20:03:55,888 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,888 INFO L425 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,889 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-10-26 20:03:55,889 INFO L425 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,889 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-10-26 20:03:55,889 INFO L428 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-10-26 20:03:55,889 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,889 INFO L425 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,889 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-10-26 20:03:55,889 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,889 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-10-26 20:03:55,889 INFO L425 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-10-26 20:03:55,889 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,889 INFO L428 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-10-26 20:03:55,890 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,890 INFO L425 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,890 INFO L425 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-10-26 20:03:55,890 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-10-26 20:03:55,890 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-10-26 20:03:55,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:03:55 BoogieIcfgContainer [2018-10-26 20:03:55,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:03:55,907 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:03:55,907 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:03:55,908 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:03:55,908 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:03:51" (3/4) ... [2018-10-26 20:03:55,913 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 20:03:55,920 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 20:03:55,920 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 20:03:55,925 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-10-26 20:03:55,926 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-26 20:03:55,926 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 20:03:55,991 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8949f6ae-fa0b-400a-a50b-11420022f66c/bin-2019/uautomizer/witness.graphml [2018-10-26 20:03:55,994 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:03:55,995 INFO L168 Benchmark]: Toolchain (without parser) took 5437.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.0 MB). Free memory was 953.1 MB in the beginning and 963.6 MB in the end (delta: -10.5 MB). Peak memory consumption was 204.5 MB. Max. memory is 11.5 GB. [2018-10-26 20:03:55,996 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:03:55,996 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.79 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 942.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:03:55,996 INFO L168 Benchmark]: Boogie Preprocessor took 26.04 ms. Allocated memory is still 1.0 GB. Free memory was 942.3 MB in the beginning and 939.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:03:55,996 INFO L168 Benchmark]: RCFGBuilder took 567.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 939.6 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:03:55,997 INFO L168 Benchmark]: TraceAbstraction took 4580.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 969.6 MB in the end (delta: 127.1 MB). Peak memory consumption was 215.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:03:55,997 INFO L168 Benchmark]: Witness Printer took 86.62 ms. Allocated memory is still 1.2 GB. Free memory was 969.6 MB in the beginning and 963.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. [2018-10-26 20:03:56,002 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 979.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 173.79 ms. Allocated memory is still 1.0 GB. Free memory was 953.1 MB in the beginning and 942.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.04 ms. Allocated memory is still 1.0 GB. Free memory was 942.3 MB in the beginning and 939.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 567.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 939.6 MB in the beginning and 1.1 GB in the end (delta: -157.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4580.26 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 88.6 MB). Free memory was 1.1 GB in the beginning and 969.6 MB in the end (delta: 127.1 MB). Peak memory consumption was 215.7 MB. Max. memory is 11.5 GB. * Witness Printer took 86.62 ms. Allocated memory is still 1.2 GB. Free memory was 969.6 MB in the beginning and 963.6 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: 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, 39 locations, 1 error locations. SAFE Result, 4.5s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1583 SDtfs, 743 SDslu, 1056 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4745occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 1299 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 497 NumberOfCodeBlocks, 497 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19359 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...