./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/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 5107685577f81a5867811396b2c0a05eb5630c95 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:22:46,643 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:22:46,644 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:22:46,653 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:22:46,653 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:22:46,654 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:22:46,654 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:22:46,655 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:22:46,656 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:22:46,657 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:22:46,658 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:22:46,658 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:22:46,658 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:22:46,659 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:22:46,660 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:22:46,660 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:22:46,661 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:22:46,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:22:46,663 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:22:46,664 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:22:46,665 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:22:46,666 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:22:46,667 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:22:46,667 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:22:46,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:22:46,668 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:22:46,669 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:22:46,669 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:22:46,670 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:22:46,671 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:22:46,671 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:22:46,671 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:22:46,671 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:22:46,672 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:22:46,672 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:22:46,673 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:22:46,673 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 10:22:46,683 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:22:46,683 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:22:46,684 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 10:22:46,684 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 10:22:46,685 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:22:46,685 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:22:46,685 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:22:46,685 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:22:46,685 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 10:22:46,685 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:22:46,685 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 10:22:46,686 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:22:46,686 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 10:22:46,686 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 10:22:46,686 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 10:22:46,686 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 10:22:46,686 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:22:46,686 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:22:46,687 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 10:22:46,687 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:22:46,687 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:22:46,687 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 10:22:46,687 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 10:22:46,687 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 10:22:46,687 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:22:46,687 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 10:22:46,688 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 10:22:46,688 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:22:46,688 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 10:22:46,688 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 10:22:46,688 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_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/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 -> 5107685577f81a5867811396b2c0a05eb5630c95 [2018-11-18 10:22:46,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:22:46,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:22:46,723 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:22:46,724 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:22:46,725 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:22:46,725 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 10:22:46,768 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/bin-2019/uautomizer/data/73197db3b/69ac947f07eb4e14bf453421435645bc/FLAG5277b2b3e [2018-11-18 10:22:47,169 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:22:47,169 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 10:22:47,175 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/bin-2019/uautomizer/data/73197db3b/69ac947f07eb4e14bf453421435645bc/FLAG5277b2b3e [2018-11-18 10:22:47,185 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/bin-2019/uautomizer/data/73197db3b/69ac947f07eb4e14bf453421435645bc [2018-11-18 10:22:47,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:22:47,189 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 10:22:47,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:22:47,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:22:47,192 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:22:47,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:22:47" (1/1) ... [2018-11-18 10:22:47,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bc33b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:47, skipping insertion in model container [2018-11-18 10:22:47,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:22:47" (1/1) ... [2018-11-18 10:22:47,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:22:47,217 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:22:47,338 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:22:47,340 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:22:47,357 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:22:47,367 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:22:47,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:47 WrapperNode [2018-11-18 10:22:47,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:22:47,368 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:22:47,368 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:22:47,368 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:22:47,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:47" (1/1) ... [2018-11-18 10:22:47,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:47" (1/1) ... [2018-11-18 10:22:47,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:47" (1/1) ... [2018-11-18 10:22:47,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:47" (1/1) ... [2018-11-18 10:22:47,381 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:47" (1/1) ... [2018-11-18 10:22:47,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:47" (1/1) ... [2018-11-18 10:22:47,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:47" (1/1) ... [2018-11-18 10:22:47,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:22:47,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:22:47,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:22:47,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:22:47,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/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 10:22:47,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 10:22:47,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:22:47,453 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 10:22:47,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 10:22:47,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 10:22:47,454 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 10:22:47,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 10:22:47,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:22:47,615 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:22:47,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:22:47 BoogieIcfgContainer [2018-11-18 10:22:47,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:22:47,616 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 10:22:47,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 10:22:47,619 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 10:22:47,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 10:22:47" (1/3) ... [2018-11-18 10:22:47,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31282246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:22:47, skipping insertion in model container [2018-11-18 10:22:47,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:22:47" (2/3) ... [2018-11-18 10:22:47,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31282246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 10:22:47, skipping insertion in model container [2018-11-18 10:22:47,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:22:47" (3/3) ... [2018-11-18 10:22:47,621 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 10:22:47,628 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 10:22:47,634 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 10:22:47,645 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 10:22:47,669 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:22:47,669 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 10:22:47,669 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 10:22:47,669 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 10:22:47,669 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:22:47,669 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:22:47,669 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 10:22:47,669 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:22:47,669 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 10:22:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-18 10:22:47,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 10:22:47,683 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:47,684 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 10:22:47,685 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:47,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:47,688 INFO L82 PathProgramCache]: Analyzing trace with hash -811584747, now seen corresponding path program 1 times [2018-11-18 10:22:47,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:47,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:47,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:47,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:47,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:47,809 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 10:22:47,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:47,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:47,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:47,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:47,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:47,822 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2018-11-18 10:22:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:47,854 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2018-11-18 10:22:47,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:47,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 10:22:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:47,863 INFO L225 Difference]: With dead ends: 83 [2018-11-18 10:22:47,863 INFO L226 Difference]: Without dead ends: 68 [2018-11-18 10:22:47,866 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 10:22:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-18 10:22:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2018-11-18 10:22:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 10:22:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 82 transitions. [2018-11-18 10:22:47,894 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 82 transitions. Word has length 20 [2018-11-18 10:22:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:47,895 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 82 transitions. [2018-11-18 10:22:47,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 82 transitions. [2018-11-18 10:22:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 10:22:47,895 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:47,895 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 10:22:47,896 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:47,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash -553419309, now seen corresponding path program 1 times [2018-11-18 10:22:47,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:47,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:47,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:47,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:47,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:47,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:47,928 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 10:22:47,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:47,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:47,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:47,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:47,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:47,930 INFO L87 Difference]: Start difference. First operand 47 states and 82 transitions. Second operand 3 states. [2018-11-18 10:22:47,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:47,959 INFO L93 Difference]: Finished difference Result 110 states and 195 transitions. [2018-11-18 10:22:47,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:47,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 10:22:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:47,960 INFO L225 Difference]: With dead ends: 110 [2018-11-18 10:22:47,960 INFO L226 Difference]: Without dead ends: 68 [2018-11-18 10:22:47,961 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 10:22:47,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-18 10:22:47,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-11-18 10:22:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-18 10:22:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 115 transitions. [2018-11-18 10:22:47,966 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 115 transitions. Word has length 20 [2018-11-18 10:22:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:47,966 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 115 transitions. [2018-11-18 10:22:47,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:47,966 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 115 transitions. [2018-11-18 10:22:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 10:22:47,967 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:47,967 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 10:22:47,967 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:47,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:47,967 INFO L82 PathProgramCache]: Analyzing trace with hash 610890324, now seen corresponding path program 1 times [2018-11-18 10:22:47,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:47,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:47,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:47,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:47,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:22:48,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,008 INFO L87 Difference]: Start difference. First operand 66 states and 115 transitions. Second operand 3 states. [2018-11-18 10:22:48,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,034 INFO L93 Difference]: Finished difference Result 103 states and 175 transitions. [2018-11-18 10:22:48,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 10:22:48,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,035 INFO L225 Difference]: With dead ends: 103 [2018-11-18 10:22:48,035 INFO L226 Difference]: Without dead ends: 72 [2018-11-18 10:22:48,036 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 10:22:48,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-18 10:22:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-11-18 10:22:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 10:22:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 118 transitions. [2018-11-18 10:22:48,042 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 118 transitions. Word has length 21 [2018-11-18 10:22:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,042 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 118 transitions. [2018-11-18 10:22:48,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 118 transitions. [2018-11-18 10:22:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 10:22:48,043 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,043 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 10:22:48,043 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,044 INFO L82 PathProgramCache]: Analyzing trace with hash 24084310, now seen corresponding path program 1 times [2018-11-18 10:22:48,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,071 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 10:22:48,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,071 INFO L87 Difference]: Start difference. First operand 70 states and 118 transitions. Second operand 3 states. [2018-11-18 10:22:48,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,088 INFO L93 Difference]: Finished difference Result 129 states and 221 transitions. [2018-11-18 10:22:48,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 10:22:48,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,090 INFO L225 Difference]: With dead ends: 129 [2018-11-18 10:22:48,090 INFO L226 Difference]: Without dead ends: 127 [2018-11-18 10:22:48,091 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 10:22:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-18 10:22:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-11-18 10:22:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 10:22:48,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 155 transitions. [2018-11-18 10:22:48,098 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 155 transitions. Word has length 21 [2018-11-18 10:22:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,099 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 155 transitions. [2018-11-18 10:22:48,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 155 transitions. [2018-11-18 10:22:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 10:22:48,099 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,100 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 10:22:48,100 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,100 INFO L82 PathProgramCache]: Analyzing trace with hash 282249748, now seen corresponding path program 1 times [2018-11-18 10:22:48,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,128 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 10:22:48,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,129 INFO L87 Difference]: Start difference. First operand 91 states and 155 transitions. Second operand 3 states. [2018-11-18 10:22:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,143 INFO L93 Difference]: Finished difference Result 211 states and 365 transitions. [2018-11-18 10:22:48,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 10:22:48,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,145 INFO L225 Difference]: With dead ends: 211 [2018-11-18 10:22:48,145 INFO L226 Difference]: Without dead ends: 129 [2018-11-18 10:22:48,145 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 10:22:48,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-18 10:22:48,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-11-18 10:22:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-11-18 10:22:48,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 215 transitions. [2018-11-18 10:22:48,152 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 215 transitions. Word has length 21 [2018-11-18 10:22:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,152 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 215 transitions. [2018-11-18 10:22:48,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,153 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 215 transitions. [2018-11-18 10:22:48,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 10:22:48,153 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,153 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 10:22:48,154 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,154 INFO L82 PathProgramCache]: Analyzing trace with hash 746827656, now seen corresponding path program 1 times [2018-11-18 10:22:48,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,179 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 10:22:48,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,180 INFO L87 Difference]: Start difference. First operand 127 states and 215 transitions. Second operand 3 states. [2018-11-18 10:22:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,194 INFO L93 Difference]: Finished difference Result 190 states and 320 transitions. [2018-11-18 10:22:48,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 10:22:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,195 INFO L225 Difference]: With dead ends: 190 [2018-11-18 10:22:48,195 INFO L226 Difference]: Without dead ends: 131 [2018-11-18 10:22:48,195 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 10:22:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-18 10:22:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-11-18 10:22:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-11-18 10:22:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 215 transitions. [2018-11-18 10:22:48,202 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 215 transitions. Word has length 22 [2018-11-18 10:22:48,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,202 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 215 transitions. [2018-11-18 10:22:48,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 215 transitions. [2018-11-18 10:22:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 10:22:48,203 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,203 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 10:22:48,203 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,203 INFO L82 PathProgramCache]: Analyzing trace with hash 160021642, now seen corresponding path program 1 times [2018-11-18 10:22:48,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,233 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 10:22:48,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,234 INFO L87 Difference]: Start difference. First operand 129 states and 215 transitions. Second operand 3 states. [2018-11-18 10:22:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,252 INFO L93 Difference]: Finished difference Result 237 states and 401 transitions. [2018-11-18 10:22:48,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 10:22:48,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,254 INFO L225 Difference]: With dead ends: 237 [2018-11-18 10:22:48,254 INFO L226 Difference]: Without dead ends: 235 [2018-11-18 10:22:48,254 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 10:22:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-11-18 10:22:48,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 173. [2018-11-18 10:22:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-18 10:22:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 287 transitions. [2018-11-18 10:22:48,262 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 287 transitions. Word has length 22 [2018-11-18 10:22:48,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,262 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 287 transitions. [2018-11-18 10:22:48,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 287 transitions. [2018-11-18 10:22:48,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 10:22:48,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,263 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 10:22:48,264 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,264 INFO L82 PathProgramCache]: Analyzing trace with hash 418187080, now seen corresponding path program 1 times [2018-11-18 10:22:48,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,279 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 10:22:48,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,280 INFO L87 Difference]: Start difference. First operand 173 states and 287 transitions. Second operand 3 states. [2018-11-18 10:22:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,294 INFO L93 Difference]: Finished difference Result 405 states and 677 transitions. [2018-11-18 10:22:48,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 10:22:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,296 INFO L225 Difference]: With dead ends: 405 [2018-11-18 10:22:48,296 INFO L226 Difference]: Without dead ends: 243 [2018-11-18 10:22:48,297 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 10:22:48,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-11-18 10:22:48,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-11-18 10:22:48,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-18 10:22:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 395 transitions. [2018-11-18 10:22:48,306 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 395 transitions. Word has length 22 [2018-11-18 10:22:48,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,306 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 395 transitions. [2018-11-18 10:22:48,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,307 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 395 transitions. [2018-11-18 10:22:48,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:22:48,307 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,308 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 10:22:48,308 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,308 INFO L82 PathProgramCache]: Analyzing trace with hash 665917993, now seen corresponding path program 1 times [2018-11-18 10:22:48,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,339 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 10:22:48,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,339 INFO L87 Difference]: Start difference. First operand 241 states and 395 transitions. Second operand 3 states. [2018-11-18 10:22:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,354 INFO L93 Difference]: Finished difference Result 361 states and 589 transitions. [2018-11-18 10:22:48,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 10:22:48,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,356 INFO L225 Difference]: With dead ends: 361 [2018-11-18 10:22:48,356 INFO L226 Difference]: Without dead ends: 247 [2018-11-18 10:22:48,357 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 10:22:48,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-18 10:22:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-11-18 10:22:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-11-18 10:22:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 395 transitions. [2018-11-18 10:22:48,364 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 395 transitions. Word has length 23 [2018-11-18 10:22:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,365 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 395 transitions. [2018-11-18 10:22:48,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 395 transitions. [2018-11-18 10:22:48,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:22:48,366 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,366 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 10:22:48,366 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,366 INFO L82 PathProgramCache]: Analyzing trace with hash 79111979, now seen corresponding path program 1 times [2018-11-18 10:22:48,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,384 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 10:22:48,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,385 INFO L87 Difference]: Start difference. First operand 245 states and 395 transitions. Second operand 3 states. [2018-11-18 10:22:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,398 INFO L93 Difference]: Finished difference Result 445 states and 729 transitions. [2018-11-18 10:22:48,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 10:22:48,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,400 INFO L225 Difference]: With dead ends: 445 [2018-11-18 10:22:48,400 INFO L226 Difference]: Without dead ends: 443 [2018-11-18 10:22:48,400 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 10:22:48,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-18 10:22:48,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 337. [2018-11-18 10:22:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-11-18 10:22:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 535 transitions. [2018-11-18 10:22:48,410 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 535 transitions. Word has length 23 [2018-11-18 10:22:48,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,410 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 535 transitions. [2018-11-18 10:22:48,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,410 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 535 transitions. [2018-11-18 10:22:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 10:22:48,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,411 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 10:22:48,412 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,412 INFO L82 PathProgramCache]: Analyzing trace with hash 337277417, now seen corresponding path program 1 times [2018-11-18 10:22:48,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,435 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 10:22:48,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,436 INFO L87 Difference]: Start difference. First operand 337 states and 535 transitions. Second operand 3 states. [2018-11-18 10:22:48,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,492 INFO L93 Difference]: Finished difference Result 789 states and 1257 transitions. [2018-11-18 10:22:48,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 10:22:48,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,494 INFO L225 Difference]: With dead ends: 789 [2018-11-18 10:22:48,494 INFO L226 Difference]: Without dead ends: 467 [2018-11-18 10:22:48,495 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 10:22:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-11-18 10:22:48,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2018-11-18 10:22:48,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-11-18 10:22:48,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 727 transitions. [2018-11-18 10:22:48,507 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 727 transitions. Word has length 23 [2018-11-18 10:22:48,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,507 INFO L480 AbstractCegarLoop]: Abstraction has 465 states and 727 transitions. [2018-11-18 10:22:48,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,508 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 727 transitions. [2018-11-18 10:22:48,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 10:22:48,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,508 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 10:22:48,509 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1842281219, now seen corresponding path program 1 times [2018-11-18 10:22:48,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,536 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 10:22:48,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,537 INFO L87 Difference]: Start difference. First operand 465 states and 727 transitions. Second operand 3 states. [2018-11-18 10:22:48,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,549 INFO L93 Difference]: Finished difference Result 697 states and 1085 transitions. [2018-11-18 10:22:48,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 10:22:48,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,550 INFO L225 Difference]: With dead ends: 697 [2018-11-18 10:22:48,551 INFO L226 Difference]: Without dead ends: 475 [2018-11-18 10:22:48,551 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 10:22:48,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2018-11-18 10:22:48,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 473. [2018-11-18 10:22:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-11-18 10:22:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 727 transitions. [2018-11-18 10:22:48,560 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 727 transitions. Word has length 24 [2018-11-18 10:22:48,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,560 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 727 transitions. [2018-11-18 10:22:48,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,560 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 727 transitions. [2018-11-18 10:22:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 10:22:48,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,561 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 10:22:48,561 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1865880063, now seen corresponding path program 1 times [2018-11-18 10:22:48,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,577 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 10:22:48,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,578 INFO L87 Difference]: Start difference. First operand 473 states and 727 transitions. Second operand 3 states. [2018-11-18 10:22:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,611 INFO L93 Difference]: Finished difference Result 1357 states and 2073 transitions. [2018-11-18 10:22:48,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 10:22:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,613 INFO L225 Difference]: With dead ends: 1357 [2018-11-18 10:22:48,613 INFO L226 Difference]: Without dead ends: 907 [2018-11-18 10:22:48,614 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 10:22:48,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-11-18 10:22:48,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 905. [2018-11-18 10:22:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-11-18 10:22:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1351 transitions. [2018-11-18 10:22:48,631 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1351 transitions. Word has length 24 [2018-11-18 10:22:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,632 INFO L480 AbstractCegarLoop]: Abstraction has 905 states and 1351 transitions. [2018-11-18 10:22:48,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,632 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1351 transitions. [2018-11-18 10:22:48,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 10:22:48,633 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,633 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 10:22:48,633 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1607714625, now seen corresponding path program 1 times [2018-11-18 10:22:48,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,655 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 10:22:48,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,656 INFO L87 Difference]: Start difference. First operand 905 states and 1351 transitions. Second operand 3 states. [2018-11-18 10:22:48,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,676 INFO L93 Difference]: Finished difference Result 1085 states and 1657 transitions. [2018-11-18 10:22:48,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 10:22:48,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,679 INFO L225 Difference]: With dead ends: 1085 [2018-11-18 10:22:48,679 INFO L226 Difference]: Without dead ends: 1083 [2018-11-18 10:22:48,679 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 10:22:48,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-11-18 10:22:48,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 905. [2018-11-18 10:22:48,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2018-11-18 10:22:48,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1335 transitions. [2018-11-18 10:22:48,698 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1335 transitions. Word has length 24 [2018-11-18 10:22:48,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,698 INFO L480 AbstractCegarLoop]: Abstraction has 905 states and 1335 transitions. [2018-11-18 10:22:48,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1335 transitions. [2018-11-18 10:22:48,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:22:48,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,699 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 10:22:48,700 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,700 INFO L82 PathProgramCache]: Analyzing trace with hash 2007922174, now seen corresponding path program 1 times [2018-11-18 10:22:48,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,723 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 10:22:48,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,724 INFO L87 Difference]: Start difference. First operand 905 states and 1335 transitions. Second operand 3 states. [2018-11-18 10:22:48,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,749 INFO L93 Difference]: Finished difference Result 1597 states and 2393 transitions. [2018-11-18 10:22:48,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 10:22:48,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,752 INFO L225 Difference]: With dead ends: 1597 [2018-11-18 10:22:48,752 INFO L226 Difference]: Without dead ends: 1595 [2018-11-18 10:22:48,753 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 10:22:48,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-11-18 10:22:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1305. [2018-11-18 10:22:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2018-11-18 10:22:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1879 transitions. [2018-11-18 10:22:48,777 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1879 transitions. Word has length 25 [2018-11-18 10:22:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,778 INFO L480 AbstractCegarLoop]: Abstraction has 1305 states and 1879 transitions. [2018-11-18 10:22:48,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1879 transitions. [2018-11-18 10:22:48,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 10:22:48,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,779 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 10:22:48,780 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2028879684, now seen corresponding path program 1 times [2018-11-18 10:22:48,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,799 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 10:22:48,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,800 INFO L87 Difference]: Start difference. First operand 1305 states and 1879 transitions. Second operand 3 states. [2018-11-18 10:22:48,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,834 INFO L93 Difference]: Finished difference Result 3037 states and 4377 transitions. [2018-11-18 10:22:48,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 10:22:48,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,837 INFO L225 Difference]: With dead ends: 3037 [2018-11-18 10:22:48,837 INFO L226 Difference]: Without dead ends: 1755 [2018-11-18 10:22:48,839 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 10:22:48,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2018-11-18 10:22:48,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2018-11-18 10:22:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2018-11-18 10:22:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2471 transitions. [2018-11-18 10:22:48,874 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2471 transitions. Word has length 25 [2018-11-18 10:22:48,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,874 INFO L480 AbstractCegarLoop]: Abstraction has 1753 states and 2471 transitions. [2018-11-18 10:22:48,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2471 transitions. [2018-11-18 10:22:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 10:22:48,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,876 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 10:22:48,876 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2116260660, now seen corresponding path program 1 times [2018-11-18 10:22:48,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,895 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 10:22:48,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,896 INFO L87 Difference]: Start difference. First operand 1753 states and 2471 transitions. Second operand 3 states. [2018-11-18 10:22:48,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:48,920 INFO L93 Difference]: Finished difference Result 2653 states and 3737 transitions. [2018-11-18 10:22:48,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:48,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 10:22:48,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:48,923 INFO L225 Difference]: With dead ends: 2653 [2018-11-18 10:22:48,923 INFO L226 Difference]: Without dead ends: 1803 [2018-11-18 10:22:48,924 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 10:22:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1803 states. [2018-11-18 10:22:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1803 to 1801. [2018-11-18 10:22:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1801 states. [2018-11-18 10:22:48,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2503 transitions. [2018-11-18 10:22:48,956 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2503 transitions. Word has length 26 [2018-11-18 10:22:48,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:48,957 INFO L480 AbstractCegarLoop]: Abstraction has 1801 states and 2503 transitions. [2018-11-18 10:22:48,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:48,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2503 transitions. [2018-11-18 10:22:48,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 10:22:48,958 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:48,958 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 10:22:48,959 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:48,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:48,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1529454646, now seen corresponding path program 1 times [2018-11-18 10:22:48,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:48,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:48,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:48,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:48,979 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 10:22:48,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:48,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:48,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:48,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:48,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:48,980 INFO L87 Difference]: Start difference. First operand 1801 states and 2503 transitions. Second operand 3 states. [2018-11-18 10:22:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:49,033 INFO L93 Difference]: Finished difference Result 3085 states and 4329 transitions. [2018-11-18 10:22:49,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:49,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 10:22:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:49,061 INFO L225 Difference]: With dead ends: 3085 [2018-11-18 10:22:49,061 INFO L226 Difference]: Without dead ends: 3083 [2018-11-18 10:22:49,062 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 10:22:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2018-11-18 10:22:49,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2633. [2018-11-18 10:22:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2633 states. [2018-11-18 10:22:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2633 states to 2633 states and 3559 transitions. [2018-11-18 10:22:49,102 INFO L78 Accepts]: Start accepts. Automaton has 2633 states and 3559 transitions. Word has length 26 [2018-11-18 10:22:49,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:49,102 INFO L480 AbstractCegarLoop]: Abstraction has 2633 states and 3559 transitions. [2018-11-18 10:22:49,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 2633 states and 3559 transitions. [2018-11-18 10:22:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 10:22:49,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:49,105 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 10:22:49,105 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:49,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:49,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1787620084, now seen corresponding path program 1 times [2018-11-18 10:22:49,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:49,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:49,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:49,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:49,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:49,123 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 10:22:49,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:49,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:49,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:49,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:49,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:49,124 INFO L87 Difference]: Start difference. First operand 2633 states and 3559 transitions. Second operand 3 states. [2018-11-18 10:22:49,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:49,176 INFO L93 Difference]: Finished difference Result 6029 states and 8105 transitions. [2018-11-18 10:22:49,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:49,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 10:22:49,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:49,182 INFO L225 Difference]: With dead ends: 6029 [2018-11-18 10:22:49,182 INFO L226 Difference]: Without dead ends: 3467 [2018-11-18 10:22:49,185 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 10:22:49,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3467 states. [2018-11-18 10:22:49,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3467 to 3465. [2018-11-18 10:22:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3465 states. [2018-11-18 10:22:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4551 transitions. [2018-11-18 10:22:49,244 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4551 transitions. Word has length 26 [2018-11-18 10:22:49,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:49,245 INFO L480 AbstractCegarLoop]: Abstraction has 3465 states and 4551 transitions. [2018-11-18 10:22:49,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:49,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4551 transitions. [2018-11-18 10:22:49,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 10:22:49,247 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:49,247 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, 1] [2018-11-18 10:22:49,247 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:49,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:49,248 INFO L82 PathProgramCache]: Analyzing trace with hash 168669521, now seen corresponding path program 1 times [2018-11-18 10:22:49,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:49,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:49,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:49,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:49,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:49,267 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 10:22:49,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:49,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:49,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:49,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:49,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:49,268 INFO L87 Difference]: Start difference. First operand 3465 states and 4551 transitions. Second operand 3 states. [2018-11-18 10:22:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:49,313 INFO L93 Difference]: Finished difference Result 5197 states and 6793 transitions. [2018-11-18 10:22:49,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:49,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 10:22:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:49,319 INFO L225 Difference]: With dead ends: 5197 [2018-11-18 10:22:49,319 INFO L226 Difference]: Without dead ends: 3531 [2018-11-18 10:22:49,321 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 10:22:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3531 states. [2018-11-18 10:22:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3531 to 3529. [2018-11-18 10:22:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3529 states. [2018-11-18 10:22:49,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3529 states to 3529 states and 4551 transitions. [2018-11-18 10:22:49,381 INFO L78 Accepts]: Start accepts. Automaton has 3529 states and 4551 transitions. Word has length 27 [2018-11-18 10:22:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:49,381 INFO L480 AbstractCegarLoop]: Abstraction has 3529 states and 4551 transitions. [2018-11-18 10:22:49,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3529 states and 4551 transitions. [2018-11-18 10:22:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 10:22:49,383 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:49,383 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, 1] [2018-11-18 10:22:49,384 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:49,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:49,384 INFO L82 PathProgramCache]: Analyzing trace with hash -418136493, now seen corresponding path program 1 times [2018-11-18 10:22:49,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:49,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:49,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:49,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:49,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:49,399 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 10:22:49,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:49,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:49,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:49,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:49,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:49,400 INFO L87 Difference]: Start difference. First operand 3529 states and 4551 transitions. Second operand 3 states. [2018-11-18 10:22:49,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:49,478 INFO L93 Difference]: Finished difference Result 5901 states and 7625 transitions. [2018-11-18 10:22:49,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:49,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 10:22:49,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:49,489 INFO L225 Difference]: With dead ends: 5901 [2018-11-18 10:22:49,489 INFO L226 Difference]: Without dead ends: 5899 [2018-11-18 10:22:49,492 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 10:22:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2018-11-18 10:22:49,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 5257. [2018-11-18 10:22:49,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5257 states. [2018-11-18 10:22:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 6599 transitions. [2018-11-18 10:22:49,576 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 6599 transitions. Word has length 27 [2018-11-18 10:22:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:49,577 INFO L480 AbstractCegarLoop]: Abstraction has 5257 states and 6599 transitions. [2018-11-18 10:22:49,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 6599 transitions. [2018-11-18 10:22:49,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 10:22:49,580 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:49,580 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, 1] [2018-11-18 10:22:49,581 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:49,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:49,581 INFO L82 PathProgramCache]: Analyzing trace with hash -159971055, now seen corresponding path program 1 times [2018-11-18 10:22:49,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:49,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:49,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:49,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:49,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:49,603 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 10:22:49,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:49,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:49,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:49,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:49,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:49,603 INFO L87 Difference]: Start difference. First operand 5257 states and 6599 transitions. Second operand 3 states. [2018-11-18 10:22:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:49,693 INFO L93 Difference]: Finished difference Result 11917 states and 14793 transitions. [2018-11-18 10:22:49,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:49,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 10:22:49,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:49,704 INFO L225 Difference]: With dead ends: 11917 [2018-11-18 10:22:49,705 INFO L226 Difference]: Without dead ends: 6795 [2018-11-18 10:22:49,710 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 10:22:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6795 states. [2018-11-18 10:22:49,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6795 to 6793. [2018-11-18 10:22:49,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6793 states. [2018-11-18 10:22:49,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 8199 transitions. [2018-11-18 10:22:49,879 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 8199 transitions. Word has length 27 [2018-11-18 10:22:49,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:49,879 INFO L480 AbstractCegarLoop]: Abstraction has 6793 states and 8199 transitions. [2018-11-18 10:22:49,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 8199 transitions. [2018-11-18 10:22:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 10:22:49,883 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:49,883 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, 1, 1] [2018-11-18 10:22:49,883 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:49,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:49,884 INFO L82 PathProgramCache]: Analyzing trace with hash -77113303, now seen corresponding path program 1 times [2018-11-18 10:22:49,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:49,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:49,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:49,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:49,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:49,895 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 10:22:49,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:49,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:49,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:49,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:49,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:49,895 INFO L87 Difference]: Start difference. First operand 6793 states and 8199 transitions. Second operand 3 states. [2018-11-18 10:22:49,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:49,978 INFO L93 Difference]: Finished difference Result 10189 states and 12233 transitions. [2018-11-18 10:22:49,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:49,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 10:22:49,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:49,986 INFO L225 Difference]: With dead ends: 10189 [2018-11-18 10:22:49,986 INFO L226 Difference]: Without dead ends: 6923 [2018-11-18 10:22:49,990 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 10:22:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6923 states. [2018-11-18 10:22:50,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6923 to 6921. [2018-11-18 10:22:50,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6921 states. [2018-11-18 10:22:50,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6921 states to 6921 states and 8199 transitions. [2018-11-18 10:22:50,097 INFO L78 Accepts]: Start accepts. Automaton has 6921 states and 8199 transitions. Word has length 28 [2018-11-18 10:22:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:50,098 INFO L480 AbstractCegarLoop]: Abstraction has 6921 states and 8199 transitions. [2018-11-18 10:22:50,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 6921 states and 8199 transitions. [2018-11-18 10:22:50,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 10:22:50,102 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:50,102 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, 1, 1] [2018-11-18 10:22:50,102 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:50,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:50,102 INFO L82 PathProgramCache]: Analyzing trace with hash -663919317, now seen corresponding path program 1 times [2018-11-18 10:22:50,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:50,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:50,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:50,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:50,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:50,119 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 10:22:50,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:50,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:50,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:50,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:50,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:50,120 INFO L87 Difference]: Start difference. First operand 6921 states and 8199 transitions. Second operand 3 states. [2018-11-18 10:22:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:50,254 INFO L93 Difference]: Finished difference Result 11275 states and 13192 transitions. [2018-11-18 10:22:50,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:50,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 10:22:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:50,265 INFO L225 Difference]: With dead ends: 11275 [2018-11-18 10:22:50,265 INFO L226 Difference]: Without dead ends: 11273 [2018-11-18 10:22:50,268 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 10:22:50,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11273 states. [2018-11-18 10:22:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11273 to 10505. [2018-11-18 10:22:50,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10505 states. [2018-11-18 10:22:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10505 states to 10505 states and 12167 transitions. [2018-11-18 10:22:50,401 INFO L78 Accepts]: Start accepts. Automaton has 10505 states and 12167 transitions. Word has length 28 [2018-11-18 10:22:50,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:50,402 INFO L480 AbstractCegarLoop]: Abstraction has 10505 states and 12167 transitions. [2018-11-18 10:22:50,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:50,402 INFO L276 IsEmpty]: Start isEmpty. Operand 10505 states and 12167 transitions. [2018-11-18 10:22:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 10:22:50,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 10:22:50,409 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, 1, 1] [2018-11-18 10:22:50,409 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 10:22:50,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:22:50,409 INFO L82 PathProgramCache]: Analyzing trace with hash -405753879, now seen corresponding path program 1 times [2018-11-18 10:22:50,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:22:50,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:22:50,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:50,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:22:50,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:22:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:22:50,427 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 10:22:50,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:22:50,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 10:22:50,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 10:22:50,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 10:22:50,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 10:22:50,428 INFO L87 Difference]: Start difference. First operand 10505 states and 12167 transitions. Second operand 3 states. [2018-11-18 10:22:50,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:22:50,602 INFO L93 Difference]: Finished difference Result 23561 states and 26759 transitions. [2018-11-18 10:22:50,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 10:22:50,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 10:22:50,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 10:22:50,602 INFO L225 Difference]: With dead ends: 23561 [2018-11-18 10:22:50,602 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 10:22:50,620 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 10:22:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 10:22:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 10:22:50,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 10:22:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 10:22:50,621 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-11-18 10:22:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 10:22:50,621 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 10:22:50,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 10:22:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 10:22:50,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 10:22:50,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 10:22:50,642 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 10:22:50,642 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:22:50,642 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 10:22:50,642 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 10:22:50,642 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 10:22:50,642 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 10:22:50,642 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,642 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-11-18 10:22:50,642 INFO L425 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,643 INFO L425 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-18 10:22:50,643 INFO L425 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,643 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-18 10:22:50,643 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,643 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,643 INFO L425 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-11-18 10:22:50,643 INFO L425 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,643 INFO L425 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,643 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-18 10:22:50,643 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-11-18 10:22:50,643 INFO L428 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-11-18 10:22:50,644 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-11-18 10:22:50,644 INFO L425 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,644 INFO L425 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-18 10:22:50,644 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,644 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-11-18 10:22:50,644 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-18 10:22:50,644 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-18 10:22:50,644 INFO L425 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,644 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,644 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,644 INFO L428 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-11-18 10:22:50,644 INFO L425 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,645 INFO L425 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,645 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-18 10:22:50,645 INFO L425 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-18 10:22:50,645 INFO L421 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-11-18 10:22:50,645 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,645 INFO L425 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,645 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-18 10:22:50,645 INFO L425 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-11-18 10:22:50,645 INFO L425 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,645 INFO L425 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-11-18 10:22:50,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 10:22:50 BoogieIcfgContainer [2018-11-18 10:22:50,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 10:22:50,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 10:22:50,653 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 10:22:50,653 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 10:22:50,653 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:22:47" (3/4) ... [2018-11-18 10:22:50,657 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 10:22:50,662 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 10:22:50,662 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 10:22:50,666 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 10:22:50,666 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 10:22:50,666 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 10:22:50,704 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_db156c6e-467d-4705-a2a2-abd5e4c0cbf4/bin-2019/uautomizer/witness.graphml [2018-11-18 10:22:50,704 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 10:22:50,705 INFO L168 Benchmark]: Toolchain (without parser) took 3516.64 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.3 MB). Free memory was 958.5 MB in the beginning and 868.4 MB in the end (delta: 90.1 MB). Peak memory consumption was 452.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:22:50,706 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 10:22:50,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 177.90 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 945.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:22:50,706 INFO L168 Benchmark]: Boogie Preprocessor took 52.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 945.0 MB in the beginning and 1.2 GB in the end (delta: -212.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-18 10:22:50,707 INFO L168 Benchmark]: RCFGBuilder took 195.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2018-11-18 10:22:50,707 INFO L168 Benchmark]: TraceAbstraction took 3036.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.4 MB). Free memory was 1.1 GB in the beginning and 870.4 MB in the end (delta: 266.6 MB). Peak memory consumption was 470.0 MB. Max. memory is 11.5 GB. [2018-11-18 10:22:50,707 INFO L168 Benchmark]: Witness Printer took 51.46 ms. Allocated memory is still 1.4 GB. Free memory was 870.4 MB in the beginning and 868.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2018-11-18 10:22:50,709 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 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 177.90 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 945.0 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.9 MB). Free memory was 945.0 MB in the beginning and 1.2 GB in the end (delta: -212.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 195.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 20.4 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3036.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 203.4 MB). Free memory was 1.1 GB in the beginning and 870.4 MB in the end (delta: 266.6 MB). Peak memory consumption was 470.0 MB. Max. memory is 11.5 GB. * Witness Printer took 51.46 ms. Allocated memory is still 1.4 GB. Free memory was 870.4 MB in the beginning and 868.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 42 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1990 SDtfs, 948 SDslu, 1336 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10505occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 2583 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 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, 603 NumberOfCodeBlocks, 603 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 578 ConstructedInterpolants, 0 QuantifiedInterpolants, 25820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...