./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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 aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/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_cc95cbd2-ec15-451c-960f-e0ba297c70b7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/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-aa41828 [2018-11-22 21:34:16,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:34:16,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:34:16,845 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:34:16,845 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:34:16,846 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:34:16,847 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:34:16,848 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:34:16,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:34:16,850 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:34:16,851 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:34:16,851 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:34:16,852 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:34:16,853 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:34:16,853 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:34:16,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:34:16,854 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:34:16,855 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:34:16,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:34:16,857 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:34:16,858 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:34:16,859 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:34:16,861 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:34:16,861 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:34:16,861 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:34:16,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:34:16,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:34:16,863 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:34:16,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:34:16,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:34:16,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:34:16,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:34:16,865 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:34:16,865 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:34:16,866 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:34:16,867 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:34:16,867 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-22 21:34:16,874 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:34:16,875 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:34:16,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:34:16,876 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:34:16,876 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 21:34:16,876 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 21:34:16,876 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 21:34:16,877 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:34:16,877 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:34:16,877 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:34:16,877 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:34:16,877 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:34:16,877 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:34:16,877 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:34:16,878 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:34:16,878 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:34:16,878 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:34:16,878 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:34:16,878 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:34:16,878 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:34:16,878 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:34:16,879 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:34:16,879 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:34:16,879 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:34:16,879 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:34:16,879 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:34:16,879 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:34:16,879 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 21:34:16,880 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:34:16,880 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:34:16,880 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_cc95cbd2-ec15-451c-960f-e0ba297c70b7/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-22 21:34:16,904 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:34:16,914 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:34:16,917 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:34:16,918 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:34:16,918 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:34:16,919 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 21:34:16,968 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/bin-2019/uautomizer/data/a5c05c7a8/4da4a06b6b1d4a61a934896465ea6851/FLAG138b9295b [2018-11-22 21:34:17,330 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:34:17,331 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 21:34:17,338 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/bin-2019/uautomizer/data/a5c05c7a8/4da4a06b6b1d4a61a934896465ea6851/FLAG138b9295b [2018-11-22 21:34:17,738 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/bin-2019/uautomizer/data/a5c05c7a8/4da4a06b6b1d4a61a934896465ea6851 [2018-11-22 21:34:17,741 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:34:17,742 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:34:17,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:34:17,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:34:17,747 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:34:17,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:34:17" (1/1) ... [2018-11-22 21:34:17,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5c9f1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17, skipping insertion in model container [2018-11-22 21:34:17,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:34:17" (1/1) ... [2018-11-22 21:34:17,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:34:17,780 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:34:17,908 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:34:17,911 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:34:17,933 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:34:17,942 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:34:17,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17 WrapperNode [2018-11-22 21:34:17,942 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:34:17,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:34:17,943 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:34:17,943 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:34:17,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17" (1/1) ... [2018-11-22 21:34:17,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17" (1/1) ... [2018-11-22 21:34:17,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:34:17,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:34:17,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:34:17,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:34:17,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17" (1/1) ... [2018-11-22 21:34:17,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17" (1/1) ... [2018-11-22 21:34:17,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17" (1/1) ... [2018-11-22 21:34:17,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17" (1/1) ... [2018-11-22 21:34:17,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17" (1/1) ... [2018-11-22 21:34:17,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17" (1/1) ... [2018-11-22 21:34:17,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17" (1/1) ... [2018-11-22 21:34:17,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:34:17,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:34:17,979 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:34:17,979 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:34:17,980 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/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-22 21:34:18,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:34:18,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:34:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:34:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:34:18,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:34:18,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:34:18,271 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:34:18,272 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 21:34:18,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:34:18 BoogieIcfgContainer [2018-11-22 21:34:18,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:34:18,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:34:18,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:34:18,275 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:34:18,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:34:17" (1/3) ... [2018-11-22 21:34:18,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7550731b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:34:18, skipping insertion in model container [2018-11-22 21:34:18,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:34:17" (2/3) ... [2018-11-22 21:34:18,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7550731b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:34:18, skipping insertion in model container [2018-11-22 21:34:18,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:34:18" (3/3) ... [2018-11-22 21:34:18,277 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 21:34:18,284 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:34:18,289 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:34:18,298 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:34:18,326 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 21:34:18,327 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:34:18,327 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:34:18,327 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:34:18,327 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:34:18,327 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:34:18,327 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:34:18,328 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:34:18,328 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:34:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-22 21:34:18,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-22 21:34:18,347 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:18,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:18,349 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:18,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:18,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1339057171, now seen corresponding path program 1 times [2018-11-22 21:34:18,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:18,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:18,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:18,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:18,492 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-22 21:34:18,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:18,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:18,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:18,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:18,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,509 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 3 states. [2018-11-22 21:34:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:18,554 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2018-11-22 21:34:18,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:18,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-22 21:34:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:18,563 INFO L225 Difference]: With dead ends: 99 [2018-11-22 21:34:18,563 INFO L226 Difference]: Without dead ends: 84 [2018-11-22 21:34:18,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-22 21:34:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2018-11-22 21:34:18,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-22 21:34:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2018-11-22 21:34:18,595 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 22 [2018-11-22 21:34:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:18,595 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2018-11-22 21:34:18,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2018-11-22 21:34:18,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-22 21:34:18,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:18,596 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:18,597 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:18,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:18,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1676046447, now seen corresponding path program 1 times [2018-11-22 21:34:18,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:18,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:18,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:18,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:18,645 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-22 21:34:18,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:18,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:18,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:18,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:18,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,648 INFO L87 Difference]: Start difference. First operand 58 states and 105 transitions. Second operand 3 states. [2018-11-22 21:34:18,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:18,675 INFO L93 Difference]: Finished difference Result 137 states and 252 transitions. [2018-11-22 21:34:18,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:18,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-22 21:34:18,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:18,676 INFO L225 Difference]: With dead ends: 137 [2018-11-22 21:34:18,676 INFO L226 Difference]: Without dead ends: 84 [2018-11-22 21:34:18,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-22 21:34:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-11-22 21:34:18,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-22 21:34:18,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 149 transitions. [2018-11-22 21:34:18,685 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 149 transitions. Word has length 22 [2018-11-22 21:34:18,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:18,685 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 149 transitions. [2018-11-22 21:34:18,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 149 transitions. [2018-11-22 21:34:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 21:34:18,686 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:18,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:18,686 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:18,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:18,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1439113391, now seen corresponding path program 1 times [2018-11-22 21:34:18,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:18,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:18,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:18,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:18,727 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-22 21:34:18,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:18,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:18,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:18,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:18,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,728 INFO L87 Difference]: Start difference. First operand 82 states and 149 transitions. Second operand 3 states. [2018-11-22 21:34:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:18,746 INFO L93 Difference]: Finished difference Result 126 states and 225 transitions. [2018-11-22 21:34:18,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:18,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-22 21:34:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:18,748 INFO L225 Difference]: With dead ends: 126 [2018-11-22 21:34:18,748 INFO L226 Difference]: Without dead ends: 87 [2018-11-22 21:34:18,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-22 21:34:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-11-22 21:34:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-22 21:34:18,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 151 transitions. [2018-11-22 21:34:18,753 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 151 transitions. Word has length 23 [2018-11-22 21:34:18,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:18,753 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 151 transitions. [2018-11-22 21:34:18,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:18,754 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 151 transitions. [2018-11-22 21:34:18,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 21:34:18,754 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:18,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:18,755 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:18,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:18,755 INFO L82 PathProgramCache]: Analyzing trace with hash 418045037, now seen corresponding path program 1 times [2018-11-22 21:34:18,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:18,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:18,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:18,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:18,794 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-22 21:34:18,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:18,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:18,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:18,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:18,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,796 INFO L87 Difference]: Start difference. First operand 85 states and 151 transitions. Second operand 3 states. [2018-11-22 21:34:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:18,814 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2018-11-22 21:34:18,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:18,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-22 21:34:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:18,815 INFO L225 Difference]: With dead ends: 160 [2018-11-22 21:34:18,815 INFO L226 Difference]: Without dead ends: 158 [2018-11-22 21:34:18,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-22 21:34:18,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2018-11-22 21:34:18,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-22 21:34:18,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 200 transitions. [2018-11-22 21:34:18,822 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 200 transitions. Word has length 23 [2018-11-22 21:34:18,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:18,822 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 200 transitions. [2018-11-22 21:34:18,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:18,822 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 200 transitions. [2018-11-22 21:34:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-22 21:34:18,823 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:18,823 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:18,823 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:18,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:18,824 INFO L82 PathProgramCache]: Analyzing trace with hash -861818641, now seen corresponding path program 1 times [2018-11-22 21:34:18,824 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:18,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:18,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:18,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:18,853 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-22 21:34:18,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:18,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:18,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:18,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:18,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,854 INFO L87 Difference]: Start difference. First operand 112 states and 200 transitions. Second operand 3 states. [2018-11-22 21:34:18,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:18,874 INFO L93 Difference]: Finished difference Result 264 states and 478 transitions. [2018-11-22 21:34:18,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:18,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-22 21:34:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:18,875 INFO L225 Difference]: With dead ends: 264 [2018-11-22 21:34:18,875 INFO L226 Difference]: Without dead ends: 160 [2018-11-22 21:34:18,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-22 21:34:18,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-11-22 21:34:18,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-22 21:34:18,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 282 transitions. [2018-11-22 21:34:18,885 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 282 transitions. Word has length 23 [2018-11-22 21:34:18,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:18,886 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 282 transitions. [2018-11-22 21:34:18,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:18,886 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 282 transitions. [2018-11-22 21:34:18,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 21:34:18,887 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:18,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:18,887 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:18,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:18,887 INFO L82 PathProgramCache]: Analyzing trace with hash 74707332, now seen corresponding path program 1 times [2018-11-22 21:34:18,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:18,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:18,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:18,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:18,915 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-22 21:34:18,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:18,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:18,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:18,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:18,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,916 INFO L87 Difference]: Start difference. First operand 158 states and 282 transitions. Second operand 3 states. [2018-11-22 21:34:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:18,938 INFO L93 Difference]: Finished difference Result 237 states and 421 transitions. [2018-11-22 21:34:18,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:18,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-22 21:34:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:18,939 INFO L225 Difference]: With dead ends: 237 [2018-11-22 21:34:18,939 INFO L226 Difference]: Without dead ends: 162 [2018-11-22 21:34:18,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-11-22 21:34:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-11-22 21:34:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-22 21:34:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 282 transitions. [2018-11-22 21:34:18,947 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 282 transitions. Word has length 24 [2018-11-22 21:34:18,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:18,947 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 282 transitions. [2018-11-22 21:34:18,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:18,947 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 282 transitions. [2018-11-22 21:34:18,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 21:34:18,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:18,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:18,948 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:18,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:18,949 INFO L82 PathProgramCache]: Analyzing trace with hash -946361022, now seen corresponding path program 1 times [2018-11-22 21:34:18,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:18,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:18,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:18,994 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-22 21:34:18,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:18,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:18,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:18,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:18,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:18,996 INFO L87 Difference]: Start difference. First operand 160 states and 282 transitions. Second operand 3 states. [2018-11-22 21:34:19,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:19,010 INFO L93 Difference]: Finished difference Result 300 states and 536 transitions. [2018-11-22 21:34:19,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:19,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-22 21:34:19,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:19,016 INFO L225 Difference]: With dead ends: 300 [2018-11-22 21:34:19,016 INFO L226 Difference]: Without dead ends: 298 [2018-11-22 21:34:19,016 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-11-22 21:34:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 216. [2018-11-22 21:34:19,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-22 21:34:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 378 transitions. [2018-11-22 21:34:19,027 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 378 transitions. Word has length 24 [2018-11-22 21:34:19,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:19,027 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 378 transitions. [2018-11-22 21:34:19,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 378 transitions. [2018-11-22 21:34:19,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 21:34:19,029 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:19,029 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:19,029 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:19,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:19,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742596, now seen corresponding path program 1 times [2018-11-22 21:34:19,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:19,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:19,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:19,055 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-22 21:34:19,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:19,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:19,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:19,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:19,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,056 INFO L87 Difference]: Start difference. First operand 216 states and 378 transitions. Second operand 3 states. [2018-11-22 21:34:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:19,086 INFO L93 Difference]: Finished difference Result 512 states and 904 transitions. [2018-11-22 21:34:19,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:19,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-22 21:34:19,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:19,088 INFO L225 Difference]: With dead ends: 512 [2018-11-22 21:34:19,089 INFO L226 Difference]: Without dead ends: 306 [2018-11-22 21:34:19,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-11-22 21:34:19,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-22 21:34:19,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-22 21:34:19,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 530 transitions. [2018-11-22 21:34:19,103 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 530 transitions. Word has length 24 [2018-11-22 21:34:19,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:19,104 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 530 transitions. [2018-11-22 21:34:19,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:19,104 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 530 transitions. [2018-11-22 21:34:19,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 21:34:19,105 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:19,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:19,105 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:19,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:19,107 INFO L82 PathProgramCache]: Analyzing trace with hash 727792804, now seen corresponding path program 1 times [2018-11-22 21:34:19,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:19,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:19,134 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-22 21:34:19,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:19,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:19,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:19,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:19,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,135 INFO L87 Difference]: Start difference. First operand 304 states and 530 transitions. Second operand 3 states. [2018-11-22 21:34:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:19,154 INFO L93 Difference]: Finished difference Result 456 states and 792 transitions. [2018-11-22 21:34:19,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:19,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-22 21:34:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:19,155 INFO L225 Difference]: With dead ends: 456 [2018-11-22 21:34:19,155 INFO L226 Difference]: Without dead ends: 310 [2018-11-22 21:34:19,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-11-22 21:34:19,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-11-22 21:34:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-11-22 21:34:19,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 530 transitions. [2018-11-22 21:34:19,167 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 530 transitions. Word has length 25 [2018-11-22 21:34:19,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:19,167 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 530 transitions. [2018-11-22 21:34:19,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:19,167 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 530 transitions. [2018-11-22 21:34:19,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 21:34:19,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:19,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:19,170 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:19,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:19,170 INFO L82 PathProgramCache]: Analyzing trace with hash -293275550, now seen corresponding path program 1 times [2018-11-22 21:34:19,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:19,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:19,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:19,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:19,190 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-22 21:34:19,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:19,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:19,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:19,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:19,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,191 INFO L87 Difference]: Start difference. First operand 308 states and 530 transitions. Second operand 3 states. [2018-11-22 21:34:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:19,217 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2018-11-22 21:34:19,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:19,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-22 21:34:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:19,220 INFO L225 Difference]: With dead ends: 572 [2018-11-22 21:34:19,220 INFO L226 Difference]: Without dead ends: 570 [2018-11-22 21:34:19,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-11-22 21:34:19,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 424. [2018-11-22 21:34:19,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-11-22 21:34:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 718 transitions. [2018-11-22 21:34:19,236 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 718 transitions. Word has length 25 [2018-11-22 21:34:19,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:19,236 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 718 transitions. [2018-11-22 21:34:19,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:19,236 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 718 transitions. [2018-11-22 21:34:19,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-22 21:34:19,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:19,238 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:19,238 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:19,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:19,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1573139228, now seen corresponding path program 1 times [2018-11-22 21:34:19,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:19,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:19,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:19,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:19,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:34:19,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:19,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:19,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:19,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,268 INFO L87 Difference]: Start difference. First operand 424 states and 718 transitions. Second operand 3 states. [2018-11-22 21:34:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:19,303 INFO L93 Difference]: Finished difference Result 1004 states and 1712 transitions. [2018-11-22 21:34:19,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:19,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-22 21:34:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:19,307 INFO L225 Difference]: With dead ends: 1004 [2018-11-22 21:34:19,307 INFO L226 Difference]: Without dead ends: 594 [2018-11-22 21:34:19,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-11-22 21:34:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 592. [2018-11-22 21:34:19,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-22 21:34:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 998 transitions. [2018-11-22 21:34:19,327 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 998 transitions. Word has length 25 [2018-11-22 21:34:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:19,327 INFO L480 AbstractCegarLoop]: Abstraction has 592 states and 998 transitions. [2018-11-22 21:34:19,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 998 transitions. [2018-11-22 21:34:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 21:34:19,328 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:19,328 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:19,329 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:19,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash -501393703, now seen corresponding path program 1 times [2018-11-22 21:34:19,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:19,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:19,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:19,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:34:19,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:19,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:19,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:19,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:19,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,349 INFO L87 Difference]: Start difference. First operand 592 states and 998 transitions. Second operand 3 states. [2018-11-22 21:34:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:19,373 INFO L93 Difference]: Finished difference Result 888 states and 1492 transitions. [2018-11-22 21:34:19,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:19,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-22 21:34:19,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:19,376 INFO L225 Difference]: With dead ends: 888 [2018-11-22 21:34:19,377 INFO L226 Difference]: Without dead ends: 602 [2018-11-22 21:34:19,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-11-22 21:34:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-11-22 21:34:19,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-11-22 21:34:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 998 transitions. [2018-11-22 21:34:19,397 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 998 transitions. Word has length 26 [2018-11-22 21:34:19,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:19,397 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 998 transitions. [2018-11-22 21:34:19,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:19,398 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 998 transitions. [2018-11-22 21:34:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 21:34:19,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:19,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:19,400 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:19,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1522462057, now seen corresponding path program 1 times [2018-11-22 21:34:19,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:19,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:19,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:19,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:19,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:34:19,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:19,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:19,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:19,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:19,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,428 INFO L87 Difference]: Start difference. First operand 600 states and 998 transitions. Second operand 3 states. [2018-11-22 21:34:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:19,472 INFO L93 Difference]: Finished difference Result 1100 states and 1864 transitions. [2018-11-22 21:34:19,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:19,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-22 21:34:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:19,476 INFO L225 Difference]: With dead ends: 1100 [2018-11-22 21:34:19,477 INFO L226 Difference]: Without dead ends: 1098 [2018-11-22 21:34:19,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2018-11-22 21:34:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 840. [2018-11-22 21:34:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-11-22 21:34:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1366 transitions. [2018-11-22 21:34:19,504 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1366 transitions. Word has length 26 [2018-11-22 21:34:19,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:19,504 INFO L480 AbstractCegarLoop]: Abstraction has 840 states and 1366 transitions. [2018-11-22 21:34:19,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1366 transitions. [2018-11-22 21:34:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 21:34:19,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:19,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:19,506 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:19,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:19,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1492641561, now seen corresponding path program 1 times [2018-11-22 21:34:19,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:19,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:19,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:19,523 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-22 21:34:19,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:19,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:19,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:19,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:19,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,524 INFO L87 Difference]: Start difference. First operand 840 states and 1366 transitions. Second operand 3 states. [2018-11-22 21:34:19,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:19,558 INFO L93 Difference]: Finished difference Result 1980 states and 3240 transitions. [2018-11-22 21:34:19,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:19,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-22 21:34:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:19,563 INFO L225 Difference]: With dead ends: 1980 [2018-11-22 21:34:19,563 INFO L226 Difference]: Without dead ends: 1162 [2018-11-22 21:34:19,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-11-22 21:34:19,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1160. [2018-11-22 21:34:19,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-11-22 21:34:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1878 transitions. [2018-11-22 21:34:19,602 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1878 transitions. Word has length 26 [2018-11-22 21:34:19,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:19,603 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1878 transitions. [2018-11-22 21:34:19,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1878 transitions. [2018-11-22 21:34:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 21:34:19,604 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:19,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:19,605 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:19,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:19,605 INFO L82 PathProgramCache]: Analyzing trace with hash 48530585, now seen corresponding path program 1 times [2018-11-22 21:34:19,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:19,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:19,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:19,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:19,623 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-22 21:34:19,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:19,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:19,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:19,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:19,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,624 INFO L87 Difference]: Start difference. First operand 1160 states and 1878 transitions. Second operand 3 states. [2018-11-22 21:34:19,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:19,654 INFO L93 Difference]: Finished difference Result 1740 states and 2808 transitions. [2018-11-22 21:34:19,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:19,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-22 21:34:19,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:19,659 INFO L225 Difference]: With dead ends: 1740 [2018-11-22 21:34:19,659 INFO L226 Difference]: Without dead ends: 1178 [2018-11-22 21:34:19,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2018-11-22 21:34:19,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1176. [2018-11-22 21:34:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1176 states. [2018-11-22 21:34:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1878 transitions. [2018-11-22 21:34:19,696 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1878 transitions. Word has length 27 [2018-11-22 21:34:19,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:19,696 INFO L480 AbstractCegarLoop]: Abstraction has 1176 states and 1878 transitions. [2018-11-22 21:34:19,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:19,697 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1878 transitions. [2018-11-22 21:34:19,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 21:34:19,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:19,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:19,700 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:19,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:19,700 INFO L82 PathProgramCache]: Analyzing trace with hash -972537769, now seen corresponding path program 1 times [2018-11-22 21:34:19,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:19,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:19,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:19,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:19,719 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-22 21:34:19,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:19,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:19,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:19,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:19,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,720 INFO L87 Difference]: Start difference. First operand 1176 states and 1878 transitions. Second operand 3 states. [2018-11-22 21:34:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:19,762 INFO L93 Difference]: Finished difference Result 2124 states and 3464 transitions. [2018-11-22 21:34:19,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:19,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-22 21:34:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:19,769 INFO L225 Difference]: With dead ends: 2124 [2018-11-22 21:34:19,769 INFO L226 Difference]: Without dead ends: 2122 [2018-11-22 21:34:19,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2018-11-22 21:34:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 1672. [2018-11-22 21:34:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2018-11-22 21:34:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2598 transitions. [2018-11-22 21:34:19,847 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2598 transitions. Word has length 27 [2018-11-22 21:34:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:19,848 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 2598 transitions. [2018-11-22 21:34:19,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2598 transitions. [2018-11-22 21:34:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-22 21:34:19,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:19,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:19,851 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:19,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:19,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2042565849, now seen corresponding path program 1 times [2018-11-22 21:34:19,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:19,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:19,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:19,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:19,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-22 21:34:19,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:19,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:19,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:19,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:19,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,876 INFO L87 Difference]: Start difference. First operand 1672 states and 2598 transitions. Second operand 3 states. [2018-11-22 21:34:19,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:19,932 INFO L93 Difference]: Finished difference Result 3916 states and 6120 transitions. [2018-11-22 21:34:19,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:19,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-22 21:34:19,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:19,939 INFO L225 Difference]: With dead ends: 3916 [2018-11-22 21:34:19,939 INFO L226 Difference]: Without dead ends: 2282 [2018-11-22 21:34:19,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states. [2018-11-22 21:34:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2280. [2018-11-22 21:34:19,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2280 states. [2018-11-22 21:34:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3526 transitions. [2018-11-22 21:34:20,003 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3526 transitions. Word has length 27 [2018-11-22 21:34:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:20,003 INFO L480 AbstractCegarLoop]: Abstraction has 2280 states and 3526 transitions. [2018-11-22 21:34:20,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3526 transitions. [2018-11-22 21:34:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-22 21:34:20,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:20,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:20,006 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:20,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:20,006 INFO L82 PathProgramCache]: Analyzing trace with hash -83685330, now seen corresponding path program 1 times [2018-11-22 21:34:20,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:20,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:20,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:20,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:20,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:20,022 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-22 21:34:20,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:20,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:20,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:20,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:20,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:20,023 INFO L87 Difference]: Start difference. First operand 2280 states and 3526 transitions. Second operand 3 states. [2018-11-22 21:34:20,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:20,073 INFO L93 Difference]: Finished difference Result 3420 states and 5272 transitions. [2018-11-22 21:34:20,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:20,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-22 21:34:20,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:20,080 INFO L225 Difference]: With dead ends: 3420 [2018-11-22 21:34:20,080 INFO L226 Difference]: Without dead ends: 2314 [2018-11-22 21:34:20,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2018-11-22 21:34:20,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2312. [2018-11-22 21:34:20,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-11-22 21:34:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3526 transitions. [2018-11-22 21:34:20,153 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3526 transitions. Word has length 28 [2018-11-22 21:34:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:20,153 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 3526 transitions. [2018-11-22 21:34:20,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:20,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3526 transitions. [2018-11-22 21:34:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-22 21:34:20,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:20,157 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:20,157 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:20,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:20,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1104753684, now seen corresponding path program 1 times [2018-11-22 21:34:20,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:20,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:20,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:20,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:20,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:20,175 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-22 21:34:20,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:20,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:20,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:20,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:20,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:20,176 INFO L87 Difference]: Start difference. First operand 2312 states and 3526 transitions. Second operand 3 states. [2018-11-22 21:34:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:20,260 INFO L93 Difference]: Finished difference Result 4108 states and 6408 transitions. [2018-11-22 21:34:20,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:20,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-22 21:34:20,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:20,273 INFO L225 Difference]: With dead ends: 4108 [2018-11-22 21:34:20,273 INFO L226 Difference]: Without dead ends: 4106 [2018-11-22 21:34:20,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:20,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4106 states. [2018-11-22 21:34:20,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4106 to 3336. [2018-11-22 21:34:20,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-11-22 21:34:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4934 transitions. [2018-11-22 21:34:20,372 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4934 transitions. Word has length 28 [2018-11-22 21:34:20,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:20,372 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4934 transitions. [2018-11-22 21:34:20,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:20,372 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4934 transitions. [2018-11-22 21:34:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-22 21:34:20,377 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:20,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:20,377 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:20,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:20,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1910349934, now seen corresponding path program 1 times [2018-11-22 21:34:20,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:20,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:20,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:20,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:20,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:20,396 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-22 21:34:20,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:20,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:20,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:20,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:20,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:20,397 INFO L87 Difference]: Start difference. First operand 3336 states and 4934 transitions. Second operand 3 states. [2018-11-22 21:34:20,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:20,474 INFO L93 Difference]: Finished difference Result 7756 states and 11528 transitions. [2018-11-22 21:34:20,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:20,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-22 21:34:20,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:20,485 INFO L225 Difference]: With dead ends: 7756 [2018-11-22 21:34:20,486 INFO L226 Difference]: Without dead ends: 4490 [2018-11-22 21:34:20,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:20,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2018-11-22 21:34:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4488. [2018-11-22 21:34:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4488 states. [2018-11-22 21:34:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4488 states to 4488 states and 6598 transitions. [2018-11-22 21:34:20,605 INFO L78 Accepts]: Start accepts. Automaton has 4488 states and 6598 transitions. Word has length 28 [2018-11-22 21:34:20,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:20,605 INFO L480 AbstractCegarLoop]: Abstraction has 4488 states and 6598 transitions. [2018-11-22 21:34:20,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:20,605 INFO L276 IsEmpty]: Start isEmpty. Operand 4488 states and 6598 transitions. [2018-11-22 21:34:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-22 21:34:20,609 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:20,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:20,609 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:20,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:20,610 INFO L82 PathProgramCache]: Analyzing trace with hash 112588942, now seen corresponding path program 1 times [2018-11-22 21:34:20,610 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:20,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:20,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:20,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:20,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:20,626 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-22 21:34:20,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:20,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:20,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:20,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:20,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:20,627 INFO L87 Difference]: Start difference. First operand 4488 states and 6598 transitions. Second operand 3 states. [2018-11-22 21:34:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:20,698 INFO L93 Difference]: Finished difference Result 6732 states and 9864 transitions. [2018-11-22 21:34:20,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:20,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-22 21:34:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:20,730 INFO L225 Difference]: With dead ends: 6732 [2018-11-22 21:34:20,731 INFO L226 Difference]: Without dead ends: 4554 [2018-11-22 21:34:20,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:20,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2018-11-22 21:34:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4552. [2018-11-22 21:34:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4552 states. [2018-11-22 21:34:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 6598 transitions. [2018-11-22 21:34:20,848 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 6598 transitions. Word has length 29 [2018-11-22 21:34:20,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:20,848 INFO L480 AbstractCegarLoop]: Abstraction has 4552 states and 6598 transitions. [2018-11-22 21:34:20,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:20,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 6598 transitions. [2018-11-22 21:34:20,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-22 21:34:20,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:20,853 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:20,853 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:20,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:20,853 INFO L82 PathProgramCache]: Analyzing trace with hash -908479412, now seen corresponding path program 1 times [2018-11-22 21:34:20,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:20,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:20,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:20,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:20,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:20,868 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-22 21:34:20,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:20,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:20,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:20,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:20,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:20,869 INFO L87 Difference]: Start difference. First operand 4552 states and 6598 transitions. Second operand 3 states. [2018-11-22 21:34:21,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:21,007 INFO L93 Difference]: Finished difference Result 13260 states and 19016 transitions. [2018-11-22 21:34:21,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:21,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-22 21:34:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:21,025 INFO L225 Difference]: With dead ends: 13260 [2018-11-22 21:34:21,026 INFO L226 Difference]: Without dead ends: 8842 [2018-11-22 21:34:21,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:21,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8842 states. [2018-11-22 21:34:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8842 to 8840. [2018-11-22 21:34:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-11-22 21:34:21,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12422 transitions. [2018-11-22 21:34:21,251 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12422 transitions. Word has length 29 [2018-11-22 21:34:21,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:21,251 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12422 transitions. [2018-11-22 21:34:21,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:21,251 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12422 transitions. [2018-11-22 21:34:21,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-22 21:34:21,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:21,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:21,259 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:21,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:21,259 INFO L82 PathProgramCache]: Analyzing trace with hash 371384266, now seen corresponding path program 1 times [2018-11-22 21:34:21,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:21,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:21,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:21,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:21,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:21,283 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-22 21:34:21,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:21,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:21,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:21,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:21,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:21,284 INFO L87 Difference]: Start difference. First operand 8840 states and 12422 transitions. Second operand 3 states. [2018-11-22 21:34:21,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:21,440 INFO L93 Difference]: Finished difference Result 10124 states and 14728 transitions. [2018-11-22 21:34:21,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:21,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-22 21:34:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:21,460 INFO L225 Difference]: With dead ends: 10124 [2018-11-22 21:34:21,460 INFO L226 Difference]: Without dead ends: 10122 [2018-11-22 21:34:21,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:21,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10122 states. [2018-11-22 21:34:21,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10122 to 8840. [2018-11-22 21:34:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8840 states. [2018-11-22 21:34:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8840 states to 8840 states and 12294 transitions. [2018-11-22 21:34:21,718 INFO L78 Accepts]: Start accepts. Automaton has 8840 states and 12294 transitions. Word has length 29 [2018-11-22 21:34:21,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:21,718 INFO L480 AbstractCegarLoop]: Abstraction has 8840 states and 12294 transitions. [2018-11-22 21:34:21,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:21,718 INFO L276 IsEmpty]: Start isEmpty. Operand 8840 states and 12294 transitions. [2018-11-22 21:34:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 21:34:21,725 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:21,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:21,726 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:21,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1902124419, now seen corresponding path program 1 times [2018-11-22 21:34:21,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:21,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:21,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:21,762 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-22 21:34:21,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:21,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:21,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:21,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:21,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:21,763 INFO L87 Difference]: Start difference. First operand 8840 states and 12294 transitions. Second operand 3 states. [2018-11-22 21:34:21,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:21,971 INFO L93 Difference]: Finished difference Result 15244 states and 21640 transitions. [2018-11-22 21:34:21,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:21,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-22 21:34:21,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:21,997 INFO L225 Difference]: With dead ends: 15244 [2018-11-22 21:34:21,997 INFO L226 Difference]: Without dead ends: 15242 [2018-11-22 21:34:22,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:22,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15242 states. [2018-11-22 21:34:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15242 to 13192. [2018-11-22 21:34:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2018-11-22 21:34:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 17798 transitions. [2018-11-22 21:34:22,264 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 17798 transitions. Word has length 30 [2018-11-22 21:34:22,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:22,264 INFO L480 AbstractCegarLoop]: Abstraction has 13192 states and 17798 transitions. [2018-11-22 21:34:22,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 17798 transitions. [2018-11-22 21:34:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 21:34:22,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:22,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:22,279 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:22,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:22,280 INFO L82 PathProgramCache]: Analyzing trace with hash 622260741, now seen corresponding path program 1 times [2018-11-22 21:34:22,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:22,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:22,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:22,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:22,295 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-22 21:34:22,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:22,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:22,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:22,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:22,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:22,297 INFO L87 Difference]: Start difference. First operand 13192 states and 17798 transitions. Second operand 3 states. [2018-11-22 21:34:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:22,565 INFO L93 Difference]: Finished difference Result 30348 states and 41096 transitions. [2018-11-22 21:34:22,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:22,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-22 21:34:22,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:22,582 INFO L225 Difference]: With dead ends: 30348 [2018-11-22 21:34:22,582 INFO L226 Difference]: Without dead ends: 17290 [2018-11-22 21:34:22,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:22,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17290 states. [2018-11-22 21:34:22,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17290 to 17288. [2018-11-22 21:34:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17288 states. [2018-11-22 21:34:22,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17288 states to 17288 states and 23046 transitions. [2018-11-22 21:34:22,836 INFO L78 Accepts]: Start accepts. Automaton has 17288 states and 23046 transitions. Word has length 30 [2018-11-22 21:34:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:22,836 INFO L480 AbstractCegarLoop]: Abstraction has 17288 states and 23046 transitions. [2018-11-22 21:34:22,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:22,836 INFO L276 IsEmpty]: Start isEmpty. Operand 17288 states and 23046 transitions. [2018-11-22 21:34:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 21:34:22,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:22,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:22,845 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:22,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:22,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1163469695, now seen corresponding path program 1 times [2018-11-22 21:34:22,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:22,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:22,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:22,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:22,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:22,867 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-22 21:34:22,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:22,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:22,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:22,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:22,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:22,868 INFO L87 Difference]: Start difference. First operand 17288 states and 23046 transitions. Second operand 3 states. [2018-11-22 21:34:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:23,013 INFO L93 Difference]: Finished difference Result 26124 states and 34824 transitions. [2018-11-22 21:34:23,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:23,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-22 21:34:23,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:23,032 INFO L225 Difference]: With dead ends: 26124 [2018-11-22 21:34:23,032 INFO L226 Difference]: Without dead ends: 17674 [2018-11-22 21:34:23,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:23,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17674 states. [2018-11-22 21:34:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17674 to 17672. [2018-11-22 21:34:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17672 states. [2018-11-22 21:34:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17672 states to 17672 states and 23302 transitions. [2018-11-22 21:34:23,361 INFO L78 Accepts]: Start accepts. Automaton has 17672 states and 23302 transitions. Word has length 31 [2018-11-22 21:34:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:23,361 INFO L480 AbstractCegarLoop]: Abstraction has 17672 states and 23302 transitions. [2018-11-22 21:34:23,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 17672 states and 23302 transitions. [2018-11-22 21:34:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 21:34:23,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:23,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:23,369 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:23,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:23,369 INFO L82 PathProgramCache]: Analyzing trace with hash 2110429247, now seen corresponding path program 1 times [2018-11-22 21:34:23,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:23,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:23,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:23,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:23,382 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-22 21:34:23,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:23,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:23,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:23,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:23,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:23,383 INFO L87 Difference]: Start difference. First operand 17672 states and 23302 transitions. Second operand 3 states. [2018-11-22 21:34:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:23,609 INFO L93 Difference]: Finished difference Result 29708 states and 39688 transitions. [2018-11-22 21:34:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:23,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-22 21:34:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:23,636 INFO L225 Difference]: With dead ends: 29708 [2018-11-22 21:34:23,636 INFO L226 Difference]: Without dead ends: 29706 [2018-11-22 21:34:23,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:23,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29706 states. [2018-11-22 21:34:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29706 to 26632. [2018-11-22 21:34:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26632 states. [2018-11-22 21:34:24,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26632 states to 26632 states and 34054 transitions. [2018-11-22 21:34:24,125 INFO L78 Accepts]: Start accepts. Automaton has 26632 states and 34054 transitions. Word has length 31 [2018-11-22 21:34:24,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:24,125 INFO L480 AbstractCegarLoop]: Abstraction has 26632 states and 34054 transitions. [2018-11-22 21:34:24,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:24,125 INFO L276 IsEmpty]: Start isEmpty. Operand 26632 states and 34054 transitions. [2018-11-22 21:34:24,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-22 21:34:24,141 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:24,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:24,142 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:24,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:24,142 INFO L82 PathProgramCache]: Analyzing trace with hash 830565569, now seen corresponding path program 1 times [2018-11-22 21:34:24,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:24,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:24,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:24,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:24,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:24,174 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-22 21:34:24,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:24,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:24,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:24,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:24,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:24,175 INFO L87 Difference]: Start difference. First operand 26632 states and 34054 transitions. Second operand 3 states. [2018-11-22 21:34:24,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:24,488 INFO L93 Difference]: Finished difference Result 60428 states and 77064 transitions. [2018-11-22 21:34:24,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:24,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-22 21:34:24,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:24,521 INFO L225 Difference]: With dead ends: 60428 [2018-11-22 21:34:24,521 INFO L226 Difference]: Without dead ends: 34314 [2018-11-22 21:34:24,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34314 states. [2018-11-22 21:34:25,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34314 to 34312. [2018-11-22 21:34:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34312 states. [2018-11-22 21:34:25,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34312 states to 34312 states and 43014 transitions. [2018-11-22 21:34:25,192 INFO L78 Accepts]: Start accepts. Automaton has 34312 states and 43014 transitions. Word has length 31 [2018-11-22 21:34:25,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:25,192 INFO L480 AbstractCegarLoop]: Abstraction has 34312 states and 43014 transitions. [2018-11-22 21:34:25,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:25,192 INFO L276 IsEmpty]: Start isEmpty. Operand 34312 states and 43014 transitions. [2018-11-22 21:34:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-22 21:34:25,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:25,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:25,328 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:25,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:25,328 INFO L82 PathProgramCache]: Analyzing trace with hash 999013018, now seen corresponding path program 1 times [2018-11-22 21:34:25,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:25,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:25,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:25,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:25,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:25,354 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-22 21:34:25,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:25,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:25,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:25,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:25,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:25,355 INFO L87 Difference]: Start difference. First operand 34312 states and 43014 transitions. Second operand 3 states. [2018-11-22 21:34:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:25,694 INFO L93 Difference]: Finished difference Result 51468 states and 64264 transitions. [2018-11-22 21:34:25,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:25,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-22 21:34:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:25,722 INFO L225 Difference]: With dead ends: 51468 [2018-11-22 21:34:25,722 INFO L226 Difference]: Without dead ends: 34826 [2018-11-22 21:34:25,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34826 states. [2018-11-22 21:34:26,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34826 to 34824. [2018-11-22 21:34:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34824 states. [2018-11-22 21:34:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34824 states to 34824 states and 43014 transitions. [2018-11-22 21:34:26,252 INFO L78 Accepts]: Start accepts. Automaton has 34824 states and 43014 transitions. Word has length 32 [2018-11-22 21:34:26,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:26,252 INFO L480 AbstractCegarLoop]: Abstraction has 34824 states and 43014 transitions. [2018-11-22 21:34:26,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 34824 states and 43014 transitions. [2018-11-22 21:34:26,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-22 21:34:26,265 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:26,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:26,265 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:26,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:26,265 INFO L82 PathProgramCache]: Analyzing trace with hash -22055336, now seen corresponding path program 1 times [2018-11-22 21:34:26,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:26,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:26,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:26,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:26,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:26,294 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-22 21:34:26,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:26,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:26,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:26,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:26,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:26,296 INFO L87 Difference]: Start difference. First operand 34824 states and 43014 transitions. Second operand 3 states. [2018-11-22 21:34:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:26,939 INFO L93 Difference]: Finished difference Result 57356 states and 71176 transitions. [2018-11-22 21:34:26,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:26,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-22 21:34:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:26,978 INFO L225 Difference]: With dead ends: 57356 [2018-11-22 21:34:26,978 INFO L226 Difference]: Without dead ends: 57354 [2018-11-22 21:34:26,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57354 states. [2018-11-22 21:34:27,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57354 to 53256. [2018-11-22 21:34:27,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53256 states. [2018-11-22 21:34:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53256 states to 53256 states and 64006 transitions. [2018-11-22 21:34:27,651 INFO L78 Accepts]: Start accepts. Automaton has 53256 states and 64006 transitions. Word has length 32 [2018-11-22 21:34:27,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:27,651 INFO L480 AbstractCegarLoop]: Abstraction has 53256 states and 64006 transitions. [2018-11-22 21:34:27,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 53256 states and 64006 transitions. [2018-11-22 21:34:27,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-22 21:34:27,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:27,692 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:27,692 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:27,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:27,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1301919014, now seen corresponding path program 1 times [2018-11-22 21:34:27,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:27,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:27,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:27,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:27,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:27,732 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-22 21:34:27,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:27,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:27,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:27,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:27,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:27,733 INFO L87 Difference]: Start difference. First operand 53256 states and 64006 transitions. Second operand 3 states. [2018-11-22 21:34:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:28,630 INFO L93 Difference]: Finished difference Result 119820 states and 142856 transitions. [2018-11-22 21:34:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:28,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-22 21:34:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:28,696 INFO L225 Difference]: With dead ends: 119820 [2018-11-22 21:34:28,696 INFO L226 Difference]: Without dead ends: 67594 [2018-11-22 21:34:28,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67594 states. [2018-11-22 21:34:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67594 to 67592. [2018-11-22 21:34:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67592 states. [2018-11-22 21:34:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67592 states to 67592 states and 78854 transitions. [2018-11-22 21:34:29,968 INFO L78 Accepts]: Start accepts. Automaton has 67592 states and 78854 transitions. Word has length 32 [2018-11-22 21:34:29,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:29,968 INFO L480 AbstractCegarLoop]: Abstraction has 67592 states and 78854 transitions. [2018-11-22 21:34:29,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:29,968 INFO L276 IsEmpty]: Start isEmpty. Operand 67592 states and 78854 transitions. [2018-11-22 21:34:29,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 21:34:29,989 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:29,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:29,989 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:29,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:29,989 INFO L82 PathProgramCache]: Analyzing trace with hash -683499274, now seen corresponding path program 1 times [2018-11-22 21:34:29,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:29,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:29,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:29,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:30,010 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-22 21:34:30,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:30,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:30,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:30,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:30,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:30,011 INFO L87 Difference]: Start difference. First operand 67592 states and 78854 transitions. Second operand 3 states. [2018-11-22 21:34:30,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:30,602 INFO L93 Difference]: Finished difference Result 101388 states and 117768 transitions. [2018-11-22 21:34:30,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:30,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-22 21:34:30,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:30,653 INFO L225 Difference]: With dead ends: 101388 [2018-11-22 21:34:30,653 INFO L226 Difference]: Without dead ends: 68618 [2018-11-22 21:34:30,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68618 states. [2018-11-22 21:34:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68618 to 68616. [2018-11-22 21:34:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68616 states. [2018-11-22 21:34:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68616 states to 68616 states and 78854 transitions. [2018-11-22 21:34:31,898 INFO L78 Accepts]: Start accepts. Automaton has 68616 states and 78854 transitions. Word has length 33 [2018-11-22 21:34:31,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:31,898 INFO L480 AbstractCegarLoop]: Abstraction has 68616 states and 78854 transitions. [2018-11-22 21:34:31,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:31,898 INFO L276 IsEmpty]: Start isEmpty. Operand 68616 states and 78854 transitions. [2018-11-22 21:34:31,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 21:34:31,919 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:31,919 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:31,919 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:31,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:31,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1704567628, now seen corresponding path program 1 times [2018-11-22 21:34:31,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:31,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:31,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:31,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:31,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:31,951 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-22 21:34:31,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:31,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:31,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:31,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:31,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:31,952 INFO L87 Difference]: Start difference. First operand 68616 states and 78854 transitions. Second operand 3 states. [2018-11-22 21:34:32,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:32,978 INFO L93 Difference]: Finished difference Result 110602 states and 125959 transitions. [2018-11-22 21:34:32,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:32,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-22 21:34:32,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:33,071 INFO L225 Difference]: With dead ends: 110602 [2018-11-22 21:34:33,071 INFO L226 Difference]: Without dead ends: 110600 [2018-11-22 21:34:33,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:33,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110600 states. [2018-11-22 21:34:34,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110600 to 106504. [2018-11-22 21:34:34,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106504 states. [2018-11-22 21:34:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106504 states to 106504 states and 119814 transitions. [2018-11-22 21:34:34,662 INFO L78 Accepts]: Start accepts. Automaton has 106504 states and 119814 transitions. Word has length 33 [2018-11-22 21:34:34,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:34,663 INFO L480 AbstractCegarLoop]: Abstraction has 106504 states and 119814 transitions. [2018-11-22 21:34:34,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 106504 states and 119814 transitions. [2018-11-22 21:34:34,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-22 21:34:34,717 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:34:34,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:34:34,718 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:34:34,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:34:34,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1310535990, now seen corresponding path program 1 times [2018-11-22 21:34:34,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 21:34:34,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 21:34:34,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:34,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:34:34,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:34:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:34:34,754 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-22 21:34:34,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:34:34,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:34:34,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:34:34,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:34:34,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:34,755 INFO L87 Difference]: Start difference. First operand 106504 states and 119814 transitions. Second operand 3 states. [2018-11-22 21:34:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:34:36,315 INFO L93 Difference]: Finished difference Result 237576 states and 263174 transitions. [2018-11-22 21:34:36,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:34:36,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-22 21:34:36,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:34:36,316 INFO L225 Difference]: With dead ends: 237576 [2018-11-22 21:34:36,316 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 21:34:36,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:34:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 21:34:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 21:34:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 21:34:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 21:34:36,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-11-22 21:34:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:34:36,433 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:34:36,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:34:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:34:36,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 21:34:36,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 21:34:36,465 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-22 21:34:36,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:34:36,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:34:36,465 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 21:34:36,465 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:34:36,465 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:34:36,466 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,466 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-11-22 21:34:36,466 INFO L448 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,466 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,466 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-22 21:34:36,466 INFO L448 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-22 21:34:36,466 INFO L448 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-22 21:34:36,466 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-11-22 21:34:36,466 INFO L448 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,466 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,467 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,467 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,467 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-11-22 21:34:36,467 INFO L448 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-11-22 21:34:36,467 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,467 INFO L448 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-22 21:34:36,467 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,467 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-11-22 21:34:36,467 INFO L451 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-11-22 21:34:36,467 INFO L448 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,468 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,468 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-11-22 21:34:36,468 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,468 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,468 INFO L448 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-22 21:34:36,468 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-22 21:34:36,468 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,468 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,468 INFO L451 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-11-22 21:34:36,468 INFO L448 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-22 21:34:36,468 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-22 21:34:36,469 INFO L448 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-11-22 21:34:36,469 INFO L444 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-11-22 21:34:36,469 INFO L448 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,469 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,469 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,469 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,469 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,469 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,473 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,474 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-22 21:34:36,474 INFO L448 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-11-22 21:34:36,474 INFO L448 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-11-22 21:34:36,474 INFO L448 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-11-22 21:34:36,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:34:36 BoogieIcfgContainer [2018-11-22 21:34:36,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:34:36,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:34:36,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:34:36,480 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:34:36,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:34:18" (3/4) ... [2018-11-22 21:34:36,483 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 21:34:36,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 21:34:36,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 21:34:36,494 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-22 21:34:36,494 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-22 21:34:36,494 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 21:34:36,547 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_cc95cbd2-ec15-451c-960f-e0ba297c70b7/bin-2019/uautomizer/witness.graphml [2018-11-22 21:34:36,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:34:36,548 INFO L168 Benchmark]: Toolchain (without parser) took 18806.70 ms. Allocated memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: 2.1 GB). Free memory was 959.3 MB in the beginning and 685.7 MB in the end (delta: 273.6 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-22 21:34:36,549 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:34:36,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 199.40 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:34:36,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.23 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:34:36,550 INFO L168 Benchmark]: Boogie Preprocessor took 20.85 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:34:36,550 INFO L168 Benchmark]: RCFGBuilder took 292.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:34:36,550 INFO L168 Benchmark]: TraceAbstraction took 18206.52 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.1 GB in the beginning and 686.3 MB in the end (delta: 434.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. [2018-11-22 21:34:36,551 INFO L168 Benchmark]: Witness Printer took 67.91 ms. Allocated memory is still 3.2 GB. Free memory was 686.3 MB in the beginning and 685.7 MB in the end (delta: 655.0 kB). Peak memory consumption was 655.0 kB. Max. memory is 11.5 GB. [2018-11-22 21:34:36,552 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 199.40 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.23 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.85 ms. Allocated memory is still 1.0 GB. Free memory was 945.8 MB in the beginning and 943.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 292.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 943.1 MB in the beginning and 1.1 GB in the end (delta: -177.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18206.52 ms. Allocated memory was 1.2 GB in the beginning and 3.2 GB in the end (delta: 2.0 GB). Free memory was 1.1 GB in the beginning and 686.3 MB in the end (delta: 434.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 11.5 GB. * Witness Printer took 67.91 ms. Allocated memory is still 3.2 GB. Free memory was 686.3 MB in the beginning and 685.7 MB in the end (delta: 655.0 kB). Peak memory consumption was 655.0 kB. 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, 50 locations, 1 error locations. SAFE Result, 18.1s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3416 SDtfs, 1682 SDslu, 2343 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=106504occurred 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: 8.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 16420 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.6s InterpolantComputationTime, 938 NumberOfCodeBlocks, 938 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 904 ConstructedInterpolants, 0 QuantifiedInterpolants, 49976 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...