./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 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/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_5c2b82be-9b10-4541-bff9-857fe645a5eb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/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-5842f4b [2018-11-18 16:36:57,586 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:36:57,588 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:36:57,594 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:36:57,595 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:36:57,595 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:36:57,596 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:36:57,597 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:36:57,598 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:36:57,599 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:36:57,600 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:36:57,600 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:36:57,600 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:36:57,601 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:36:57,601 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:36:57,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:36:57,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:36:57,603 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:36:57,605 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:36:57,606 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:36:57,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:36:57,607 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:36:57,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:36:57,608 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:36:57,608 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:36:57,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:36:57,609 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:36:57,610 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:36:57,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:36:57,611 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:36:57,611 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:36:57,612 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:36:57,612 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:36:57,612 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:36:57,613 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:36:57,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:36:57,613 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 16:36:57,623 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:36:57,623 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:36:57,624 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:36:57,624 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 16:36:57,624 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:36:57,625 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:36:57,625 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:36:57,625 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:36:57,625 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:36:57,625 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:36:57,625 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:36:57,625 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:36:57,626 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:36:57,626 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:36:57,626 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:36:57,626 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:36:57,626 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:36:57,626 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:36:57,626 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:36:57,626 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:36:57,627 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:36:57,627 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:36:57,627 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:36:57,627 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:36:57,627 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:36:57,627 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:36:57,627 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:36:57,628 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:36:57,628 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:36:57,628 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:36:57,628 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_5c2b82be-9b10-4541-bff9-857fe645a5eb/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-11-18 16:36:57,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:36:57,663 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:36:57,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:36:57,667 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:36:57,667 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:36:57,668 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 16:36:57,713 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/bin-2019/uautomizer/data/1e2b8f185/35912bd8e1c44ff1b9fce6b0fa12ff56/FLAGe888a769b [2018-11-18 16:36:58,124 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:36:58,124 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 16:36:58,129 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/bin-2019/uautomizer/data/1e2b8f185/35912bd8e1c44ff1b9fce6b0fa12ff56/FLAGe888a769b [2018-11-18 16:36:58,142 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/bin-2019/uautomizer/data/1e2b8f185/35912bd8e1c44ff1b9fce6b0fa12ff56 [2018-11-18 16:36:58,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:36:58,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 16:36:58,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:36:58,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:36:58,150 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:36:58,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:36:58" (1/1) ... [2018-11-18 16:36:58,152 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d23366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:36:58, skipping insertion in model container [2018-11-18 16:36:58,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:36:58" (1/1) ... [2018-11-18 16:36:58,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:36:58,174 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:36:58,285 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:36:58,287 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:36:58,301 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:36:58,309 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:36:58,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:36:58 WrapperNode [2018-11-18 16:36:58,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:36:58,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:36:58,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:36:58,310 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:36:58,317 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:36:58" (1/1) ... [2018-11-18 16:36:58,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:36:58" (1/1) ... [2018-11-18 16:36:58,321 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:36:58" (1/1) ... [2018-11-18 16:36:58,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:36:58" (1/1) ... [2018-11-18 16:36:58,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:36:58" (1/1) ... [2018-11-18 16:36:58,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:36:58" (1/1) ... [2018-11-18 16:36:58,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:36:58" (1/1) ... [2018-11-18 16:36:58,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:36:58,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:36:58,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:36:58,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:36:58,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:36:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/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-11-18 16:36:58,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:36:58,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:36:58,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:36:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 16:36:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 16:36:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:36:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:36:58,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:36:58,567 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:36:58,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:36:58 BoogieIcfgContainer [2018-11-18 16:36:58,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:36:58,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:36:58,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:36:58,570 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:36:58,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:36:58" (1/3) ... [2018-11-18 16:36:58,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8a5b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:36:58, skipping insertion in model container [2018-11-18 16:36:58,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:36:58" (2/3) ... [2018-11-18 16:36:58,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a8a5b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:36:58, skipping insertion in model container [2018-11-18 16:36:58,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:36:58" (3/3) ... [2018-11-18 16:36:58,573 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 16:36:58,578 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:36:58,584 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:36:58,592 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:36:58,611 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:36:58,611 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:36:58,611 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:36:58,611 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:36:58,612 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:36:58,612 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:36:58,612 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:36:58,612 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:36:58,612 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:36:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-11-18 16:36:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 16:36:58,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:58,628 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-11-18 16:36:58,630 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:58,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:58,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1244268193, now seen corresponding path program 1 times [2018-11-18 16:36:58,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:58,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:58,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:58,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:58,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:58,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:58,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:58,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:58,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:58,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:58,759 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 3 states. [2018-11-18 16:36:58,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:58,795 INFO L93 Difference]: Finished difference Result 77 states and 128 transitions. [2018-11-18 16:36:58,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:58,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 16:36:58,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:58,806 INFO L225 Difference]: With dead ends: 77 [2018-11-18 16:36:58,806 INFO L226 Difference]: Without dead ends: 62 [2018-11-18 16:36:58,808 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-18 16:36:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 43. [2018-11-18 16:36:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 16:36:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2018-11-18 16:36:58,835 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2018-11-18 16:36:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:58,835 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2018-11-18 16:36:58,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:58,836 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2018-11-18 16:36:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 16:36:58,836 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:58,836 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-11-18 16:36:58,837 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:58,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -543203615, now seen corresponding path program 1 times [2018-11-18 16:36:58,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:58,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:58,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:58,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-11-18 16:36:58,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:58,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:58,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:58,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:58,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:58,873 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand 3 states. [2018-11-18 16:36:58,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:58,890 INFO L93 Difference]: Finished difference Result 100 states and 175 transitions. [2018-11-18 16:36:58,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:58,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 16:36:58,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:58,892 INFO L225 Difference]: With dead ends: 100 [2018-11-18 16:36:58,892 INFO L226 Difference]: Without dead ends: 62 [2018-11-18 16:36:58,893 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:58,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-18 16:36:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-11-18 16:36:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-18 16:36:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 103 transitions. [2018-11-18 16:36:58,897 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 103 transitions. Word has length 19 [2018-11-18 16:36:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:58,897 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 103 transitions. [2018-11-18 16:36:58,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 103 transitions. [2018-11-18 16:36:58,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:36:58,898 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:58,898 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-11-18 16:36:58,898 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:58,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:58,898 INFO L82 PathProgramCache]: Analyzing trace with hash 82605710, now seen corresponding path program 1 times [2018-11-18 16:36:58,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:58,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:58,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:58,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:58,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:58,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:58,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:58,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:58,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:58,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:58,941 INFO L87 Difference]: Start difference. First operand 60 states and 103 transitions. Second operand 3 states. [2018-11-18 16:36:58,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:58,961 INFO L93 Difference]: Finished difference Result 94 states and 157 transitions. [2018-11-18 16:36:58,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:58,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 16:36:58,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:58,962 INFO L225 Difference]: With dead ends: 94 [2018-11-18 16:36:58,962 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 16:36:58,962 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 16:36:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-18 16:36:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-18 16:36:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 106 transitions. [2018-11-18 16:36:58,967 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 106 transitions. Word has length 20 [2018-11-18 16:36:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:58,967 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 106 transitions. [2018-11-18 16:36:58,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 106 transitions. [2018-11-18 16:36:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:36:58,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:58,968 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-11-18 16:36:58,968 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:58,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:58,968 INFO L82 PathProgramCache]: Analyzing trace with hash 340771148, now seen corresponding path program 1 times [2018-11-18 16:36:58,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:58,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:58,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:58,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:58,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:58,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:58,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:58,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:58,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:58,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:58,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:58,999 INFO L87 Difference]: Start difference. First operand 64 states and 106 transitions. Second operand 3 states. [2018-11-18 16:36:59,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,010 INFO L93 Difference]: Finished difference Result 117 states and 197 transitions. [2018-11-18 16:36:59,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 16:36:59,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,012 INFO L225 Difference]: With dead ends: 117 [2018-11-18 16:36:59,012 INFO L226 Difference]: Without dead ends: 115 [2018-11-18 16:36:59,012 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-18 16:36:59,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 83. [2018-11-18 16:36:59,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-18 16:36:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 139 transitions. [2018-11-18 16:36:59,022 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 139 transitions. Word has length 20 [2018-11-18 16:36:59,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,022 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 139 transitions. [2018-11-18 16:36:59,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,022 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 139 transitions. [2018-11-18 16:36:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:36:59,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,023 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-11-18 16:36:59,023 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1041835726, now seen corresponding path program 1 times [2018-11-18 16:36:59,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,053 INFO L87 Difference]: Start difference. First operand 83 states and 139 transitions. Second operand 3 states. [2018-11-18 16:36:59,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,065 INFO L93 Difference]: Finished difference Result 191 states and 325 transitions. [2018-11-18 16:36:59,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 16:36:59,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,066 INFO L225 Difference]: With dead ends: 191 [2018-11-18 16:36:59,066 INFO L226 Difference]: Without dead ends: 117 [2018-11-18 16:36:59,067 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-18 16:36:59,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-11-18 16:36:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 16:36:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 191 transitions. [2018-11-18 16:36:59,075 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 191 transitions. Word has length 20 [2018-11-18 16:36:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,075 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 191 transitions. [2018-11-18 16:36:59,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 191 transitions. [2018-11-18 16:36:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 16:36:59,076 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,076 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-11-18 16:36:59,076 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1974185366, now seen corresponding path program 1 times [2018-11-18 16:36:59,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,102 INFO L87 Difference]: Start difference. First operand 115 states and 191 transitions. Second operand 3 states. [2018-11-18 16:36:59,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,113 INFO L93 Difference]: Finished difference Result 172 states and 284 transitions. [2018-11-18 16:36:59,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 16:36:59,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,114 INFO L225 Difference]: With dead ends: 172 [2018-11-18 16:36:59,114 INFO L226 Difference]: Without dead ends: 119 [2018-11-18 16:36:59,114 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-18 16:36:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-11-18 16:36:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-18 16:36:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 191 transitions. [2018-11-18 16:36:59,119 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 191 transitions. Word has length 21 [2018-11-18 16:36:59,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,119 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 191 transitions. [2018-11-18 16:36:59,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,119 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 191 transitions. [2018-11-18 16:36:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 16:36:59,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,120 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-11-18 16:36:59,120 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2062616492, now seen corresponding path program 1 times [2018-11-18 16:36:59,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,158 INFO L87 Difference]: Start difference. First operand 117 states and 191 transitions. Second operand 3 states. [2018-11-18 16:36:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,174 INFO L93 Difference]: Finished difference Result 213 states and 353 transitions. [2018-11-18 16:36:59,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 16:36:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,175 INFO L225 Difference]: With dead ends: 213 [2018-11-18 16:36:59,175 INFO L226 Difference]: Without dead ends: 211 [2018-11-18 16:36:59,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-11-18 16:36:59,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 157. [2018-11-18 16:36:59,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-11-18 16:36:59,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 255 transitions. [2018-11-18 16:36:59,181 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 255 transitions. Word has length 21 [2018-11-18 16:36:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,182 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 255 transitions. [2018-11-18 16:36:59,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,182 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 255 transitions. [2018-11-18 16:36:59,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 16:36:59,182 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,182 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-11-18 16:36:59,183 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1361551914, now seen corresponding path program 1 times [2018-11-18 16:36:59,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,201 INFO L87 Difference]: Start difference. First operand 157 states and 255 transitions. Second operand 3 states. [2018-11-18 16:36:59,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,228 INFO L93 Difference]: Finished difference Result 365 states and 597 transitions. [2018-11-18 16:36:59,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 16:36:59,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,229 INFO L225 Difference]: With dead ends: 365 [2018-11-18 16:36:59,229 INFO L226 Difference]: Without dead ends: 219 [2018-11-18 16:36:59,230 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-11-18 16:36:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-11-18 16:36:59,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-11-18 16:36:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 347 transitions. [2018-11-18 16:36:59,240 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 347 transitions. Word has length 21 [2018-11-18 16:36:59,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,240 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 347 transitions. [2018-11-18 16:36:59,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 347 transitions. [2018-11-18 16:36:59,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 16:36:59,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,241 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-11-18 16:36:59,241 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,242 INFO L82 PathProgramCache]: Analyzing trace with hash 483612899, now seen corresponding path program 1 times [2018-11-18 16:36:59,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,262 INFO L87 Difference]: Start difference. First operand 217 states and 347 transitions. Second operand 3 states. [2018-11-18 16:36:59,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,280 INFO L93 Difference]: Finished difference Result 325 states and 517 transitions. [2018-11-18 16:36:59,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 16:36:59,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,282 INFO L225 Difference]: With dead ends: 325 [2018-11-18 16:36:59,282 INFO L226 Difference]: Without dead ends: 223 [2018-11-18 16:36:59,283 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-18 16:36:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-11-18 16:36:59,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-18 16:36:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 347 transitions. [2018-11-18 16:36:59,290 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 347 transitions. Word has length 22 [2018-11-18 16:36:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,290 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 347 transitions. [2018-11-18 16:36:59,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 347 transitions. [2018-11-18 16:36:59,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 16:36:59,291 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,292 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-11-18 16:36:59,292 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,292 INFO L82 PathProgramCache]: Analyzing trace with hash 741778337, now seen corresponding path program 1 times [2018-11-18 16:36:59,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,310 INFO L87 Difference]: Start difference. First operand 221 states and 347 transitions. Second operand 3 states. [2018-11-18 16:36:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,321 INFO L93 Difference]: Finished difference Result 397 states and 633 transitions. [2018-11-18 16:36:59,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 16:36:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,323 INFO L225 Difference]: With dead ends: 397 [2018-11-18 16:36:59,323 INFO L226 Difference]: Without dead ends: 395 [2018-11-18 16:36:59,323 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-11-18 16:36:59,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 305. [2018-11-18 16:36:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-11-18 16:36:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 471 transitions. [2018-11-18 16:36:59,334 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 471 transitions. Word has length 22 [2018-11-18 16:36:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,335 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 471 transitions. [2018-11-18 16:36:59,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,335 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 471 transitions. [2018-11-18 16:36:59,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 16:36:59,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,336 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-11-18 16:36:59,336 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1442842915, now seen corresponding path program 1 times [2018-11-18 16:36:59,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,349 INFO L87 Difference]: Start difference. First operand 305 states and 471 transitions. Second operand 3 states. [2018-11-18 16:36:59,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,369 INFO L93 Difference]: Finished difference Result 709 states and 1097 transitions. [2018-11-18 16:36:59,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 16:36:59,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,371 INFO L225 Difference]: With dead ends: 709 [2018-11-18 16:36:59,371 INFO L226 Difference]: Without dead ends: 419 [2018-11-18 16:36:59,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-11-18 16:36:59,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2018-11-18 16:36:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-11-18 16:36:59,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 631 transitions. [2018-11-18 16:36:59,381 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 631 transitions. Word has length 22 [2018-11-18 16:36:59,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,381 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 631 transitions. [2018-11-18 16:36:59,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 631 transitions. [2018-11-18 16:36:59,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:36:59,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,382 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-11-18 16:36:59,382 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1520507019, now seen corresponding path program 1 times [2018-11-18 16:36:59,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,410 INFO L87 Difference]: Start difference. First operand 417 states and 631 transitions. Second operand 3 states. [2018-11-18 16:36:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,428 INFO L93 Difference]: Finished difference Result 625 states and 941 transitions. [2018-11-18 16:36:59,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:36:59,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,430 INFO L225 Difference]: With dead ends: 625 [2018-11-18 16:36:59,430 INFO L226 Difference]: Without dead ends: 427 [2018-11-18 16:36:59,431 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-11-18 16:36:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2018-11-18 16:36:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-11-18 16:36:59,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 631 transitions. [2018-11-18 16:36:59,444 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 631 transitions. Word has length 23 [2018-11-18 16:36:59,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,444 INFO L480 AbstractCegarLoop]: Abstraction has 425 states and 631 transitions. [2018-11-18 16:36:59,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 631 transitions. [2018-11-18 16:36:59,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:36:59,445 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,446 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-11-18 16:36:59,446 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1778672457, now seen corresponding path program 1 times [2018-11-18 16:36:59,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,460 INFO L87 Difference]: Start difference. First operand 425 states and 631 transitions. Second operand 3 states. [2018-11-18 16:36:59,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,504 INFO L93 Difference]: Finished difference Result 1213 states and 1785 transitions. [2018-11-18 16:36:59,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:36:59,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,507 INFO L225 Difference]: With dead ends: 1213 [2018-11-18 16:36:59,507 INFO L226 Difference]: Without dead ends: 811 [2018-11-18 16:36:59,508 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2018-11-18 16:36:59,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 809. [2018-11-18 16:36:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-18 16:36:59,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1159 transitions. [2018-11-18 16:36:59,533 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1159 transitions. Word has length 23 [2018-11-18 16:36:59,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,534 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1159 transitions. [2018-11-18 16:36:59,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,534 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1159 transitions. [2018-11-18 16:36:59,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 16:36:59,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,535 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-11-18 16:36:59,535 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1077607879, now seen corresponding path program 1 times [2018-11-18 16:36:59,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,554 INFO L87 Difference]: Start difference. First operand 809 states and 1159 transitions. Second operand 3 states. [2018-11-18 16:36:59,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,579 INFO L93 Difference]: Finished difference Result 957 states and 1401 transitions. [2018-11-18 16:36:59,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 16:36:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,582 INFO L225 Difference]: With dead ends: 957 [2018-11-18 16:36:59,582 INFO L226 Difference]: Without dead ends: 955 [2018-11-18 16:36:59,583 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2018-11-18 16:36:59,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 809. [2018-11-18 16:36:59,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2018-11-18 16:36:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1143 transitions. [2018-11-18 16:36:59,607 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1143 transitions. Word has length 23 [2018-11-18 16:36:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,608 INFO L480 AbstractCegarLoop]: Abstraction has 809 states and 1143 transitions. [2018-11-18 16:36:59,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1143 transitions. [2018-11-18 16:36:59,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 16:36:59,609 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,609 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-11-18 16:36:59,609 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,609 INFO L82 PathProgramCache]: Analyzing trace with hash -695513288, now seen corresponding path program 1 times [2018-11-18 16:36:59,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,626 INFO L87 Difference]: Start difference. First operand 809 states and 1143 transitions. Second operand 3 states. [2018-11-18 16:36:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,669 INFO L93 Difference]: Finished difference Result 1405 states and 2009 transitions. [2018-11-18 16:36:59,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 16:36:59,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,673 INFO L225 Difference]: With dead ends: 1405 [2018-11-18 16:36:59,674 INFO L226 Difference]: Without dead ends: 1403 [2018-11-18 16:36:59,674 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-11-18 16:36:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1177. [2018-11-18 16:36:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1177 states. [2018-11-18 16:36:59,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1623 transitions. [2018-11-18 16:36:59,709 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1623 transitions. Word has length 24 [2018-11-18 16:36:59,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,710 INFO L480 AbstractCegarLoop]: Abstraction has 1177 states and 1623 transitions. [2018-11-18 16:36:59,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1623 transitions. [2018-11-18 16:36:59,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 16:36:59,712 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,712 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-11-18 16:36:59,712 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,712 INFO L82 PathProgramCache]: Analyzing trace with hash 5551290, now seen corresponding path program 1 times [2018-11-18 16:36:59,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,734 INFO L87 Difference]: Start difference. First operand 1177 states and 1623 transitions. Second operand 3 states. [2018-11-18 16:36:59,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,779 INFO L93 Difference]: Finished difference Result 2717 states and 3737 transitions. [2018-11-18 16:36:59,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 16:36:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,784 INFO L225 Difference]: With dead ends: 2717 [2018-11-18 16:36:59,784 INFO L226 Difference]: Without dead ends: 1563 [2018-11-18 16:36:59,786 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2018-11-18 16:36:59,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1561. [2018-11-18 16:36:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-11-18 16:36:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2087 transitions. [2018-11-18 16:36:59,837 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2087 transitions. Word has length 24 [2018-11-18 16:36:59,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,837 INFO L480 AbstractCegarLoop]: Abstraction has 1561 states and 2087 transitions. [2018-11-18 16:36:59,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2087 transitions. [2018-11-18 16:36:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 16:36:59,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,840 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-11-18 16:36:59,840 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,840 INFO L82 PathProgramCache]: Analyzing trace with hash -85859714, now seen corresponding path program 1 times [2018-11-18 16:36:59,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,855 INFO L87 Difference]: Start difference. First operand 1561 states and 2087 transitions. Second operand 3 states. [2018-11-18 16:36:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:36:59,895 INFO L93 Difference]: Finished difference Result 2365 states and 3161 transitions. [2018-11-18 16:36:59,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:36:59,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 16:36:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:36:59,899 INFO L225 Difference]: With dead ends: 2365 [2018-11-18 16:36:59,899 INFO L226 Difference]: Without dead ends: 1611 [2018-11-18 16:36:59,901 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2018-11-18 16:36:59,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1609. [2018-11-18 16:36:59,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2018-11-18 16:36:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2119 transitions. [2018-11-18 16:36:59,947 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2119 transitions. Word has length 25 [2018-11-18 16:36:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:36:59,947 INFO L480 AbstractCegarLoop]: Abstraction has 1609 states and 2119 transitions. [2018-11-18 16:36:59,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:36:59,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2119 transitions. [2018-11-18 16:36:59,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 16:36:59,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:36:59,949 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-11-18 16:36:59,949 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:36:59,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:36:59,950 INFO L82 PathProgramCache]: Analyzing trace with hash 172305724, now seen corresponding path program 1 times [2018-11-18 16:36:59,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:36:59,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:36:59,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:36:59,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:36:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:36:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:36:59,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:36:59,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:36:59,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:36:59,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:36:59,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:36:59,965 INFO L87 Difference]: Start difference. First operand 1609 states and 2119 transitions. Second operand 3 states. [2018-11-18 16:37:00,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:37:00,024 INFO L93 Difference]: Finished difference Result 2701 states and 3561 transitions. [2018-11-18 16:37:00,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:37:00,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 16:37:00,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:37:00,031 INFO L225 Difference]: With dead ends: 2701 [2018-11-18 16:37:00,032 INFO L226 Difference]: Without dead ends: 2699 [2018-11-18 16:37:00,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:37:00,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2018-11-18 16:37:00,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2377. [2018-11-18 16:37:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-11-18 16:37:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3047 transitions. [2018-11-18 16:37:00,106 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3047 transitions. Word has length 25 [2018-11-18 16:37:00,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:37:00,106 INFO L480 AbstractCegarLoop]: Abstraction has 2377 states and 3047 transitions. [2018-11-18 16:37:00,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:37:00,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3047 transitions. [2018-11-18 16:37:00,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 16:37:00,110 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:37:00,110 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-11-18 16:37:00,110 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:37:00,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:37:00,110 INFO L82 PathProgramCache]: Analyzing trace with hash 873370302, now seen corresponding path program 1 times [2018-11-18 16:37:00,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:37:00,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:37:00,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:37:00,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:37:00,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:37:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:37:00,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:37:00,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:37:00,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:37:00,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:37:00,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:37:00,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:37:00,157 INFO L87 Difference]: Start difference. First operand 2377 states and 3047 transitions. Second operand 3 states. [2018-11-18 16:37:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:37:00,252 INFO L93 Difference]: Finished difference Result 5389 states and 6825 transitions. [2018-11-18 16:37:00,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:37:00,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 16:37:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:37:00,260 INFO L225 Difference]: With dead ends: 5389 [2018-11-18 16:37:00,260 INFO L226 Difference]: Without dead ends: 3083 [2018-11-18 16:37:00,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:37:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-11-18 16:37:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 3081. [2018-11-18 16:37:00,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2018-11-18 16:37:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 3783 transitions. [2018-11-18 16:37:00,353 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 3783 transitions. Word has length 25 [2018-11-18 16:37:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:37:00,354 INFO L480 AbstractCegarLoop]: Abstraction has 3081 states and 3783 transitions. [2018-11-18 16:37:00,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:37:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 3783 transitions. [2018-11-18 16:37:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 16:37:00,357 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:37:00,357 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-11-18 16:37:00,358 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:37:00,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:37:00,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1046726223, now seen corresponding path program 1 times [2018-11-18 16:37:00,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:37:00,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:37:00,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:37:00,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:37:00,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:37:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:37:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:37:00,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:37:00,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:37:00,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:37:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:37:00,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:37:00,394 INFO L87 Difference]: Start difference. First operand 3081 states and 3783 transitions. Second operand 3 states. [2018-11-18 16:37:00,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:37:00,456 INFO L93 Difference]: Finished difference Result 4621 states and 5641 transitions. [2018-11-18 16:37:00,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:37:00,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 16:37:00,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:37:00,464 INFO L225 Difference]: With dead ends: 4621 [2018-11-18 16:37:00,464 INFO L226 Difference]: Without dead ends: 3147 [2018-11-18 16:37:00,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:37:00,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2018-11-18 16:37:00,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 3145. [2018-11-18 16:37:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-11-18 16:37:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 3783 transitions. [2018-11-18 16:37:00,557 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 3783 transitions. Word has length 26 [2018-11-18 16:37:00,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:37:00,557 INFO L480 AbstractCegarLoop]: Abstraction has 3145 states and 3783 transitions. [2018-11-18 16:37:00,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:37:00,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 3783 transitions. [2018-11-18 16:37:00,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 16:37:00,560 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:37:00,560 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-11-18 16:37:00,561 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:37:00,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:37:00,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1304891661, now seen corresponding path program 1 times [2018-11-18 16:37:00,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:37:00,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:37:00,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:37:00,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:37:00,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:37:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:37:00,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:37:00,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:37:00,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:37:00,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:37:00,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:37:00,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:37:00,577 INFO L87 Difference]: Start difference. First operand 3145 states and 3783 transitions. Second operand 3 states. [2018-11-18 16:37:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:37:00,670 INFO L93 Difference]: Finished difference Result 5131 states and 6088 transitions. [2018-11-18 16:37:00,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:37:00,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 16:37:00,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:37:00,683 INFO L225 Difference]: With dead ends: 5131 [2018-11-18 16:37:00,683 INFO L226 Difference]: Without dead ends: 5129 [2018-11-18 16:37:00,684 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:37:00,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5129 states. [2018-11-18 16:37:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5129 to 4745. [2018-11-18 16:37:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4745 states. [2018-11-18 16:37:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4745 states to 4745 states and 5575 transitions. [2018-11-18 16:37:00,803 INFO L78 Accepts]: Start accepts. Automaton has 4745 states and 5575 transitions. Word has length 26 [2018-11-18 16:37:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:37:00,803 INFO L480 AbstractCegarLoop]: Abstraction has 4745 states and 5575 transitions. [2018-11-18 16:37:00,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:37:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4745 states and 5575 transitions. [2018-11-18 16:37:00,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 16:37:00,809 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:37:00,809 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-11-18 16:37:00,809 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:37:00,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:37:00,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2005956239, now seen corresponding path program 1 times [2018-11-18 16:37:00,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:37:00,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:37:00,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:37:00,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:37:00,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:37:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:37:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:37:00,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:37:00,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:37:00,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:37:00,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:37:00,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:37:00,826 INFO L87 Difference]: Start difference. First operand 4745 states and 5575 transitions. Second operand 3 states. [2018-11-18 16:37:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:37:00,935 INFO L93 Difference]: Finished difference Result 10633 states and 12231 transitions. [2018-11-18 16:37:00,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:37:00,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 16:37:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:37:00,936 INFO L225 Difference]: With dead ends: 10633 [2018-11-18 16:37:00,936 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 16:37:00,946 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:37:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 16:37:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 16:37:00,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 16:37:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 16:37:00,947 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-18 16:37:00,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:37:00,947 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 16:37:00,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:37:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 16:37:00,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 16:37:00,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 16:37:00,972 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 16:37:00,972 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:37:00,972 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 16:37:00,972 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 16:37:00,972 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 16:37:00,972 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 16:37:00,972 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-18 16:37:00,972 INFO L421 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-11-18 16:37:00,972 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,972 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-11-18 16:37:00,972 INFO L425 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,973 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-18 16:37:00,973 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,973 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,973 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-11-18 16:37:00,973 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-18 16:37:00,973 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-11-18 16:37:00,973 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-11-18 16:37:00,973 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-18 16:37:00,973 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,973 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,973 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,973 INFO L425 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,974 INFO L425 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-11-18 16:37:00,974 INFO L425 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,974 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-18 16:37:00,974 INFO L428 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-11-18 16:37:00,974 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,974 INFO L425 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,974 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,974 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-18 16:37:00,974 INFO L425 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-11-18 16:37:00,974 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,974 INFO L428 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-11-18 16:37:00,974 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,974 INFO L425 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,975 INFO L425 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-11-18 16:37:00,975 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-11-18 16:37:00,975 INFO L425 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-11-18 16:37:00,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:37:00 BoogieIcfgContainer [2018-11-18 16:37:00,980 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:37:00,981 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:37:00,981 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:37:00,981 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:37:00,981 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:36:58" (3/4) ... [2018-11-18 16:37:00,984 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 16:37:00,990 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 16:37:00,990 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 16:37:00,994 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 16:37:00,995 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 16:37:00,995 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 16:37:01,038 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5c2b82be-9b10-4541-bff9-857fe645a5eb/bin-2019/uautomizer/witness.graphml [2018-11-18 16:37:01,038 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:37:01,039 INFO L168 Benchmark]: Toolchain (without parser) took 2893.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 237.0 MB). Free memory was 962.4 MB in the beginning and 947.3 MB in the end (delta: 15.1 MB). Peak memory consumption was 252.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:37:01,040 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:37:01,040 INFO L168 Benchmark]: CACSL2BoogieTranslator took 163.29 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:37:01,040 INFO L168 Benchmark]: Boogie Preprocessor took 53.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 951.6 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:37:01,040 INFO L168 Benchmark]: RCFGBuilder took 203.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-18 16:37:01,041 INFO L168 Benchmark]: TraceAbstraction took 2412.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 947.3 MB in the end (delta: 177.9 MB). Peak memory consumption was 263.3 MB. Max. memory is 11.5 GB. [2018-11-18 16:37:01,041 INFO L168 Benchmark]: Witness Printer took 57.53 ms. Allocated memory is still 1.3 GB. Free memory is still 947.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:37:01,042 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 163.29 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 951.6 MB in the beginning and 1.1 GB in the end (delta: -191.5 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 203.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2412.61 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 947.3 MB in the end (delta: 177.9 MB). Peak memory consumption was 263.3 MB. Max. memory is 11.5 GB. * Witness Printer took 57.53 ms. Allocated memory is still 1.3 GB. Free memory is still 947.3 MB. There was no memory consumed. 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, 2.3s OverallTime, 22 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1583 SDtfs, 743 SDslu, 1056 SDs, 0 SdLazy, 117 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s 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.6s 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.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s 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...