./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/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 c5a3d22d49117f02662b197492bc1b16616a2878 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 22:47:21,082 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:47:21,083 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:47:21,089 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:47:21,089 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:47:21,090 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:47:21,090 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:47:21,091 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:47:21,092 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:47:21,092 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:47:21,093 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:47:21,093 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:47:21,093 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:47:21,094 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:47:21,095 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:47:21,095 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:47:21,095 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:47:21,096 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:47:21,097 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:47:21,098 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:47:21,099 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:47:21,099 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:47:21,100 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:47:21,101 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:47:21,101 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:47:21,101 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:47:21,102 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:47:21,102 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:47:21,103 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:47:21,103 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:47:21,103 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:47:21,104 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:47:21,104 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:47:21,104 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:47:21,104 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:47:21,105 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:47:21,105 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-01 22:47:21,112 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:47:21,112 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:47:21,113 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 22:47:21,113 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 22:47:21,113 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 22:47:21,113 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 22:47:21,113 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 22:47:21,113 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:47:21,113 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:47:21,114 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:47:21,114 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:47:21,114 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:47:21,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 22:47:21,114 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 22:47:21,114 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 22:47:21,114 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:47:21,114 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:47:21,114 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 22:47:21,114 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 22:47:21,115 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:47:21,115 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:47:21,115 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 22:47:21,115 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 22:47:21,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 22:47:21,115 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:47:21,115 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 22:47:21,115 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 22:47:21,115 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 22:47:21,115 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 22:47:21,115 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 22:47:21,116 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_4bae4a15-360c-4072-bc41-59188b330f49/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-12-01 22:47:21,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:47:21,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:47:21,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:47:21,146 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:47:21,147 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:47:21,147 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 22:47:21,190 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/bin-2019/uautomizer/data/b06ca473e/24e1e7e8beaf4d2c8d24dabc2ac23ff4/FLAGc94ec7f25 [2018-12-01 22:47:21,613 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:47:21,614 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 22:47:21,618 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/bin-2019/uautomizer/data/b06ca473e/24e1e7e8beaf4d2c8d24dabc2ac23ff4/FLAGc94ec7f25 [2018-12-01 22:47:21,626 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/bin-2019/uautomizer/data/b06ca473e/24e1e7e8beaf4d2c8d24dabc2ac23ff4 [2018-12-01 22:47:21,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:47:21,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:47:21,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:47:21,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:47:21,631 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:47:21,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:47:21" (1/1) ... [2018-12-01 22:47:21,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1782ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21, skipping insertion in model container [2018-12-01 22:47:21,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:47:21" (1/1) ... [2018-12-01 22:47:21,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:47:21,649 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:47:21,746 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:47:21,748 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:47:21,766 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:47:21,774 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:47:21,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21 WrapperNode [2018-12-01 22:47:21,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:47:21,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:47:21,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:47:21,775 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:47:21,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21" (1/1) ... [2018-12-01 22:47:21,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21" (1/1) ... [2018-12-01 22:47:21,787 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:47:21,787 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:47:21,787 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:47:21,787 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:47:21,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21" (1/1) ... [2018-12-01 22:47:21,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21" (1/1) ... [2018-12-01 22:47:21,793 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21" (1/1) ... [2018-12-01 22:47:21,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21" (1/1) ... [2018-12-01 22:47:21,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21" (1/1) ... [2018-12-01 22:47:21,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21" (1/1) ... [2018-12-01 22:47:21,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21" (1/1) ... [2018-12-01 22:47:21,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:47:21,832 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:47:21,832 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:47:21,832 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:47:21,833 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/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-12-01 22:47:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-01 22:47:21,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-01 22:47:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:47:21,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:47:21,865 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-01 22:47:21,865 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-01 22:47:22,036 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:47:22,037 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-01 22:47:22,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:47:22 BoogieIcfgContainer [2018-12-01 22:47:22,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:47:22,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 22:47:22,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 22:47:22,039 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 22:47:22,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 10:47:21" (1/3) ... [2018-12-01 22:47:22,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445ad418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:47:22, skipping insertion in model container [2018-12-01 22:47:22,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:47:21" (2/3) ... [2018-12-01 22:47:22,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445ad418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:47:22, skipping insertion in model container [2018-12-01 22:47:22,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:47:22" (3/3) ... [2018-12-01 22:47:22,041 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-01 22:47:22,047 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 22:47:22,052 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-01 22:47:22,066 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-01 22:47:22,091 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 22:47:22,091 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 22:47:22,091 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 22:47:22,092 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 22:47:22,092 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:47:22,092 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:47:22,092 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 22:47:22,092 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:47:22,092 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 22:47:22,103 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-12-01 22:47:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 22:47:22,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,107 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-12-01 22:47:22,108 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2018-12-01 22:47:22,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,235 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-12-01 22:47:22,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,263 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2018-12-01 22:47:22,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-01 22:47:22,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,270 INFO L225 Difference]: With dead ends: 111 [2018-12-01 22:47:22,270 INFO L226 Difference]: Without dead ends: 96 [2018-12-01 22:47:22,272 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-12-01 22:47:22,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-01 22:47:22,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2018-12-01 22:47:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-01 22:47:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2018-12-01 22:47:22,297 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2018-12-01 22:47:22,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,297 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2018-12-01 22:47:22,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2018-12-01 22:47:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-01 22:47:22,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,298 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-12-01 22:47:22,298 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,298 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2018-12-01 22:47:22,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,335 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2018-12-01 22:47:22,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,354 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2018-12-01 22:47:22,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-01 22:47:22,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,355 INFO L225 Difference]: With dead ends: 157 [2018-12-01 22:47:22,355 INFO L226 Difference]: Without dead ends: 96 [2018-12-01 22:47:22,356 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-12-01 22:47:22,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-01 22:47:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-12-01 22:47:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-01 22:47:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2018-12-01 22:47:22,361 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2018-12-01 22:47:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,362 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2018-12-01 22:47:22,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2018-12-01 22:47:22,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 22:47:22,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,362 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-12-01 22:47:22,362 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,363 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2018-12-01 22:47:22,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,385 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2018-12-01 22:47:22,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,395 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2018-12-01 22:47:22,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 22:47:22,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,396 INFO L225 Difference]: With dead ends: 144 [2018-12-01 22:47:22,396 INFO L226 Difference]: Without dead ends: 99 [2018-12-01 22:47:22,397 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-12-01 22:47:22,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-01 22:47:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-12-01 22:47:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-01 22:47:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2018-12-01 22:47:22,401 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2018-12-01 22:47:22,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,401 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2018-12-01 22:47:22,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2018-12-01 22:47:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 22:47:22,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,402 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-12-01 22:47:22,402 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2018-12-01 22:47:22,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,425 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,425 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2018-12-01 22:47:22,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,437 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2018-12-01 22:47:22,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 22:47:22,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,438 INFO L225 Difference]: With dead ends: 184 [2018-12-01 22:47:22,438 INFO L226 Difference]: Without dead ends: 182 [2018-12-01 22:47:22,438 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-12-01 22:47:22,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-01 22:47:22,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2018-12-01 22:47:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-01 22:47:22,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2018-12-01 22:47:22,443 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2018-12-01 22:47:22,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,444 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2018-12-01 22:47:22,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2018-12-01 22:47:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-01 22:47:22,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,444 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-12-01 22:47:22,444 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2018-12-01 22:47:22,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,465 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2018-12-01 22:47:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,478 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2018-12-01 22:47:22,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,478 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-01 22:47:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,479 INFO L225 Difference]: With dead ends: 304 [2018-12-01 22:47:22,479 INFO L226 Difference]: Without dead ends: 184 [2018-12-01 22:47:22,480 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-12-01 22:47:22,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-01 22:47:22,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-12-01 22:47:22,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-01 22:47:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2018-12-01 22:47:22,485 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2018-12-01 22:47:22,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,486 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2018-12-01 22:47:22,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2018-12-01 22:47:22,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 22:47:22,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,486 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-12-01 22:47:22,486 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2018-12-01 22:47:22,487 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,509 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2018-12-01 22:47:22,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,522 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2018-12-01 22:47:22,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 22:47:22,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,523 INFO L225 Difference]: With dead ends: 273 [2018-12-01 22:47:22,523 INFO L226 Difference]: Without dead ends: 186 [2018-12-01 22:47:22,524 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-12-01 22:47:22,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-01 22:47:22,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-12-01 22:47:22,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-01 22:47:22,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2018-12-01 22:47:22,531 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2018-12-01 22:47:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,531 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2018-12-01 22:47:22,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2018-12-01 22:47:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 22:47:22,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,532 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-12-01 22:47:22,533 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2018-12-01 22:47:22,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,554 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2018-12-01 22:47:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,567 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2018-12-01 22:47:22,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 22:47:22,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,569 INFO L225 Difference]: With dead ends: 348 [2018-12-01 22:47:22,569 INFO L226 Difference]: Without dead ends: 346 [2018-12-01 22:47:22,570 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-12-01 22:47:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-12-01 22:47:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2018-12-01 22:47:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-01 22:47:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2018-12-01 22:47:22,579 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2018-12-01 22:47:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,580 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2018-12-01 22:47:22,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2018-12-01 22:47:22,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-01 22:47:22,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,581 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-12-01 22:47:22,581 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,582 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2018-12-01 22:47:22,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,599 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2018-12-01 22:47:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,619 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2018-12-01 22:47:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-01 22:47:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,621 INFO L225 Difference]: With dead ends: 592 [2018-12-01 22:47:22,621 INFO L226 Difference]: Without dead ends: 354 [2018-12-01 22:47:22,622 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-12-01 22:47:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-01 22:47:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-12-01 22:47:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-12-01 22:47:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2018-12-01 22:47:22,630 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2018-12-01 22:47:22,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,630 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2018-12-01 22:47:22,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2018-12-01 22:47:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 22:47:22,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,631 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-12-01 22:47:22,631 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2018-12-01 22:47:22,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,653 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2018-12-01 22:47:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,671 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2018-12-01 22:47:22,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,672 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 22:47:22,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,673 INFO L225 Difference]: With dead ends: 528 [2018-12-01 22:47:22,673 INFO L226 Difference]: Without dead ends: 358 [2018-12-01 22:47:22,674 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-12-01 22:47:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-12-01 22:47:22,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-12-01 22:47:22,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-01 22:47:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2018-12-01 22:47:22,685 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2018-12-01 22:47:22,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,685 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2018-12-01 22:47:22,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,685 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2018-12-01 22:47:22,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 22:47:22,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,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, 1, 1, 1, 1] [2018-12-01 22:47:22,687 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2018-12-01 22:47:22,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,707 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2018-12-01 22:47:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,724 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2018-12-01 22:47:22,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 22:47:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,727 INFO L225 Difference]: With dead ends: 668 [2018-12-01 22:47:22,727 INFO L226 Difference]: Without dead ends: 666 [2018-12-01 22:47:22,727 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-12-01 22:47:22,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-12-01 22:47:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2018-12-01 22:47:22,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-12-01 22:47:22,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2018-12-01 22:47:22,742 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2018-12-01 22:47:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,743 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2018-12-01 22:47:22,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2018-12-01 22:47:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-01 22:47:22,744 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,744 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-12-01 22:47:22,744 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2018-12-01 22:47:22,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,766 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2018-12-01 22:47:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,788 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2018-12-01 22:47:22,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-01 22:47:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,791 INFO L225 Difference]: With dead ends: 1164 [2018-12-01 22:47:22,791 INFO L226 Difference]: Without dead ends: 690 [2018-12-01 22:47:22,792 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-12-01 22:47:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-12-01 22:47:22,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2018-12-01 22:47:22,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-12-01 22:47:22,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2018-12-01 22:47:22,804 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2018-12-01 22:47:22,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,804 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2018-12-01 22:47:22,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,804 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2018-12-01 22:47:22,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 22:47:22,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,805 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-12-01 22:47:22,806 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2018-12-01 22:47:22,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,819 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2018-12-01 22:47:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,835 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2018-12-01 22:47:22,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 22:47:22,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,837 INFO L225 Difference]: With dead ends: 1032 [2018-12-01 22:47:22,837 INFO L226 Difference]: Without dead ends: 698 [2018-12-01 22:47:22,837 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-12-01 22:47:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-12-01 22:47:22,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-12-01 22:47:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-12-01 22:47:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2018-12-01 22:47:22,850 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2018-12-01 22:47:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,850 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2018-12-01 22:47:22,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2018-12-01 22:47:22,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 22:47:22,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,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, 1] [2018-12-01 22:47:22,851 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,852 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2018-12-01 22:47:22,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47: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-12-01 22:47:22,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,868 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2018-12-01 22:47:22,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,890 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2018-12-01 22:47:22,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 22:47:22,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,894 INFO L225 Difference]: With dead ends: 1292 [2018-12-01 22:47:22,894 INFO L226 Difference]: Without dead ends: 1290 [2018-12-01 22:47:22,895 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-12-01 22:47:22,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-12-01 22:47:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2018-12-01 22:47:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-12-01 22:47:22,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2018-12-01 22:47:22,920 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2018-12-01 22:47:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:22,921 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2018-12-01 22:47:22,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:22,921 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2018-12-01 22:47:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-01 22:47:22,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:22,922 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-12-01 22:47:22,922 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:22,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:22,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2018-12-01 22:47:22,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:22,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:22,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:22,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:22,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:22,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:22,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:22,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:22,937 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2018-12-01 22:47:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:22,973 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2018-12-01 22:47:22,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:22,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-01 22:47:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:22,978 INFO L225 Difference]: With dead ends: 2300 [2018-12-01 22:47:22,978 INFO L226 Difference]: Without dead ends: 1354 [2018-12-01 22:47:22,979 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-12-01 22:47:22,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-12-01 22:47:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-12-01 22:47:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-01 22:47:23,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2018-12-01 22:47:23,016 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2018-12-01 22:47:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:23,016 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2018-12-01 22:47:23,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2018-12-01 22:47:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 22:47:23,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:23,018 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-12-01 22:47:23,018 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:23,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:23,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2018-12-01 22:47:23,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:23,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:23,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:23,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:23,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:23,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:23,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:23,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:23,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:23,037 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2018-12-01 22:47:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:23,068 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2018-12-01 22:47:23,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:23,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 22:47:23,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:23,072 INFO L225 Difference]: With dead ends: 2028 [2018-12-01 22:47:23,072 INFO L226 Difference]: Without dead ends: 1370 [2018-12-01 22:47:23,073 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-12-01 22:47:23,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-12-01 22:47:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2018-12-01 22:47:23,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-12-01 22:47:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2018-12-01 22:47:23,097 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2018-12-01 22:47:23,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:23,097 INFO L480 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2018-12-01 22:47:23,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2018-12-01 22:47:23,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 22:47:23,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:23,098 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-12-01 22:47:23,099 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:23,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:23,099 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2018-12-01 22:47:23,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:23,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:23,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:23,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:23,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:23,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:23,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:23,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:23,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:23,113 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2018-12-01 22:47:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:23,142 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2018-12-01 22:47:23,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:23,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 22:47:23,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:23,147 INFO L225 Difference]: With dead ends: 2508 [2018-12-01 22:47:23,147 INFO L226 Difference]: Without dead ends: 2506 [2018-12-01 22:47:23,148 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-12-01 22:47:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-12-01 22:47:23,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2018-12-01 22:47:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-12-01 22:47:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2018-12-01 22:47:23,183 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2018-12-01 22:47:23,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:23,183 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2018-12-01 22:47:23,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:23,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2018-12-01 22:47:23,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-01 22:47:23,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:23,185 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-12-01 22:47:23,185 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:23,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:23,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2018-12-01 22:47:23,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:23,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:23,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:23,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:23,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:23,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:23,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:23,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:23,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:23,201 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2018-12-01 22:47:23,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:23,235 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2018-12-01 22:47:23,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:23,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-01 22:47:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:23,240 INFO L225 Difference]: With dead ends: 4556 [2018-12-01 22:47:23,240 INFO L226 Difference]: Without dead ends: 2666 [2018-12-01 22:47:23,242 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-12-01 22:47:23,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-12-01 22:47:23,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2018-12-01 22:47:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2018-12-01 22:47:23,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2018-12-01 22:47:23,311 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2018-12-01 22:47:23,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:23,312 INFO L480 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2018-12-01 22:47:23,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:23,312 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2018-12-01 22:47:23,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 22:47:23,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:23,314 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-12-01 22:47:23,314 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:23,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:23,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2018-12-01 22:47:23,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:23,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:23,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:23,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:23,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:23,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:23,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:23,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:23,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:23,327 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2018-12-01 22:47:23,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:23,364 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2018-12-01 22:47:23,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:23,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-01 22:47:23,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:23,369 INFO L225 Difference]: With dead ends: 3996 [2018-12-01 22:47:23,369 INFO L226 Difference]: Without dead ends: 2698 [2018-12-01 22:47:23,371 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-12-01 22:47:23,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-12-01 22:47:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2018-12-01 22:47:23,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-12-01 22:47:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2018-12-01 22:47:23,412 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2018-12-01 22:47:23,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:23,412 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2018-12-01 22:47:23,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2018-12-01 22:47:23,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 22:47:23,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:23,414 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-12-01 22:47:23,414 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:23,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:23,414 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2018-12-01 22:47:23,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:23,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:23,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:23,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:23,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-12-01 22:47:23,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:23,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:23,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:23,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:23,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:23,428 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2018-12-01 22:47:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:23,466 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2018-12-01 22:47:23,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:23,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-01 22:47:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:23,475 INFO L225 Difference]: With dead ends: 4876 [2018-12-01 22:47:23,475 INFO L226 Difference]: Without dead ends: 4874 [2018-12-01 22:47:23,476 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-12-01 22:47:23,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-12-01 22:47:23,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2018-12-01 22:47:23,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2018-12-01 22:47:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2018-12-01 22:47:23,532 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2018-12-01 22:47:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:23,533 INFO L480 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2018-12-01 22:47:23,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2018-12-01 22:47:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-01 22:47:23,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:23,535 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-12-01 22:47:23,535 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:23,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:23,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2018-12-01 22:47:23,536 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:23,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:23,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:23,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:23,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:23,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:23,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:23,549 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2018-12-01 22:47:23,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:23,596 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2018-12-01 22:47:23,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:23,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-01 22:47:23,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:23,605 INFO L225 Difference]: With dead ends: 9036 [2018-12-01 22:47:23,605 INFO L226 Difference]: Without dead ends: 5258 [2018-12-01 22:47:23,608 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-12-01 22:47:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-12-01 22:47:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2018-12-01 22:47:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2018-12-01 22:47:23,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2018-12-01 22:47:23,683 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2018-12-01 22:47:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:23,683 INFO L480 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2018-12-01 22:47:23,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2018-12-01 22:47:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 22:47:23,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:23,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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:47:23,686 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:23,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:23,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2018-12-01 22:47:23,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:23,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:23,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:23,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:23,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:23,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:23,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:23,696 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2018-12-01 22:47:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:23,755 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2018-12-01 22:47:23,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:23,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-01 22:47:23,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:23,764 INFO L225 Difference]: With dead ends: 7884 [2018-12-01 22:47:23,765 INFO L226 Difference]: Without dead ends: 5322 [2018-12-01 22:47:23,769 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-12-01 22:47:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2018-12-01 22:47:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2018-12-01 22:47:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2018-12-01 22:47:23,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2018-12-01 22:47:23,836 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2018-12-01 22:47:23,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:23,836 INFO L480 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2018-12-01 22:47:23,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2018-12-01 22:47:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 22:47:23,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:23,838 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-12-01 22:47:23,838 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:23,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:23,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2018-12-01 22:47:23,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:23,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:23,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:23,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:23,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:23,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:23,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:23,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:23,853 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2018-12-01 22:47:23,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:23,973 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2018-12-01 22:47:23,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:23,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-01 22:47:23,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:23,986 INFO L225 Difference]: With dead ends: 15564 [2018-12-01 22:47:23,986 INFO L226 Difference]: Without dead ends: 10378 [2018-12-01 22:47:23,993 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-12-01 22:47:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2018-12-01 22:47:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2018-12-01 22:47:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-12-01 22:47:24,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2018-12-01 22:47:24,138 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2018-12-01 22:47:24,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:24,138 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2018-12-01 22:47:24,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2018-12-01 22:47:24,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-01 22:47:24,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:24,143 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-12-01 22:47:24,143 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:24,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:24,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2018-12-01 22:47:24,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:24,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:24,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:24,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:24,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:24,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:24,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:24,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:24,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:24,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:24,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:24,154 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2018-12-01 22:47:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:24,270 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2018-12-01 22:47:24,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:24,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-01 22:47:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:24,283 INFO L225 Difference]: With dead ends: 12172 [2018-12-01 22:47:24,283 INFO L226 Difference]: Without dead ends: 12170 [2018-12-01 22:47:24,285 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-12-01 22:47:24,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-12-01 22:47:24,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2018-12-01 22:47:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-12-01 22:47:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2018-12-01 22:47:24,402 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2018-12-01 22:47:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:24,402 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2018-12-01 22:47:24,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2018-12-01 22:47:24,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 22:47:24,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:24,408 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-12-01 22:47:24,408 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:24,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:24,408 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2018-12-01 22:47:24,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:24,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:24,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:24,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:24,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:24,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:24,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:24,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:24,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:24,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:24,419 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2018-12-01 22:47:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:24,519 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2018-12-01 22:47:24,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:24,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-01 22:47:24,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:24,536 INFO L225 Difference]: With dead ends: 18316 [2018-12-01 22:47:24,536 INFO L226 Difference]: Without dead ends: 18314 [2018-12-01 22:47:24,540 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-12-01 22:47:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2018-12-01 22:47:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2018-12-01 22:47:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2018-12-01 22:47:24,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2018-12-01 22:47:24,712 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2018-12-01 22:47:24,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:24,712 INFO L480 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2018-12-01 22:47:24,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2018-12-01 22:47:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-01 22:47:24,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:24,721 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-12-01 22:47:24,721 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:24,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:24,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2018-12-01 22:47:24,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:24,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:24,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:24,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:24,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:24,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:24,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:24,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:24,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:24,737 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2018-12-01 22:47:24,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:24,886 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2018-12-01 22:47:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:24,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-01 22:47:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:24,902 INFO L225 Difference]: With dead ends: 35468 [2018-12-01 22:47:24,902 INFO L226 Difference]: Without dead ends: 20362 [2018-12-01 22:47:24,914 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-12-01 22:47:24,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2018-12-01 22:47:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2018-12-01 22:47:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2018-12-01 22:47:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2018-12-01 22:47:25,120 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2018-12-01 22:47:25,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:25,121 INFO L480 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2018-12-01 22:47:25,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2018-12-01 22:47:25,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 22:47:25,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:25,127 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-12-01 22:47:25,127 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:25,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2018-12-01 22:47:25,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:25,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:25,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:25,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:25,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:25,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:25,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:25,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:25,146 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2018-12-01 22:47:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:25,278 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2018-12-01 22:47:25,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:25,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-01 22:47:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:25,293 INFO L225 Difference]: With dead ends: 30732 [2018-12-01 22:47:25,293 INFO L226 Difference]: Without dead ends: 20746 [2018-12-01 22:47:25,301 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-12-01 22:47:25,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2018-12-01 22:47:25,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2018-12-01 22:47:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2018-12-01 22:47:25,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2018-12-01 22:47:25,535 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2018-12-01 22:47:25,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:25,535 INFO L480 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2018-12-01 22:47:25,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2018-12-01 22:47:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 22:47:25,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:25,541 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-12-01 22:47:25,541 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:25,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:25,541 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2018-12-01 22:47:25,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:25,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:25,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:25,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:25,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:25,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:25,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:25,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:25,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:25,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:25,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:25,564 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2018-12-01 22:47:25,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:25,784 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2018-12-01 22:47:25,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:25,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-01 22:47:25,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:25,814 INFO L225 Difference]: With dead ends: 35852 [2018-12-01 22:47:25,814 INFO L226 Difference]: Without dead ends: 35850 [2018-12-01 22:47:25,820 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-12-01 22:47:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2018-12-01 22:47:26,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2018-12-01 22:47:26,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2018-12-01 22:47:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2018-12-01 22:47:26,228 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2018-12-01 22:47:26,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:26,229 INFO L480 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2018-12-01 22:47:26,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2018-12-01 22:47:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-01 22:47:26,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:26,239 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-12-01 22:47:26,239 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:26,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2018-12-01 22:47:26,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:26,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:26,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:26,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:26,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:26,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:26,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:26,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:26,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:26,250 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2018-12-01 22:47:26,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:26,530 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2018-12-01 22:47:26,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:26,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-01 22:47:26,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:26,561 INFO L225 Difference]: With dead ends: 70668 [2018-12-01 22:47:26,561 INFO L226 Difference]: Without dead ends: 40458 [2018-12-01 22:47:26,584 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-12-01 22:47:26,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2018-12-01 22:47:27,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2018-12-01 22:47:27,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2018-12-01 22:47:27,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2018-12-01 22:47:27,089 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2018-12-01 22:47:27,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:27,089 INFO L480 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2018-12-01 22:47:27,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:27,089 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2018-12-01 22:47:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 22:47:27,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:27,099 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, 1] [2018-12-01 22:47:27,100 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:27,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:27,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2018-12-01 22:47:27,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:27,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:27,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:27,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:27,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:27,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:27,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:27,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:27,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:27,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:27,113 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2018-12-01 22:47:27,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:27,395 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2018-12-01 22:47:27,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:27,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-01 22:47:27,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:27,422 INFO L225 Difference]: With dead ends: 60684 [2018-12-01 22:47:27,422 INFO L226 Difference]: Without dead ends: 40970 [2018-12-01 22:47:27,436 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-12-01 22:47:27,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2018-12-01 22:47:27,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2018-12-01 22:47:27,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2018-12-01 22:47:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2018-12-01 22:47:27,870 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2018-12-01 22:47:27,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:27,870 INFO L480 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2018-12-01 22:47:27,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:27,870 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2018-12-01 22:47:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 22:47:27,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:27,885 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, 1] [2018-12-01 22:47:27,885 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:27,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:27,885 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2018-12-01 22:47:27,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:27,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:27,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:27,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:27,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:27,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:27,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:27,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:27,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:27,897 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2018-12-01 22:47:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:28,513 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2018-12-01 22:47:28,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:28,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-01 22:47:28,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:28,551 INFO L225 Difference]: With dead ends: 69644 [2018-12-01 22:47:28,552 INFO L226 Difference]: Without dead ends: 69642 [2018-12-01 22:47:28,559 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-12-01 22:47:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2018-12-01 22:47:29,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2018-12-01 22:47:29,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2018-12-01 22:47:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2018-12-01 22:47:29,154 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2018-12-01 22:47:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:29,154 INFO L480 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2018-12-01 22:47:29,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2018-12-01 22:47:29,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-01 22:47:29,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:29,176 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, 1] [2018-12-01 22:47:29,176 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:29,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:29,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2018-12-01 22:47:29,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:29,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:29,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:29,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:29,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:29,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-12-01 22:47:29,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:29,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:29,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:29,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:29,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:29,191 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2018-12-01 22:47:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:29,881 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2018-12-01 22:47:29,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:29,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-01 22:47:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:29,932 INFO L225 Difference]: With dead ends: 140300 [2018-12-01 22:47:29,933 INFO L226 Difference]: Without dead ends: 79882 [2018-12-01 22:47:29,963 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-12-01 22:47:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2018-12-01 22:47:30,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2018-12-01 22:47:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2018-12-01 22:47:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2018-12-01 22:47:30,863 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2018-12-01 22:47:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:30,863 INFO L480 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2018-12-01 22:47:30,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2018-12-01 22:47:30,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 22:47:30,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:30,893 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, 1, 1] [2018-12-01 22:47:30,893 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:30,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:30,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2018-12-01 22:47:30,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:30,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:30,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:30,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:30,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:30,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:30,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:30,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:30,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:30,917 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2018-12-01 22:47:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:31,608 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2018-12-01 22:47:31,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:31,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-01 22:47:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:31,660 INFO L225 Difference]: With dead ends: 119820 [2018-12-01 22:47:31,660 INFO L226 Difference]: Without dead ends: 80906 [2018-12-01 22:47:31,680 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-12-01 22:47:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2018-12-01 22:47:32,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2018-12-01 22:47:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2018-12-01 22:47:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2018-12-01 22:47:32,589 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2018-12-01 22:47:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:32,589 INFO L480 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2018-12-01 22:47:32,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2018-12-01 22:47:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 22:47:32,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:32,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, 1, 1, 1] [2018-12-01 22:47:32,692 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:32,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:32,692 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2018-12-01 22:47:32,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:32,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:32,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:32,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:32,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:32,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:32,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:32,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:32,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:32,703 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2018-12-01 22:47:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:33,685 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2018-12-01 22:47:33,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:33,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-01 22:47:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:33,785 INFO L225 Difference]: With dead ends: 135180 [2018-12-01 22:47:33,785 INFO L226 Difference]: Without dead ends: 135178 [2018-12-01 22:47:33,812 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-12-01 22:47:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2018-12-01 22:47:35,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2018-12-01 22:47:35,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2018-12-01 22:47:35,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2018-12-01 22:47:35,271 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2018-12-01 22:47:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:35,271 INFO L480 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2018-12-01 22:47:35,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2018-12-01 22:47:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-01 22:47:35,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:35,319 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, 1, 1] [2018-12-01 22:47:35,319 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:35,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:35,319 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2018-12-01 22:47:35,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:35,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:35,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:35,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:35,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:35,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:35,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:35,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:35,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:35,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:35,328 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2018-12-01 22:47:36,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:36,676 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2018-12-01 22:47:36,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:36,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-01 22:47:36,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:36,797 INFO L225 Difference]: With dead ends: 278540 [2018-12-01 22:47:36,797 INFO L226 Difference]: Without dead ends: 157706 [2018-12-01 22:47:36,869 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-12-01 22:47:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2018-12-01 22:47:38,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2018-12-01 22:47:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2018-12-01 22:47:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2018-12-01 22:47:38,877 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2018-12-01 22:47:38,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:38,878 INFO L480 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2018-12-01 22:47:38,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2018-12-01 22:47:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 22:47:38,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:38,928 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, 1, 1, 1] [2018-12-01 22:47:38,928 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:38,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:38,928 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2018-12-01 22:47:38,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:38,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:38,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:38,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:38,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:38,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:38,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:38,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:38,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:38,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:38,940 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2018-12-01 22:47:40,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:40,287 INFO L93 Difference]: Finished difference Result 236556 states and 287752 transitions. [2018-12-01 22:47:40,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:40,288 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-01 22:47:40,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:40,441 INFO L225 Difference]: With dead ends: 236556 [2018-12-01 22:47:40,441 INFO L226 Difference]: Without dead ends: 159754 [2018-12-01 22:47:40,508 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-12-01 22:47:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states. [2018-12-01 22:47:42,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159754 to 159752. [2018-12-01 22:47:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159752 states. [2018-12-01 22:47:42,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159752 states to 159752 states and 192518 transitions. [2018-12-01 22:47:42,587 INFO L78 Accepts]: Start accepts. Automaton has 159752 states and 192518 transitions. Word has length 36 [2018-12-01 22:47:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:42,588 INFO L480 AbstractCegarLoop]: Abstraction has 159752 states and 192518 transitions. [2018-12-01 22:47:42,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 159752 states and 192518 transitions. [2018-12-01 22:47:42,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 22:47:42,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:42,638 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, 1, 1, 1] [2018-12-01 22:47:42,639 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:42,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:42,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1988785543, now seen corresponding path program 1 times [2018-12-01 22:47:42,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:42,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:42,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:42,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:42,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:42,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:42,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:42,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:42,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:42,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:42,651 INFO L87 Difference]: Start difference. First operand 159752 states and 192518 transitions. Second operand 3 states. [2018-12-01 22:47:44,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:44,926 INFO L93 Difference]: Finished difference Result 262156 states and 317448 transitions. [2018-12-01 22:47:44,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:44,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-01 22:47:44,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:45,120 INFO L225 Difference]: With dead ends: 262156 [2018-12-01 22:47:45,120 INFO L226 Difference]: Without dead ends: 262154 [2018-12-01 22:47:45,149 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-12-01 22:47:45,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262154 states. [2018-12-01 22:47:47,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262154 to 245768. [2018-12-01 22:47:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245768 states. [2018-12-01 22:47:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245768 states to 245768 states and 288774 transitions. [2018-12-01 22:47:49,379 INFO L78 Accepts]: Start accepts. Automaton has 245768 states and 288774 transitions. Word has length 36 [2018-12-01 22:47:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:49,379 INFO L480 AbstractCegarLoop]: Abstraction has 245768 states and 288774 transitions. [2018-12-01 22:47:49,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 245768 states and 288774 transitions. [2018-12-01 22:47:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-01 22:47:49,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:49,468 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, 1, 1, 1] [2018-12-01 22:47:49,468 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:49,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash 400437641, now seen corresponding path program 1 times [2018-12-01 22:47:49,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:49,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:49,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:49,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:49,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:49,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:49,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:49,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:49,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:49,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:49,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:49,490 INFO L87 Difference]: Start difference. First operand 245768 states and 288774 transitions. Second operand 3 states. [2018-12-01 22:47:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:52,293 INFO L93 Difference]: Finished difference Result 552972 states and 645128 transitions. [2018-12-01 22:47:52,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:52,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-01 22:47:52,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:47:52,564 INFO L225 Difference]: With dead ends: 552972 [2018-12-01 22:47:52,564 INFO L226 Difference]: Without dead ends: 311306 [2018-12-01 22:47:52,715 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-12-01 22:47:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311306 states. [2018-12-01 22:47:56,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311306 to 311304. [2018-12-01 22:47:56,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311304 states. [2018-12-01 22:47:56,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311304 states to 311304 states and 356358 transitions. [2018-12-01 22:47:56,914 INFO L78 Accepts]: Start accepts. Automaton has 311304 states and 356358 transitions. Word has length 36 [2018-12-01 22:47:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:47:56,914 INFO L480 AbstractCegarLoop]: Abstraction has 311304 states and 356358 transitions. [2018-12-01 22:47:56,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:47:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 311304 states and 356358 transitions. [2018-12-01 22:47:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 22:47:57,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:47:57,207 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, 1, 1, 1, 1] [2018-12-01 22:47:57,207 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:47:57,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:47:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1523025865, now seen corresponding path program 1 times [2018-12-01 22:47:57,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:47:57,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:47:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:57,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:47:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:47:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:47:57,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:47:57,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:47:57,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:47:57,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:47:57,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:47:57,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:47:57,217 INFO L87 Difference]: Start difference. First operand 311304 states and 356358 transitions. Second operand 3 states. [2018-12-01 22:47:59,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:47:59,942 INFO L93 Difference]: Finished difference Result 466956 states and 532488 transitions. [2018-12-01 22:47:59,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:47:59,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-01 22:47:59,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:48:00,232 INFO L225 Difference]: With dead ends: 466956 [2018-12-01 22:48:00,233 INFO L226 Difference]: Without dead ends: 315402 [2018-12-01 22:48:00,359 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-12-01 22:48:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315402 states. [2018-12-01 22:48:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315402 to 315400. [2018-12-01 22:48:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315400 states. [2018-12-01 22:48:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315400 states to 315400 states and 356358 transitions. [2018-12-01 22:48:04,759 INFO L78 Accepts]: Start accepts. Automaton has 315400 states and 356358 transitions. Word has length 37 [2018-12-01 22:48:04,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:48:04,759 INFO L480 AbstractCegarLoop]: Abstraction has 315400 states and 356358 transitions. [2018-12-01 22:48:04,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:48:04,759 INFO L276 IsEmpty]: Start isEmpty. Operand 315400 states and 356358 transitions. [2018-12-01 22:48:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 22:48:05,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:48:05,016 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, 1, 1, 1, 1] [2018-12-01 22:48:05,017 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:48:05,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:48:05,017 INFO L82 PathProgramCache]: Analyzing trace with hash -471118841, now seen corresponding path program 1 times [2018-12-01 22:48:05,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:48:05,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:48:05,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:48:05,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:48:05,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:48:05,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:48:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:48:05,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:48:05,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:48:05,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:48:05,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:48:05,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:48:05,029 INFO L87 Difference]: Start difference. First operand 315400 states and 356358 transitions. Second operand 3 states. [2018-12-01 22:48:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:48:11,098 INFO L93 Difference]: Finished difference Result 507914 states and 569351 transitions. [2018-12-01 22:48:11,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:48:11,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-01 22:48:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:48:11,527 INFO L225 Difference]: With dead ends: 507914 [2018-12-01 22:48:11,527 INFO L226 Difference]: Without dead ends: 507912 [2018-12-01 22:48:11,576 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-12-01 22:48:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507912 states. [2018-12-01 22:48:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507912 to 491528. [2018-12-01 22:48:16,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491528 states. [2018-12-01 22:48:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491528 states to 491528 states and 544774 transitions. [2018-12-01 22:48:17,080 INFO L78 Accepts]: Start accepts. Automaton has 491528 states and 544774 transitions. Word has length 37 [2018-12-01 22:48:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:48:17,080 INFO L480 AbstractCegarLoop]: Abstraction has 491528 states and 544774 transitions. [2018-12-01 22:48:17,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:48:17,080 INFO L276 IsEmpty]: Start isEmpty. Operand 491528 states and 544774 transitions. [2018-12-01 22:48:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-01 22:48:17,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:48:17,296 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, 1, 1, 1, 1] [2018-12-01 22:48:17,296 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:48:17,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:48:17,296 INFO L82 PathProgramCache]: Analyzing trace with hash -2059466743, now seen corresponding path program 1 times [2018-12-01 22:48:17,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 22:48:17,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 22:48:17,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:48:17,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:48:17,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:48:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:48:17,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 22:48:17,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:48:17,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:48:17,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:48:17,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:48:17,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:48:17,320 INFO L87 Difference]: Start difference. First operand 491528 states and 544774 transitions. Second operand 3 states. [2018-12-01 22:48:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:48:23,466 INFO L93 Difference]: Finished difference Result 1097736 states and 1200134 transitions. [2018-12-01 22:48:23,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:48:23,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-01 22:48:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:48:23,467 INFO L225 Difference]: With dead ends: 1097736 [2018-12-01 22:48:23,467 INFO L226 Difference]: Without dead ends: 0 [2018-12-01 22:48:23,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-12-01 22:48:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-01 22:48:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-01 22:48:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-01 22:48:23,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-01 22:48:23,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-12-01 22:48:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:48:23,816 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 22:48:23,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:48:23,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-01 22:48:23,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-01 22:48:23,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-01 22:48:23,908 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-01 22:48:23,908 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-01 22:48:23,908 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-01 22:48:23,909 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,909 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L451 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L444 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-12-01 22:48:23,910 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,911 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,911 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,911 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-12-01 22:48:23,911 INFO L451 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-12-01 22:48:23,911 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,911 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,911 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-12-01 22:48:23,911 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-12-01 22:48:23,911 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-12-01 22:48:23,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 10:48:23 BoogieIcfgContainer [2018-12-01 22:48:23,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 22:48:23,917 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:48:23,917 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:48:23,917 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:48:23,918 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:47:22" (3/4) ... [2018-12-01 22:48:23,921 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-01 22:48:23,927 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-01 22:48:23,927 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-01 22:48:23,932 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-01 22:48:23,932 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-01 22:48:23,932 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-01 22:48:23,979 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4bae4a15-360c-4072-bc41-59188b330f49/bin-2019/uautomizer/witness.graphml [2018-12-01 22:48:23,979 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:48:23,980 INFO L168 Benchmark]: Toolchain (without parser) took 62351.59 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 961.4 MB in the beginning and 4.0 GB in the end (delta: -3.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-01 22:48:23,981 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:48:23,981 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.25 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-01 22:48:23,981 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.46 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 22:48:23,981 INFO L168 Benchmark]: Boogie Preprocessor took 44.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2018-12-01 22:48:23,982 INFO L168 Benchmark]: RCFGBuilder took 204.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-01 22:48:23,982 INFO L168 Benchmark]: TraceAbstraction took 61879.34 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2018-12-01 22:48:23,982 INFO L168 Benchmark]: Witness Printer took 61.91 ms. Allocated memory is still 5.8 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 854.8 kB). Peak memory consumption was 854.8 kB. Max. memory is 11.5 GB. [2018-12-01 22:48:23,983 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 145.25 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.46 ms. Allocated memory is still 1.0 GB. Free memory was 950.6 MB in the beginning and 945.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 204.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61879.34 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.6 GB). Free memory was 1.1 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. * Witness Printer took 61.91 ms. Allocated memory is still 5.8 GB. Free memory was 4.0 GB in the beginning and 4.0 GB in the end (delta: 854.8 kB). Peak memory consumption was 854.8 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. SAFE Result, 61.8s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 30.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4632 SDtfs, 2311 SDslu, 3194 SDs, 0 SdLazy, 213 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491528occurred in iteration=39, 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: 29.0s AutomataMinimizationTime, 40 MinimizatonAttempts, 65580 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1185 ConstructedInterpolants, 0 QuantifiedInterpolants, 74775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...