./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_12_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_2d386989-fc18-4ac6-819d-81ed0b9a6d57/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 11:04:21,829 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:04:21,831 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:04:21,839 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:04:21,839 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:04:21,840 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:04:21,841 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:04:21,842 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:04:21,843 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:04:21,844 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:04:21,844 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:04:21,844 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:04:21,845 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:04:21,846 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:04:21,847 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:04:21,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:04:21,848 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:04:21,849 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:04:21,850 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:04:21,851 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:04:21,852 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:04:21,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:04:21,855 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:04:21,855 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:04:21,855 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:04:21,856 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:04:21,856 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:04:21,857 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:04:21,858 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:04:21,858 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:04:21,858 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:04:21,859 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:04:21,859 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:04:21,859 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:04:21,860 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:04:21,860 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:04:21,861 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/bin-2019/uautomizer/config/svcomp-Reach-32bit-PetriAutomizer_Default.epf [2018-11-18 11:04:21,871 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:04:21,871 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:04:21,872 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 11:04:21,872 INFO L133 SettingsManager]: * Process only entry and re-entry procedures=false [2018-11-18 11:04:21,872 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:04:21,873 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:04:21,873 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:04:21,873 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:04:21,873 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:04:21,873 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:04:21,873 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:04:21,874 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:04:21,874 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 11:04:21,874 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 11:04:21,874 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 11:04:21,874 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:04:21,874 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:04:21,874 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:04:21,874 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 11:04:21,875 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:04:21,875 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:04:21,875 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 11:04:21,875 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 11:04:21,875 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 11:04:21,875 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:04:21,876 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 11:04:21,876 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 11:04:21,876 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:04:21,876 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 11:04:21,876 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 11:04:21,876 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_2d386989-fc18-4ac6-819d-81ed0b9a6d57/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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-11-18 11:04:21,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:04:21,909 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:04:21,911 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:04:21,913 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:04:21,913 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:04:21,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 11:04:21,957 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/bin-2019/uautomizer/data/d027182f0/346b99ff8c0e490ab3e025bcd0422690/FLAG920e041ef [2018-11-18 11:04:22,356 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:04:22,357 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 11:04:22,361 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/bin-2019/uautomizer/data/d027182f0/346b99ff8c0e490ab3e025bcd0422690/FLAG920e041ef [2018-11-18 11:04:22,373 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/bin-2019/uautomizer/data/d027182f0/346b99ff8c0e490ab3e025bcd0422690 [2018-11-18 11:04:22,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:04:22,376 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 11:04:22,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:04:22,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:04:22,378 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:04:22,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:04:22" (1/1) ... [2018-11-18 11:04:22,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275144b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:04:22, skipping insertion in model container [2018-11-18 11:04:22,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:04:22" (1/1) ... [2018-11-18 11:04:22,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:04:22,398 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:04:22,507 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:04:22,510 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:04:22,525 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:04:22,534 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:04:22,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:04:22 WrapperNode [2018-11-18 11:04:22,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:04:22,535 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:04:22,535 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:04:22,535 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:04:22,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:04:22" (1/1) ... [2018-11-18 11:04:22,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:04:22" (1/1) ... [2018-11-18 11:04:22,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:04:22" (1/1) ... [2018-11-18 11:04:22,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:04:22" (1/1) ... [2018-11-18 11:04:22,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:04:22" (1/1) ... [2018-11-18 11:04:22,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:04:22" (1/1) ... [2018-11-18 11:04:22,556 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:04:22" (1/1) ... [2018-11-18 11:04:22,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:04:22,558 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:04:22,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:04:22,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:04:22,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:04:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/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 11:04:22,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 11:04:22,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:04:22,632 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 11:04:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 11:04:22,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 11:04:22,633 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 11:04:22,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 11:04:22,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:04:22,846 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:04:22,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:04:22 BoogieIcfgContainer [2018-11-18 11:04:22,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:04:22,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 11:04:22,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 11:04:22,850 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 11:04:22,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:04:22" (1/3) ... [2018-11-18 11:04:22,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20104275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:04:22, skipping insertion in model container [2018-11-18 11:04:22,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:04:22" (2/3) ... [2018-11-18 11:04:22,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20104275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:04:22, skipping insertion in model container [2018-11-18 11:04:22,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:04:22" (3/3) ... [2018-11-18 11:04:22,853 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 11:04:22,861 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 11:04:22,867 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 11:04:22,881 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 11:04:22,906 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:04:22,907 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 11:04:22,907 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 11:04:22,907 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 11:04:22,907 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:04:22,907 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:04:22,908 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 11:04:22,908 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:04:22,908 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 11:04:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-18 11:04:22,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 11:04:22,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:22,929 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 11:04:22,931 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:22,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:22,935 INFO L82 PathProgramCache]: Analyzing trace with hash 322166107, now seen corresponding path program 1 times [2018-11-18 11:04:22,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:22,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:22,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:22,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:22,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,082 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 11:04:23,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,097 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2018-11-18 11:04:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,134 INFO L93 Difference]: Finished difference Result 101 states and 176 transitions. [2018-11-18 11:04:23,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 11:04:23,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,143 INFO L225 Difference]: With dead ends: 101 [2018-11-18 11:04:23,143 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 11:04:23,146 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 11:04:23,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 11:04:23,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2018-11-18 11:04:23,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-18 11:04:23,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2018-11-18 11:04:23,175 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2018-11-18 11:04:23,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:23,176 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2018-11-18 11:04:23,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:23,176 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2018-11-18 11:04:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 11:04:23,176 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:23,177 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 11:04:23,177 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:23,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:23,177 INFO L82 PathProgramCache]: Analyzing trace with hash -957697571, now seen corresponding path program 1 times [2018-11-18 11:04:23,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:23,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:23,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:23,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:04:23,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,233 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand 3 states. [2018-11-18 11:04:23,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,256 INFO L93 Difference]: Finished difference Result 140 states and 255 transitions. [2018-11-18 11:04:23,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 11:04:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,257 INFO L225 Difference]: With dead ends: 140 [2018-11-18 11:04:23,257 INFO L226 Difference]: Without dead ends: 86 [2018-11-18 11:04:23,258 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 11:04:23,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-18 11:04:23,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-18 11:04:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-18 11:04:23,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 151 transitions. [2018-11-18 11:04:23,263 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 151 transitions. Word has length 23 [2018-11-18 11:04:23,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:23,263 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 151 transitions. [2018-11-18 11:04:23,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:23,264 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 151 transitions. [2018-11-18 11:04:23,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:04:23,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:23,264 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 11:04:23,264 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:23,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:23,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1397427458, now seen corresponding path program 1 times [2018-11-18 11:04:23,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:23,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:23,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,300 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 11:04:23,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,301 INFO L87 Difference]: Start difference. First operand 84 states and 151 transitions. Second operand 3 states. [2018-11-18 11:04:23,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,323 INFO L93 Difference]: Finished difference Result 130 states and 229 transitions. [2018-11-18 11:04:23,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 11:04:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,325 INFO L225 Difference]: With dead ends: 130 [2018-11-18 11:04:23,325 INFO L226 Difference]: Without dead ends: 90 [2018-11-18 11:04:23,325 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 11:04:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-18 11:04:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-18 11:04:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 11:04:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 154 transitions. [2018-11-18 11:04:23,332 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 154 transitions. Word has length 24 [2018-11-18 11:04:23,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:23,333 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 154 transitions. [2018-11-18 11:04:23,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 154 transitions. [2018-11-18 11:04:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:04:23,333 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:23,333 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 11:04:23,333 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:23,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:23,333 INFO L82 PathProgramCache]: Analyzing trace with hash 376359104, now seen corresponding path program 1 times [2018-11-18 11:04:23,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:23,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:23,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:23,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,359 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 11:04:23,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,360 INFO L87 Difference]: Start difference. First operand 88 states and 154 transitions. Second operand 3 states. [2018-11-18 11:04:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,379 INFO L93 Difference]: Finished difference Result 165 states and 293 transitions. [2018-11-18 11:04:23,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 11:04:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,380 INFO L225 Difference]: With dead ends: 165 [2018-11-18 11:04:23,380 INFO L226 Difference]: Without dead ends: 163 [2018-11-18 11:04:23,380 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 11:04:23,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-18 11:04:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 115. [2018-11-18 11:04:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 11:04:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 203 transitions. [2018-11-18 11:04:23,387 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 203 transitions. Word has length 24 [2018-11-18 11:04:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:23,388 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 203 transitions. [2018-11-18 11:04:23,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:23,388 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 203 transitions. [2018-11-18 11:04:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 11:04:23,388 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:23,389 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 11:04:23,389 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:23,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash -903504574, now seen corresponding path program 1 times [2018-11-18 11:04:23,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:23,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:23,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:23,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,420 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 11:04:23,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,421 INFO L87 Difference]: Start difference. First operand 115 states and 203 transitions. Second operand 3 states. [2018-11-18 11:04:23,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,440 INFO L93 Difference]: Finished difference Result 271 states and 485 transitions. [2018-11-18 11:04:23,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-18 11:04:23,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,441 INFO L225 Difference]: With dead ends: 271 [2018-11-18 11:04:23,441 INFO L226 Difference]: Without dead ends: 165 [2018-11-18 11:04:23,441 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 11:04:23,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-18 11:04:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-11-18 11:04:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-18 11:04:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 287 transitions. [2018-11-18 11:04:23,448 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 287 transitions. Word has length 24 [2018-11-18 11:04:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:23,448 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 287 transitions. [2018-11-18 11:04:23,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 287 transitions. [2018-11-18 11:04:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:04:23,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:23,449 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 11:04:23,449 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:23,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1217556590, now seen corresponding path program 1 times [2018-11-18 11:04:23,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:23,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:04:23,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,498 INFO L87 Difference]: Start difference. First operand 163 states and 287 transitions. Second operand 3 states. [2018-11-18 11:04:23,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,511 INFO L93 Difference]: Finished difference Result 244 states and 428 transitions. [2018-11-18 11:04:23,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:04:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,513 INFO L225 Difference]: With dead ends: 244 [2018-11-18 11:04:23,513 INFO L226 Difference]: Without dead ends: 167 [2018-11-18 11:04:23,513 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 11:04:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-18 11:04:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-11-18 11:04:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-18 11:04:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 287 transitions. [2018-11-18 11:04:23,518 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 287 transitions. Word has length 25 [2018-11-18 11:04:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:23,518 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 287 transitions. [2018-11-18 11:04:23,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:23,518 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 287 transitions. [2018-11-18 11:04:23,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:04:23,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:23,519 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 11:04:23,519 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:23,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:23,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2056342352, now seen corresponding path program 1 times [2018-11-18 11:04:23,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:23,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:23,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:23,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,548 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 11:04:23,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,549 INFO L87 Difference]: Start difference. First operand 165 states and 287 transitions. Second operand 3 states. [2018-11-18 11:04:23,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,573 INFO L93 Difference]: Finished difference Result 309 states and 545 transitions. [2018-11-18 11:04:23,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:04:23,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,574 INFO L225 Difference]: With dead ends: 309 [2018-11-18 11:04:23,575 INFO L226 Difference]: Without dead ends: 307 [2018-11-18 11:04:23,575 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 11:04:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-18 11:04:23,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 221. [2018-11-18 11:04:23,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-18 11:04:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 383 transitions. [2018-11-18 11:04:23,584 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 383 transitions. Word has length 25 [2018-11-18 11:04:23,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:23,584 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 383 transitions. [2018-11-18 11:04:23,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:23,584 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 383 transitions. [2018-11-18 11:04:23,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 11:04:23,585 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:23,585 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 11:04:23,585 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:23,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:23,585 INFO L82 PathProgramCache]: Analyzing trace with hash 776478674, now seen corresponding path program 1 times [2018-11-18 11:04:23,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:23,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:23,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:23,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,616 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 11:04:23,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,617 INFO L87 Difference]: Start difference. First operand 221 states and 383 transitions. Second operand 3 states. [2018-11-18 11:04:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,639 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2018-11-18 11:04:23,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-18 11:04:23,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,640 INFO L225 Difference]: With dead ends: 525 [2018-11-18 11:04:23,640 INFO L226 Difference]: Without dead ends: 315 [2018-11-18 11:04:23,641 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 11:04:23,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-18 11:04:23,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2018-11-18 11:04:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-11-18 11:04:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 539 transitions. [2018-11-18 11:04:23,651 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 539 transitions. Word has length 25 [2018-11-18 11:04:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:23,651 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 539 transitions. [2018-11-18 11:04:23,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 539 transitions. [2018-11-18 11:04:23,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:04:23,652 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:23,652 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 11:04:23,652 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:23,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:23,653 INFO L82 PathProgramCache]: Analyzing trace with hash -677683113, now seen corresponding path program 1 times [2018-11-18 11:04:23,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:23,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:23,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:23,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,687 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 11:04:23,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,688 INFO L87 Difference]: Start difference. First operand 313 states and 539 transitions. Second operand 3 states. [2018-11-18 11:04:23,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,702 INFO L93 Difference]: Finished difference Result 469 states and 805 transitions. [2018-11-18 11:04:23,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 11:04:23,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,704 INFO L225 Difference]: With dead ends: 469 [2018-11-18 11:04:23,704 INFO L226 Difference]: Without dead ends: 319 [2018-11-18 11:04:23,705 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 11:04:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-18 11:04:23,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-11-18 11:04:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-18 11:04:23,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 539 transitions. [2018-11-18 11:04:23,714 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 539 transitions. Word has length 26 [2018-11-18 11:04:23,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:23,715 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 539 transitions. [2018-11-18 11:04:23,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:23,715 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 539 transitions. [2018-11-18 11:04:23,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:04:23,716 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:23,716 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 11:04:23,716 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:23,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:23,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1698751467, now seen corresponding path program 1 times [2018-11-18 11:04:23,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:23,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:23,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:23,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:04:23,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,738 INFO L87 Difference]: Start difference. First operand 317 states and 539 transitions. Second operand 3 states. [2018-11-18 11:04:23,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,760 INFO L93 Difference]: Finished difference Result 589 states and 1017 transitions. [2018-11-18 11:04:23,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 11:04:23,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,762 INFO L225 Difference]: With dead ends: 589 [2018-11-18 11:04:23,762 INFO L226 Difference]: Without dead ends: 587 [2018-11-18 11:04:23,763 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 11:04:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-11-18 11:04:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 433. [2018-11-18 11:04:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-11-18 11:04:23,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 727 transitions. [2018-11-18 11:04:23,776 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 727 transitions. Word has length 26 [2018-11-18 11:04:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:23,777 INFO L480 AbstractCegarLoop]: Abstraction has 433 states and 727 transitions. [2018-11-18 11:04:23,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 727 transitions. [2018-11-18 11:04:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 11:04:23,778 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:23,778 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 11:04:23,778 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:23,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:23,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1316352151, now seen corresponding path program 1 times [2018-11-18 11:04:23,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:23,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:23,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:23,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,795 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 11:04:23,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,796 INFO L87 Difference]: Start difference. First operand 433 states and 727 transitions. Second operand 3 states. [2018-11-18 11:04:23,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,827 INFO L93 Difference]: Finished difference Result 1029 states and 1737 transitions. [2018-11-18 11:04:23,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-18 11:04:23,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,830 INFO L225 Difference]: With dead ends: 1029 [2018-11-18 11:04:23,831 INFO L226 Difference]: Without dead ends: 611 [2018-11-18 11:04:23,832 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 11:04:23,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-11-18 11:04:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2018-11-18 11:04:23,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-11-18 11:04:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1015 transitions. [2018-11-18 11:04:23,850 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1015 transitions. Word has length 26 [2018-11-18 11:04:23,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:23,851 INFO L480 AbstractCegarLoop]: Abstraction has 609 states and 1015 transitions. [2018-11-18 11:04:23,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1015 transitions. [2018-11-18 11:04:23,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 11:04:23,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:23,852 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 11:04:23,852 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:23,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:23,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1121474169, now seen corresponding path program 1 times [2018-11-18 11:04:23,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:23,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:23,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:23,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,875 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 11:04:23,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,877 INFO L87 Difference]: Start difference. First operand 609 states and 1015 transitions. Second operand 3 states. [2018-11-18 11:04:23,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,896 INFO L93 Difference]: Finished difference Result 913 states and 1517 transitions. [2018-11-18 11:04:23,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 11:04:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,899 INFO L225 Difference]: With dead ends: 913 [2018-11-18 11:04:23,899 INFO L226 Difference]: Without dead ends: 619 [2018-11-18 11:04:23,900 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 11:04:23,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-18 11:04:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2018-11-18 11:04:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-18 11:04:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1015 transitions. [2018-11-18 11:04:23,916 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1015 transitions. Word has length 27 [2018-11-18 11:04:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:23,917 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 1015 transitions. [2018-11-18 11:04:23,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1015 transitions. [2018-11-18 11:04:23,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 11:04:23,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:23,918 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 11:04:23,918 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:23,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:23,919 INFO L82 PathProgramCache]: Analyzing trace with hash -2142542523, now seen corresponding path program 1 times [2018-11-18 11:04:23,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:23,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:23,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:23,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:23,937 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 11:04:23,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:23,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:23,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:23,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:23,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:23,939 INFO L87 Difference]: Start difference. First operand 617 states and 1015 transitions. Second operand 3 states. [2018-11-18 11:04:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:23,965 INFO L93 Difference]: Finished difference Result 1789 states and 2937 transitions. [2018-11-18 11:04:23,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:23,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 11:04:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:23,970 INFO L225 Difference]: With dead ends: 1789 [2018-11-18 11:04:23,970 INFO L226 Difference]: Without dead ends: 1195 [2018-11-18 11:04:23,971 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 11:04:23,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-11-18 11:04:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1193. [2018-11-18 11:04:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-11-18 11:04:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1927 transitions. [2018-11-18 11:04:24,005 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1927 transitions. Word has length 27 [2018-11-18 11:04:24,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:24,006 INFO L480 AbstractCegarLoop]: Abstraction has 1193 states and 1927 transitions. [2018-11-18 11:04:24,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:24,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1927 transitions. [2018-11-18 11:04:24,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 11:04:24,007 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:24,007 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 11:04:24,008 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:24,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:24,008 INFO L82 PathProgramCache]: Analyzing trace with hash -862678845, now seen corresponding path program 1 times [2018-11-18 11:04:24,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:24,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:24,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:24,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:24,032 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 11:04:24,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:24,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:24,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:24,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:24,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:24,033 INFO L87 Difference]: Start difference. First operand 1193 states and 1927 transitions. Second operand 3 states. [2018-11-18 11:04:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:24,060 INFO L93 Difference]: Finished difference Result 1469 states and 2425 transitions. [2018-11-18 11:04:24,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:24,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-18 11:04:24,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:24,065 INFO L225 Difference]: With dead ends: 1469 [2018-11-18 11:04:24,065 INFO L226 Difference]: Without dead ends: 1467 [2018-11-18 11:04:24,066 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 11:04:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-11-18 11:04:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1193. [2018-11-18 11:04:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-11-18 11:04:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1911 transitions. [2018-11-18 11:04:24,102 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1911 transitions. Word has length 27 [2018-11-18 11:04:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:24,102 INFO L480 AbstractCegarLoop]: Abstraction has 1193 states and 1911 transitions. [2018-11-18 11:04:24,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1911 transitions. [2018-11-18 11:04:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 11:04:24,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:24,104 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 11:04:24,104 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:24,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:24,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1994094676, now seen corresponding path program 1 times [2018-11-18 11:04:24,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:24,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:24,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:24,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:24,124 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 11:04:24,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:24,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:24,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:24,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:24,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:24,125 INFO L87 Difference]: Start difference. First operand 1193 states and 1911 transitions. Second operand 3 states. [2018-11-18 11:04:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:24,162 INFO L93 Difference]: Finished difference Result 2173 states and 3545 transitions. [2018-11-18 11:04:24,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:24,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 11:04:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:24,169 INFO L225 Difference]: With dead ends: 2173 [2018-11-18 11:04:24,169 INFO L226 Difference]: Without dead ends: 2171 [2018-11-18 11:04:24,170 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 11:04:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2018-11-18 11:04:24,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1689. [2018-11-18 11:04:24,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2018-11-18 11:04:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2647 transitions. [2018-11-18 11:04:24,219 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2647 transitions. Word has length 28 [2018-11-18 11:04:24,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:24,219 INFO L480 AbstractCegarLoop]: Abstraction has 1689 states and 2647 transitions. [2018-11-18 11:04:24,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2647 transitions. [2018-11-18 11:04:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 11:04:24,222 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:24,222 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 11:04:24,222 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:24,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:24,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1021008942, now seen corresponding path program 1 times [2018-11-18 11:04:24,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:24,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:24,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:24,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:24,241 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 11:04:24,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:24,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:24,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:24,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:24,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:24,242 INFO L87 Difference]: Start difference. First operand 1689 states and 2647 transitions. Second operand 3 states. [2018-11-18 11:04:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:24,300 INFO L93 Difference]: Finished difference Result 3997 states and 6297 transitions. [2018-11-18 11:04:24,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:24,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-18 11:04:24,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:24,307 INFO L225 Difference]: With dead ends: 3997 [2018-11-18 11:04:24,307 INFO L226 Difference]: Without dead ends: 2331 [2018-11-18 11:04:24,310 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 11:04:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2018-11-18 11:04:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2329. [2018-11-18 11:04:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2329 states. [2018-11-18 11:04:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3623 transitions. [2018-11-18 11:04:24,370 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3623 transitions. Word has length 28 [2018-11-18 11:04:24,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:24,370 INFO L480 AbstractCegarLoop]: Abstraction has 2329 states and 3623 transitions. [2018-11-18 11:04:24,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:24,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3623 transitions. [2018-11-18 11:04:24,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 11:04:24,373 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:24,373 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, 1] [2018-11-18 11:04:24,373 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:24,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:24,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1687178374, now seen corresponding path program 1 times [2018-11-18 11:04:24,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:24,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:24,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:24,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:24,403 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 11:04:24,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:24,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:24,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:24,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:24,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:24,404 INFO L87 Difference]: Start difference. First operand 2329 states and 3623 transitions. Second operand 3 states. [2018-11-18 11:04:24,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:24,457 INFO L93 Difference]: Finished difference Result 3517 states and 5465 transitions. [2018-11-18 11:04:24,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:24,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 11:04:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:24,464 INFO L225 Difference]: With dead ends: 3517 [2018-11-18 11:04:24,464 INFO L226 Difference]: Without dead ends: 2379 [2018-11-18 11:04:24,466 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 11:04:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2018-11-18 11:04:24,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2377. [2018-11-18 11:04:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-11-18 11:04:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3655 transitions. [2018-11-18 11:04:24,530 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3655 transitions. Word has length 29 [2018-11-18 11:04:24,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:24,530 INFO L480 AbstractCegarLoop]: Abstraction has 2377 states and 3655 transitions. [2018-11-18 11:04:24,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:24,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3655 transitions. [2018-11-18 11:04:24,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 11:04:24,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:24,532 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, 1] [2018-11-18 11:04:24,532 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:24,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:24,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1586720568, now seen corresponding path program 1 times [2018-11-18 11:04:24,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:24,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:24,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:24,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:24,555 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 11:04:24,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:24,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:24,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:24,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:24,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:24,556 INFO L87 Difference]: Start difference. First operand 2377 states and 3655 transitions. Second operand 3 states. [2018-11-18 11:04:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:24,616 INFO L93 Difference]: Finished difference Result 4237 states and 6633 transitions. [2018-11-18 11:04:24,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:24,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 11:04:24,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:24,628 INFO L225 Difference]: With dead ends: 4237 [2018-11-18 11:04:24,628 INFO L226 Difference]: Without dead ends: 4235 [2018-11-18 11:04:24,629 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 11:04:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-11-18 11:04:24,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 3401. [2018-11-18 11:04:24,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2018-11-18 11:04:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 5095 transitions. [2018-11-18 11:04:24,711 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 5095 transitions. Word has length 29 [2018-11-18 11:04:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:24,711 INFO L480 AbstractCegarLoop]: Abstraction has 3401 states and 5095 transitions. [2018-11-18 11:04:24,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 5095 transitions. [2018-11-18 11:04:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-18 11:04:24,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:24,715 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, 1] [2018-11-18 11:04:24,715 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:24,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:24,716 INFO L82 PathProgramCache]: Analyzing trace with hash 306856890, now seen corresponding path program 1 times [2018-11-18 11:04:24,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:24,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:24,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:24,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:24,744 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 11:04:24,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:24,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:24,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:24,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:24,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:24,745 INFO L87 Difference]: Start difference. First operand 3401 states and 5095 transitions. Second operand 3 states. [2018-11-18 11:04:24,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:24,831 INFO L93 Difference]: Finished difference Result 7949 states and 11945 transitions. [2018-11-18 11:04:24,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:24,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-18 11:04:24,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:24,843 INFO L225 Difference]: With dead ends: 7949 [2018-11-18 11:04:24,843 INFO L226 Difference]: Without dead ends: 4619 [2018-11-18 11:04:24,847 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 11:04:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-11-18 11:04:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4617. [2018-11-18 11:04:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4617 states. [2018-11-18 11:04:24,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 6855 transitions. [2018-11-18 11:04:24,961 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 6855 transitions. Word has length 29 [2018-11-18 11:04:24,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:24,961 INFO L480 AbstractCegarLoop]: Abstraction has 4617 states and 6855 transitions. [2018-11-18 11:04:24,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:24,961 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 6855 transitions. [2018-11-18 11:04:24,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:04:24,964 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:24,965 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, 1, 1] [2018-11-18 11:04:24,965 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:24,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:24,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1943912131, now seen corresponding path program 1 times [2018-11-18 11:04:24,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:24,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:24,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:24,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:24,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 11:04:24,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:24,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:24,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:24,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:24,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:24,980 INFO L87 Difference]: Start difference. First operand 4617 states and 6855 transitions. Second operand 3 states. [2018-11-18 11:04:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:25,061 INFO L93 Difference]: Finished difference Result 6925 states and 10249 transitions. [2018-11-18 11:04:25,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:25,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 11:04:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:25,073 INFO L225 Difference]: With dead ends: 6925 [2018-11-18 11:04:25,073 INFO L226 Difference]: Without dead ends: 4683 [2018-11-18 11:04:25,078 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 11:04:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2018-11-18 11:04:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 4681. [2018-11-18 11:04:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4681 states. [2018-11-18 11:04:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 6855 transitions. [2018-11-18 11:04:25,208 INFO L78 Accepts]: Start accepts. Automaton has 4681 states and 6855 transitions. Word has length 30 [2018-11-18 11:04:25,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:25,208 INFO L480 AbstractCegarLoop]: Abstraction has 4681 states and 6855 transitions. [2018-11-18 11:04:25,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 6855 transitions. [2018-11-18 11:04:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:04:25,212 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:25,212 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, 1, 1] [2018-11-18 11:04:25,212 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:25,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:25,213 INFO L82 PathProgramCache]: Analyzing trace with hash 922843777, now seen corresponding path program 1 times [2018-11-18 11:04:25,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:25,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:25,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:25,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:25,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:25,236 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 11:04:25,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:25,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:25,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:25,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:25,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:25,237 INFO L87 Difference]: Start difference. First operand 4681 states and 6855 transitions. Second operand 3 states. [2018-11-18 11:04:25,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:25,354 INFO L93 Difference]: Finished difference Result 8205 states and 12233 transitions. [2018-11-18 11:04:25,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:25,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 11:04:25,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:25,369 INFO L225 Difference]: With dead ends: 8205 [2018-11-18 11:04:25,369 INFO L226 Difference]: Without dead ends: 8203 [2018-11-18 11:04:25,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2018-11-18 11:04:25,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 6793. [2018-11-18 11:04:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6793 states. [2018-11-18 11:04:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 9671 transitions. [2018-11-18 11:04:25,520 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 9671 transitions. Word has length 30 [2018-11-18 11:04:25,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:25,520 INFO L480 AbstractCegarLoop]: Abstraction has 6793 states and 9671 transitions. [2018-11-18 11:04:25,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 9671 transitions. [2018-11-18 11:04:25,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 11:04:25,526 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:25,527 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, 1, 1] [2018-11-18 11:04:25,527 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:25,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:25,527 INFO L82 PathProgramCache]: Analyzing trace with hash -357019901, now seen corresponding path program 1 times [2018-11-18 11:04:25,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:25,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:25,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:25,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:25,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:25,544 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 11:04:25,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:25,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:25,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:25,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:25,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:25,545 INFO L87 Difference]: Start difference. First operand 6793 states and 9671 transitions. Second operand 3 states. [2018-11-18 11:04:25,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:25,685 INFO L93 Difference]: Finished difference Result 15757 states and 22473 transitions. [2018-11-18 11:04:25,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:25,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-18 11:04:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:25,700 INFO L225 Difference]: With dead ends: 15757 [2018-11-18 11:04:25,701 INFO L226 Difference]: Without dead ends: 9099 [2018-11-18 11:04:25,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 11:04:25,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9099 states. [2018-11-18 11:04:25,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9099 to 9097. [2018-11-18 11:04:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9097 states. [2018-11-18 11:04:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9097 states to 9097 states and 12807 transitions. [2018-11-18 11:04:25,919 INFO L78 Accepts]: Start accepts. Automaton has 9097 states and 12807 transitions. Word has length 30 [2018-11-18 11:04:25,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:25,919 INFO L480 AbstractCegarLoop]: Abstraction has 9097 states and 12807 transitions. [2018-11-18 11:04:25,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 9097 states and 12807 transitions. [2018-11-18 11:04:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:04:25,928 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:25,928 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, 1, 1, 1] [2018-11-18 11:04:25,928 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:25,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:25,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1456398865, now seen corresponding path program 1 times [2018-11-18 11:04:25,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:25,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:25,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:25,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:25,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:25,949 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 11:04:25,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:25,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:25,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:25,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:25,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:25,950 INFO L87 Difference]: Start difference. First operand 9097 states and 12807 transitions. Second operand 3 states. [2018-11-18 11:04:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:26,129 INFO L93 Difference]: Finished difference Result 13645 states and 19145 transitions. [2018-11-18 11:04:26,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:26,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 11:04:26,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:26,144 INFO L225 Difference]: With dead ends: 13645 [2018-11-18 11:04:26,144 INFO L226 Difference]: Without dead ends: 9227 [2018-11-18 11:04:26,150 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 11:04:26,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2018-11-18 11:04:26,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 9225. [2018-11-18 11:04:26,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2018-11-18 11:04:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 12807 transitions. [2018-11-18 11:04:26,367 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 12807 transitions. Word has length 31 [2018-11-18 11:04:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:26,368 INFO L480 AbstractCegarLoop]: Abstraction has 9225 states and 12807 transitions. [2018-11-18 11:04:26,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 12807 transitions. [2018-11-18 11:04:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:04:26,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:26,375 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, 1, 1, 1] [2018-11-18 11:04:26,375 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:26,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:26,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1817500077, now seen corresponding path program 1 times [2018-11-18 11:04:26,375 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:26,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:26,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:26,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:26,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:26,387 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 11:04:26,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:26,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:26,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:26,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:26,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:26,388 INFO L87 Difference]: Start difference. First operand 9225 states and 12807 transitions. Second operand 3 states. [2018-11-18 11:04:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:26,592 INFO L93 Difference]: Finished difference Result 15885 states and 22409 transitions. [2018-11-18 11:04:26,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:26,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 11:04:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:26,616 INFO L225 Difference]: With dead ends: 15885 [2018-11-18 11:04:26,616 INFO L226 Difference]: Without dead ends: 15883 [2018-11-18 11:04:26,622 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 11:04:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2018-11-18 11:04:26,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 13577. [2018-11-18 11:04:26,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13577 states. [2018-11-18 11:04:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 18311 transitions. [2018-11-18 11:04:26,910 INFO L78 Accepts]: Start accepts. Automaton has 13577 states and 18311 transitions. Word has length 31 [2018-11-18 11:04:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:26,910 INFO L480 AbstractCegarLoop]: Abstraction has 13577 states and 18311 transitions. [2018-11-18 11:04:26,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 13577 states and 18311 transitions. [2018-11-18 11:04:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 11:04:26,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:26,924 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, 1, 1, 1] [2018-11-18 11:04:26,924 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:26,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash 537636399, now seen corresponding path program 1 times [2018-11-18 11:04:26,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:26,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:26,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:26,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:26,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:04:26,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:26,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:26,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:26,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:26,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:26,949 INFO L87 Difference]: Start difference. First operand 13577 states and 18311 transitions. Second operand 3 states. [2018-11-18 11:04:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:27,215 INFO L93 Difference]: Finished difference Result 31245 states and 42121 transitions. [2018-11-18 11:04:27,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:27,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-18 11:04:27,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:27,229 INFO L225 Difference]: With dead ends: 31245 [2018-11-18 11:04:27,230 INFO L226 Difference]: Without dead ends: 17931 [2018-11-18 11:04:27,243 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 11:04:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17931 states. [2018-11-18 11:04:27,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17931 to 17929. [2018-11-18 11:04:27,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17929 states. [2018-11-18 11:04:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17929 states to 17929 states and 23815 transitions. [2018-11-18 11:04:27,440 INFO L78 Accepts]: Start accepts. Automaton has 17929 states and 23815 transitions. Word has length 31 [2018-11-18 11:04:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:27,441 INFO L480 AbstractCegarLoop]: Abstraction has 17929 states and 23815 transitions. [2018-11-18 11:04:27,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:27,441 INFO L276 IsEmpty]: Start isEmpty. Operand 17929 states and 23815 transitions. [2018-11-18 11:04:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 11:04:27,448 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:27,448 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, 1, 1, 1, 1] [2018-11-18 11:04:27,448 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:27,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:27,448 INFO L82 PathProgramCache]: Analyzing trace with hash 508143000, now seen corresponding path program 1 times [2018-11-18 11:04:27,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:27,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:27,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:27,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:27,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:27,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:27,463 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 11:04:27,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:27,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:27,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:27,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:27,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:27,464 INFO L87 Difference]: Start difference. First operand 17929 states and 23815 transitions. Second operand 3 states. [2018-11-18 11:04:27,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:27,676 INFO L93 Difference]: Finished difference Result 26893 states and 35593 transitions. [2018-11-18 11:04:27,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:27,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 11:04:27,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:27,692 INFO L225 Difference]: With dead ends: 26893 [2018-11-18 11:04:27,692 INFO L226 Difference]: Without dead ends: 18187 [2018-11-18 11:04:27,702 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 11:04:27,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18187 states. [2018-11-18 11:04:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18187 to 18185. [2018-11-18 11:04:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18185 states. [2018-11-18 11:04:28,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18185 states to 18185 states and 23815 transitions. [2018-11-18 11:04:28,037 INFO L78 Accepts]: Start accepts. Automaton has 18185 states and 23815 transitions. Word has length 32 [2018-11-18 11:04:28,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:28,037 INFO L480 AbstractCegarLoop]: Abstraction has 18185 states and 23815 transitions. [2018-11-18 11:04:28,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:28,037 INFO L276 IsEmpty]: Start isEmpty. Operand 18185 states and 23815 transitions. [2018-11-18 11:04:28,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 11:04:28,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:28,047 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, 1, 1, 1, 1] [2018-11-18 11:04:28,047 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:28,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:28,048 INFO L82 PathProgramCache]: Analyzing trace with hash -512925354, now seen corresponding path program 1 times [2018-11-18 11:04:28,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:28,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:28,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:28,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:28,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:28,072 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 11:04:28,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:28,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:28,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:28,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:28,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:28,073 INFO L87 Difference]: Start difference. First operand 18185 states and 23815 transitions. Second operand 3 states. [2018-11-18 11:04:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:28,387 INFO L93 Difference]: Finished difference Result 30733 states and 40713 transitions. [2018-11-18 11:04:28,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:28,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 11:04:28,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:28,414 INFO L225 Difference]: With dead ends: 30733 [2018-11-18 11:04:28,414 INFO L226 Difference]: Without dead ends: 30731 [2018-11-18 11:04:28,424 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 11:04:28,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30731 states. [2018-11-18 11:04:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30731 to 27145. [2018-11-18 11:04:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27145 states. [2018-11-18 11:04:28,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27145 states to 27145 states and 34567 transitions. [2018-11-18 11:04:28,839 INFO L78 Accepts]: Start accepts. Automaton has 27145 states and 34567 transitions. Word has length 32 [2018-11-18 11:04:28,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:28,840 INFO L480 AbstractCegarLoop]: Abstraction has 27145 states and 34567 transitions. [2018-11-18 11:04:28,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 27145 states and 34567 transitions. [2018-11-18 11:04:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-18 11:04:28,850 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:28,850 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, 1, 1, 1, 1] [2018-11-18 11:04:28,850 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:28,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:28,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1792789032, now seen corresponding path program 1 times [2018-11-18 11:04:28,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:28,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:28,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:28,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:28,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:28,879 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 11:04:28,880 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:28,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:28,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:28,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:28,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:28,880 INFO L87 Difference]: Start difference. First operand 27145 states and 34567 transitions. Second operand 3 states. [2018-11-18 11:04:29,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:29,198 INFO L93 Difference]: Finished difference Result 61965 states and 78601 transitions. [2018-11-18 11:04:29,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:29,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-18 11:04:29,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:29,222 INFO L225 Difference]: With dead ends: 61965 [2018-11-18 11:04:29,222 INFO L226 Difference]: Without dead ends: 35339 [2018-11-18 11:04:29,252 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 11:04:29,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35339 states. [2018-11-18 11:04:29,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35339 to 35337. [2018-11-18 11:04:29,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35337 states. [2018-11-18 11:04:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35337 states to 35337 states and 44039 transitions. [2018-11-18 11:04:29,809 INFO L78 Accepts]: Start accepts. Automaton has 35337 states and 44039 transitions. Word has length 32 [2018-11-18 11:04:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:29,809 INFO L480 AbstractCegarLoop]: Abstraction has 35337 states and 44039 transitions. [2018-11-18 11:04:29,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 35337 states and 44039 transitions. [2018-11-18 11:04:29,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 11:04:29,819 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:29,819 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, 1, 1, 1, 1, 1] [2018-11-18 11:04:29,820 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:29,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:29,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1279399012, now seen corresponding path program 1 times [2018-11-18 11:04:29,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:29,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:29,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:29,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:29,847 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 11:04:29,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:29,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:29,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:29,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:29,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:29,848 INFO L87 Difference]: Start difference. First operand 35337 states and 44039 transitions. Second operand 3 states. [2018-11-18 11:04:30,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:30,127 INFO L93 Difference]: Finished difference Result 53005 states and 65801 transitions. [2018-11-18 11:04:30,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:30,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 11:04:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:30,151 INFO L225 Difference]: With dead ends: 53005 [2018-11-18 11:04:30,151 INFO L226 Difference]: Without dead ends: 35851 [2018-11-18 11:04:30,164 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 11:04:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35851 states. [2018-11-18 11:04:30,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35851 to 35849. [2018-11-18 11:04:30,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35849 states. [2018-11-18 11:04:30,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35849 states to 35849 states and 44039 transitions. [2018-11-18 11:04:30,702 INFO L78 Accepts]: Start accepts. Automaton has 35849 states and 44039 transitions. Word has length 33 [2018-11-18 11:04:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:30,702 INFO L480 AbstractCegarLoop]: Abstraction has 35849 states and 44039 transitions. [2018-11-18 11:04:30,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 35849 states and 44039 transitions. [2018-11-18 11:04:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 11:04:30,711 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:30,711 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, 1, 1, 1, 1, 1] [2018-11-18 11:04:30,711 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:30,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:30,712 INFO L82 PathProgramCache]: Analyzing trace with hash 258330658, now seen corresponding path program 1 times [2018-11-18 11:04:30,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:30,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:30,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:30,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:30,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:30,735 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 11:04:30,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:30,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:30,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:30,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:30,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:30,736 INFO L87 Difference]: Start difference. First operand 35849 states and 44039 transitions. Second operand 3 states. [2018-11-18 11:04:31,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:31,229 INFO L93 Difference]: Finished difference Result 59405 states and 73225 transitions. [2018-11-18 11:04:31,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:31,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 11:04:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:31,270 INFO L225 Difference]: With dead ends: 59405 [2018-11-18 11:04:31,270 INFO L226 Difference]: Without dead ends: 59403 [2018-11-18 11:04:31,280 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 11:04:31,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59403 states. [2018-11-18 11:04:31,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59403 to 54281. [2018-11-18 11:04:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54281 states. [2018-11-18 11:04:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54281 states to 54281 states and 65031 transitions. [2018-11-18 11:04:32,025 INFO L78 Accepts]: Start accepts. Automaton has 54281 states and 65031 transitions. Word has length 33 [2018-11-18 11:04:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:32,025 INFO L480 AbstractCegarLoop]: Abstraction has 54281 states and 65031 transitions. [2018-11-18 11:04:32,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 54281 states and 65031 transitions. [2018-11-18 11:04:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-18 11:04:32,047 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:32,047 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, 1, 1, 1, 1, 1] [2018-11-18 11:04:32,047 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:32,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1021533020, now seen corresponding path program 1 times [2018-11-18 11:04:32,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:32,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:32,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:32,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:32,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:32,079 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 11:04:32,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:32,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:32,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:32,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:32,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:32,080 INFO L87 Difference]: Start difference. First operand 54281 states and 65031 transitions. Second operand 3 states. [2018-11-18 11:04:32,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:32,701 INFO L93 Difference]: Finished difference Result 122893 states and 145929 transitions. [2018-11-18 11:04:32,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:32,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-18 11:04:32,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:32,752 INFO L225 Difference]: With dead ends: 122893 [2018-11-18 11:04:32,753 INFO L226 Difference]: Without dead ends: 69643 [2018-11-18 11:04:32,788 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 11:04:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69643 states. [2018-11-18 11:04:33,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69643 to 69641. [2018-11-18 11:04:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69641 states. [2018-11-18 11:04:33,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69641 states to 69641 states and 80903 transitions. [2018-11-18 11:04:33,818 INFO L78 Accepts]: Start accepts. Automaton has 69641 states and 80903 transitions. Word has length 33 [2018-11-18 11:04:33,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:33,819 INFO L480 AbstractCegarLoop]: Abstraction has 69641 states and 80903 transitions. [2018-11-18 11:04:33,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 69641 states and 80903 transitions. [2018-11-18 11:04:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 11:04:33,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:33,840 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:04:33,840 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:33,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:33,840 INFO L82 PathProgramCache]: Analyzing trace with hash -581468051, now seen corresponding path program 1 times [2018-11-18 11:04:33,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:33,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:33,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:33,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:33,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:33,864 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 11:04:33,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:33,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:33,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:33,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:33,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:33,865 INFO L87 Difference]: Start difference. First operand 69641 states and 80903 transitions. Second operand 3 states. [2018-11-18 11:04:34,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:34,477 INFO L93 Difference]: Finished difference Result 104461 states and 120841 transitions. [2018-11-18 11:04:34,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:34,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 11:04:34,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:34,530 INFO L225 Difference]: With dead ends: 104461 [2018-11-18 11:04:34,530 INFO L226 Difference]: Without dead ends: 70667 [2018-11-18 11:04:34,557 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 11:04:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70667 states. [2018-11-18 11:04:35,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70667 to 70665. [2018-11-18 11:04:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70665 states. [2018-11-18 11:04:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70665 states to 70665 states and 80903 transitions. [2018-11-18 11:04:35,675 INFO L78 Accepts]: Start accepts. Automaton has 70665 states and 80903 transitions. Word has length 34 [2018-11-18 11:04:35,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:35,676 INFO L480 AbstractCegarLoop]: Abstraction has 70665 states and 80903 transitions. [2018-11-18 11:04:35,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:35,676 INFO L276 IsEmpty]: Start isEmpty. Operand 70665 states and 80903 transitions. [2018-11-18 11:04:35,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 11:04:35,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:35,697 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, 1, 1, 1, 1, 1, 1] [2018-11-18 11:04:35,697 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:35,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1602536405, now seen corresponding path program 1 times [2018-11-18 11:04:35,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:35,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:35,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:35,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:35,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:35,735 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 11:04:35,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:35,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:35,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:35,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:35,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:35,736 INFO L87 Difference]: Start difference. First operand 70665 states and 80903 transitions. Second operand 3 states. [2018-11-18 11:04:36,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:36,844 INFO L93 Difference]: Finished difference Result 114699 states and 130056 transitions. [2018-11-18 11:04:36,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:36,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 11:04:36,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:36,915 INFO L225 Difference]: With dead ends: 114699 [2018-11-18 11:04:36,916 INFO L226 Difference]: Without dead ends: 114697 [2018-11-18 11:04:36,927 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 11:04:36,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114697 states. [2018-11-18 11:04:37,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114697 to 108553. [2018-11-18 11:04:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108553 states. [2018-11-18 11:04:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108553 states to 108553 states and 121863 transitions. [2018-11-18 11:04:38,066 INFO L78 Accepts]: Start accepts. Automaton has 108553 states and 121863 transitions. Word has length 34 [2018-11-18 11:04:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:38,067 INFO L480 AbstractCegarLoop]: Abstraction has 108553 states and 121863 transitions. [2018-11-18 11:04:38,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 108553 states and 121863 transitions. [2018-11-18 11:04:38,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-18 11:04:38,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 11:04:38,114 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, 1, 1, 1, 1, 1, 1] [2018-11-18 11:04:38,114 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 11:04:38,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:04:38,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1412567213, now seen corresponding path program 1 times [2018-11-18 11:04:38,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:04:38,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:04:38,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:38,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:04:38,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:04:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:04:38,140 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 11:04:38,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:04:38,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:04:38,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 11:04:38,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:04:38,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:04:38,141 INFO L87 Difference]: Start difference. First operand 108553 states and 121863 transitions. Second operand 3 states. [2018-11-18 11:04:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:04:39,670 INFO L93 Difference]: Finished difference Result 243721 states and 269319 transitions. [2018-11-18 11:04:39,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:04:39,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-18 11:04:39,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 11:04:39,670 INFO L225 Difference]: With dead ends: 243721 [2018-11-18 11:04:39,670 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 11:04:39,752 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 11:04:39,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 11:04:39,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 11:04:39,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 11:04:39,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 11:04:39,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-11-18 11:04:39,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 11:04:39,753 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:04:39,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 11:04:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:04:39,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 11:04:39,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 11:04:39,777 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 11:04:39,777 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:04:39,778 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 11:04:39,778 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 11:04:39,778 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 11:04:39,778 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 11:04:39,778 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,778 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-11-18 11:04:39,778 INFO L425 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,778 INFO L425 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,778 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-18 11:04:39,778 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-18 11:04:39,778 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-18 11:04:39,778 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,779 INFO L425 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,779 INFO L425 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,779 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,779 INFO L425 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,779 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-11-18 11:04:39,779 INFO L425 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-11-18 11:04:39,779 INFO L425 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,779 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-18 11:04:39,779 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,779 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-11-18 11:04:39,779 INFO L428 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-11-18 11:04:39,779 INFO L425 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,779 INFO L425 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,779 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-11-18 11:04:39,780 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,780 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,780 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-18 11:04:39,780 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-18 11:04:39,780 INFO L425 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,780 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,780 INFO L428 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-11-18 11:04:39,780 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-18 11:04:39,780 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-18 11:04:39,780 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-11-18 11:04:39,780 INFO L425 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-11-18 11:04:39,780 INFO L421 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-11-18 11:04:39,781 INFO L425 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,781 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,781 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,781 INFO L425 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,781 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,781 INFO L425 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,781 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,781 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-18 11:04:39,781 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-11-18 11:04:39,781 INFO L425 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-11-18 11:04:39,781 INFO L425 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-11-18 11:04:39,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:04:39 BoogieIcfgContainer [2018-11-18 11:04:39,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 11:04:39,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:04:39,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:04:39,789 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:04:39,790 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:04:22" (3/4) ... [2018-11-18 11:04:39,793 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 11:04:39,798 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 11:04:39,799 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 11:04:39,803 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 11:04:39,804 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 11:04:39,804 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 11:04:39,853 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2d386989-fc18-4ac6-819d-81ed0b9a6d57/bin-2019/uautomizer/witness.graphml [2018-11-18 11:04:39,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:04:39,853 INFO L168 Benchmark]: Toolchain (without parser) took 17478.42 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 959.1 MB in the beginning and 1.8 GB in the end (delta: -835.2 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 11:04:39,855 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:04:39,856 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.76 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:04:39,856 INFO L168 Benchmark]: Boogie Preprocessor took 22.71 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:04:39,856 INFO L168 Benchmark]: RCFGBuilder took 288.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -133.7 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:04:39,856 INFO L168 Benchmark]: TraceAbstraction took 16941.86 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -753.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-11-18 11:04:39,857 INFO L168 Benchmark]: Witness Printer took 63.93 ms. Allocated memory is still 3.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:04:39,858 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 158.76 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.71 ms. Allocated memory is still 1.0 GB. Free memory is still 945.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 288.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -133.7 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16941.86 ms. Allocated memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.8 GB in the end (delta: -753.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 63.93 ms. Allocated memory is still 3.0 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. SAFE Result, 16.8s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 7.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3487 SDtfs, 1713 SDslu, 2374 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108553occurred in iteration=33, 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: 7.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 20515 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 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.7s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 941 ConstructedInterpolants, 0 QuantifiedInterpolants, 53057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...