./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5107685577f81a5867811396b2c0a05eb5630c95 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:28:47,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:28:47,597 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:28:47,604 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:28:47,604 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:28:47,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:28:47,605 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:28:47,606 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:28:47,608 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:28:47,608 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:28:47,609 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:28:47,609 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:28:47,610 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:28:47,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:28:47,612 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:28:47,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:28:47,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:28:47,614 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:28:47,616 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:28:47,617 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:28:47,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:28:47,619 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:28:47,621 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:28:47,621 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:28:47,621 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:28:47,622 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:28:47,623 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:28:47,623 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:28:47,624 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:28:47,624 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:28:47,624 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:28:47,625 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:28:47,625 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:28:47,625 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:28:47,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:28:47,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:28:47,626 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 03:28:47,633 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:28:47,633 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:28:47,633 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:28:47,634 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:28:47,634 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:28:47,634 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:28:47,634 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:28:47,634 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:28:47,634 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:28:47,635 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:28:47,635 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:28:47,635 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:28:47,635 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:28:47,635 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:28:47,635 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:28:47,635 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:28:47,635 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:28:47,635 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:28:47,635 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:28:47,636 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:28:47,636 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:28:47,636 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:28:47,636 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:28:47,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:28:47,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:28:47,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:28:47,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:28:47,636 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:28:47,636 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:28:47,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:28:47,636 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_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5107685577f81a5867811396b2c0a05eb5630c95 [2018-11-23 03:28:47,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:28:47,673 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:28:47,675 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:28:47,676 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:28:47,676 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:28:47,676 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 03:28:47,712 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer/data/bc6868089/289f4fe255844b8fb4cb1ba22c82241e/FLAG710b2af30 [2018-11-23 03:28:48,111 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:28:48,111 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/sv-benchmarks/c/locks/test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 03:28:48,116 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer/data/bc6868089/289f4fe255844b8fb4cb1ba22c82241e/FLAG710b2af30 [2018-11-23 03:28:48,128 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer/data/bc6868089/289f4fe255844b8fb4cb1ba22c82241e [2018-11-23 03:28:48,130 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:28:48,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:28:48,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:28:48,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:28:48,134 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:28:48,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:28:48" (1/1) ... [2018-11-23 03:28:48,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22877cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48, skipping insertion in model container [2018-11-23 03:28:48,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:28:48" (1/1) ... [2018-11-23 03:28:48,143 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:28:48,155 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:28:48,270 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:28:48,272 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:28:48,287 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:28:48,295 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:28:48,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48 WrapperNode [2018-11-23 03:28:48,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:28:48,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:28:48,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:28:48,296 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:28:48,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48" (1/1) ... [2018-11-23 03:28:48,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48" (1/1) ... [2018-11-23 03:28:48,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:28:48,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:28:48,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:28:48,310 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:28:48,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48" (1/1) ... [2018-11-23 03:28:48,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48" (1/1) ... [2018-11-23 03:28:48,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48" (1/1) ... [2018-11-23 03:28:48,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48" (1/1) ... [2018-11-23 03:28:48,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48" (1/1) ... [2018-11-23 03:28:48,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48" (1/1) ... [2018-11-23 03:28:48,361 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48" (1/1) ... [2018-11-23 03:28:48,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:28:48,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:28:48,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:28:48,363 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:28:48,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:28:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:28:48,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:28:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:28:48,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:28:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:28:48,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:28:48,575 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:28:48,576 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 03:28:48,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:28:48 BoogieIcfgContainer [2018-11-23 03:28:48,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:28:48,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:28:48,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:28:48,579 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:28:48,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:28:48" (1/3) ... [2018-11-23 03:28:48,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba37ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:28:48, skipping insertion in model container [2018-11-23 03:28:48,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:28:48" (2/3) ... [2018-11-23 03:28:48,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba37ddd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:28:48, skipping insertion in model container [2018-11-23 03:28:48,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:28:48" (3/3) ... [2018-11-23 03:28:48,582 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_9_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-23 03:28:48,591 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:28:48,597 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:28:48,612 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:28:48,640 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:28:48,640 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:28:48,641 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:28:48,641 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:28:48,641 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:28:48,641 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:28:48,641 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:28:48,641 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:28:48,641 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:28:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 03:28:48,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 03:28:48,661 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:48,662 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:48,664 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:48,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:48,668 INFO L82 PathProgramCache]: Analyzing trace with hash 691982780, now seen corresponding path program 1 times [2018-11-23 03:28:48,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:48,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:48,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:48,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:48,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:48,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:48,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:48,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:48,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:48,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:48,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:48,812 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-11-23 03:28:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:48,847 INFO L93 Difference]: Finished difference Result 81 states and 138 transitions. [2018-11-23 03:28:48,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:48,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 03:28:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:48,856 INFO L225 Difference]: With dead ends: 81 [2018-11-23 03:28:48,856 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 03:28:48,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 03:28:48,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2018-11-23 03:28:48,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 03:28:48,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 81 transitions. [2018-11-23 03:28:48,883 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 81 transitions. Word has length 19 [2018-11-23 03:28:48,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:48,883 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 81 transitions. [2018-11-23 03:28:48,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 81 transitions. [2018-11-23 03:28:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 03:28:48,884 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:48,884 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:48,884 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:48,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:48,885 INFO L82 PathProgramCache]: Analyzing trace with hash 950148218, now seen corresponding path program 1 times [2018-11-23 03:28:48,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:48,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:48,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:48,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:48,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:48,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:48,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:48,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:48,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:48,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:48,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:48,924 INFO L87 Difference]: Start difference. First operand 46 states and 81 transitions. Second operand 3 states. [2018-11-23 03:28:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:48,963 INFO L93 Difference]: Finished difference Result 107 states and 192 transitions. [2018-11-23 03:28:48,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:48,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 03:28:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:48,965 INFO L225 Difference]: With dead ends: 107 [2018-11-23 03:28:48,965 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 03:28:48,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 03:28:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2018-11-23 03:28:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 03:28:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 113 transitions. [2018-11-23 03:28:48,971 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 113 transitions. Word has length 19 [2018-11-23 03:28:48,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:48,971 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 113 transitions. [2018-11-23 03:28:48,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:48,971 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 113 transitions. [2018-11-23 03:28:48,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 03:28:48,972 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:48,972 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] [2018-11-23 03:28:48,972 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:48,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:48,972 INFO L82 PathProgramCache]: Analyzing trace with hash -23156596, now seen corresponding path program 1 times [2018-11-23 03:28:48,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:48,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:48,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:48,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:48,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:48,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,006 INFO L87 Difference]: Start difference. First operand 64 states and 113 transitions. Second operand 3 states. [2018-11-23 03:28:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,032 INFO L93 Difference]: Finished difference Result 99 states and 171 transitions. [2018-11-23 03:28:49,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 03:28:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,033 INFO L225 Difference]: With dead ends: 99 [2018-11-23 03:28:49,033 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 03:28:49,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 03:28:49,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-11-23 03:28:49,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-23 03:28:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 115 transitions. [2018-11-23 03:28:49,040 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 115 transitions. Word has length 20 [2018-11-23 03:28:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,040 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 115 transitions. [2018-11-23 03:28:49,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 115 transitions. [2018-11-23 03:28:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 03:28:49,040 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,041 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] [2018-11-23 03:28:49,041 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,041 INFO L82 PathProgramCache]: Analyzing trace with hash -609962610, now seen corresponding path program 1 times [2018-11-23 03:28:49,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,070 INFO L87 Difference]: Start difference. First operand 67 states and 115 transitions. Second operand 3 states. [2018-11-23 03:28:49,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,084 INFO L93 Difference]: Finished difference Result 124 states and 216 transitions. [2018-11-23 03:28:49,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 03:28:49,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,085 INFO L225 Difference]: With dead ends: 124 [2018-11-23 03:28:49,085 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 03:28:49,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 03:28:49,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 88. [2018-11-23 03:28:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-23 03:28:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 152 transitions. [2018-11-23 03:28:49,094 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 152 transitions. Word has length 20 [2018-11-23 03:28:49,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,094 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 152 transitions. [2018-11-23 03:28:49,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 152 transitions. [2018-11-23 03:28:49,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 03:28:49,095 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,095 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] [2018-11-23 03:28:49,095 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,096 INFO L82 PathProgramCache]: Analyzing trace with hash -351797172, now seen corresponding path program 1 times [2018-11-23 03:28:49,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,120 INFO L87 Difference]: Start difference. First operand 88 states and 152 transitions. Second operand 3 states. [2018-11-23 03:28:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,135 INFO L93 Difference]: Finished difference Result 204 states and 358 transitions. [2018-11-23 03:28:49,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-23 03:28:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,137 INFO L225 Difference]: With dead ends: 204 [2018-11-23 03:28:49,137 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 03:28:49,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 03:28:49,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-23 03:28:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 03:28:49,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 210 transitions. [2018-11-23 03:28:49,145 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 210 transitions. Word has length 20 [2018-11-23 03:28:49,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,146 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 210 transitions. [2018-11-23 03:28:49,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 210 transitions. [2018-11-23 03:28:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 03:28:49,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,147 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] [2018-11-23 03:28:49,147 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1728757681, now seen corresponding path program 1 times [2018-11-23 03:28:49,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,177 INFO L87 Difference]: Start difference. First operand 122 states and 210 transitions. Second operand 3 states. [2018-11-23 03:28:49,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,198 INFO L93 Difference]: Finished difference Result 183 states and 313 transitions. [2018-11-23 03:28:49,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 03:28:49,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,199 INFO L225 Difference]: With dead ends: 183 [2018-11-23 03:28:49,200 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 03:28:49,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 03:28:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-11-23 03:28:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-11-23 03:28:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 210 transitions. [2018-11-23 03:28:49,207 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 210 transitions. Word has length 21 [2018-11-23 03:28:49,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,207 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 210 transitions. [2018-11-23 03:28:49,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 210 transitions. [2018-11-23 03:28:49,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 03:28:49,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,208 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] [2018-11-23 03:28:49,208 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1979403601, now seen corresponding path program 1 times [2018-11-23 03:28:49,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,240 INFO L87 Difference]: Start difference. First operand 124 states and 210 transitions. Second operand 3 states. [2018-11-23 03:28:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,254 INFO L93 Difference]: Finished difference Result 228 states and 392 transitions. [2018-11-23 03:28:49,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 03:28:49,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,256 INFO L225 Difference]: With dead ends: 228 [2018-11-23 03:28:49,256 INFO L226 Difference]: Without dead ends: 226 [2018-11-23 03:28:49,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-23 03:28:49,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 168. [2018-11-23 03:28:49,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-11-23 03:28:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 282 transitions. [2018-11-23 03:28:49,267 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 282 transitions. Word has length 21 [2018-11-23 03:28:49,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,268 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 282 transitions. [2018-11-23 03:28:49,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 282 transitions. [2018-11-23 03:28:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 03:28:49,269 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,269 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] [2018-11-23 03:28:49,269 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2057398257, now seen corresponding path program 1 times [2018-11-23 03:28:49,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,293 INFO L87 Difference]: Start difference. First operand 168 states and 282 transitions. Second operand 3 states. [2018-11-23 03:28:49,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,320 INFO L93 Difference]: Finished difference Result 392 states and 664 transitions. [2018-11-23 03:28:49,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 03:28:49,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,322 INFO L225 Difference]: With dead ends: 392 [2018-11-23 03:28:49,322 INFO L226 Difference]: Without dead ends: 234 [2018-11-23 03:28:49,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-23 03:28:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-11-23 03:28:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-11-23 03:28:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 386 transitions. [2018-11-23 03:28:49,334 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 386 transitions. Word has length 21 [2018-11-23 03:28:49,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,334 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 386 transitions. [2018-11-23 03:28:49,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 386 transitions. [2018-11-23 03:28:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 03:28:49,335 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,335 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:49,336 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1232183873, now seen corresponding path program 1 times [2018-11-23 03:28:49,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,361 INFO L87 Difference]: Start difference. First operand 232 states and 386 transitions. Second operand 3 states. [2018-11-23 03:28:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,379 INFO L93 Difference]: Finished difference Result 348 states and 576 transitions. [2018-11-23 03:28:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 03:28:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,380 INFO L225 Difference]: With dead ends: 348 [2018-11-23 03:28:49,380 INFO L226 Difference]: Without dead ends: 238 [2018-11-23 03:28:49,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-23 03:28:49,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-11-23 03:28:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-11-23 03:28:49,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 386 transitions. [2018-11-23 03:28:49,390 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 386 transitions. Word has length 22 [2018-11-23 03:28:49,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,390 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 386 transitions. [2018-11-23 03:28:49,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,390 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 386 transitions. [2018-11-23 03:28:49,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 03:28:49,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:49,391 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,392 INFO L82 PathProgramCache]: Analyzing trace with hash 645377859, now seen corresponding path program 1 times [2018-11-23 03:28:49,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,419 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,420 INFO L87 Difference]: Start difference. First operand 236 states and 386 transitions. Second operand 3 states. [2018-11-23 03:28:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,435 INFO L93 Difference]: Finished difference Result 428 states and 712 transitions. [2018-11-23 03:28:49,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 03:28:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,437 INFO L225 Difference]: With dead ends: 428 [2018-11-23 03:28:49,437 INFO L226 Difference]: Without dead ends: 426 [2018-11-23 03:28:49,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-11-23 03:28:49,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 328. [2018-11-23 03:28:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-11-23 03:28:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 526 transitions. [2018-11-23 03:28:49,447 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 526 transitions. Word has length 22 [2018-11-23 03:28:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,447 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 526 transitions. [2018-11-23 03:28:49,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 526 transitions. [2018-11-23 03:28:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 03:28:49,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:49,450 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash 903543297, now seen corresponding path program 1 times [2018-11-23 03:28:49,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,464 INFO L87 Difference]: Start difference. First operand 328 states and 526 transitions. Second operand 3 states. [2018-11-23 03:28:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,483 INFO L93 Difference]: Finished difference Result 764 states and 1232 transitions. [2018-11-23 03:28:49,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 03:28:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,485 INFO L225 Difference]: With dead ends: 764 [2018-11-23 03:28:49,485 INFO L226 Difference]: Without dead ends: 450 [2018-11-23 03:28:49,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-11-23 03:28:49,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 448. [2018-11-23 03:28:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-11-23 03:28:49,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 710 transitions. [2018-11-23 03:28:49,499 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 710 transitions. Word has length 22 [2018-11-23 03:28:49,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,499 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 710 transitions. [2018-11-23 03:28:49,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,500 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 710 transitions. [2018-11-23 03:28:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 03:28:49,500 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:49,501 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1467908124, now seen corresponding path program 1 times [2018-11-23 03:28:49,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,533 INFO L87 Difference]: Start difference. First operand 448 states and 710 transitions. Second operand 3 states. [2018-11-23 03:28:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,564 INFO L93 Difference]: Finished difference Result 672 states and 1060 transitions. [2018-11-23 03:28:49,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 03:28:49,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,566 INFO L225 Difference]: With dead ends: 672 [2018-11-23 03:28:49,566 INFO L226 Difference]: Without dead ends: 458 [2018-11-23 03:28:49,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-11-23 03:28:49,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2018-11-23 03:28:49,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-11-23 03:28:49,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2018-11-23 03:28:49,579 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 23 [2018-11-23 03:28:49,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,579 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2018-11-23 03:28:49,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,579 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2018-11-23 03:28:49,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 03:28:49,580 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:49,581 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,581 INFO L82 PathProgramCache]: Analyzing trace with hash -2054714138, now seen corresponding path program 1 times [2018-11-23 03:28:49,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,597 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand 3 states. [2018-11-23 03:28:49,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,626 INFO L93 Difference]: Finished difference Result 812 states and 1288 transitions. [2018-11-23 03:28:49,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 03:28:49,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,629 INFO L225 Difference]: With dead ends: 812 [2018-11-23 03:28:49,629 INFO L226 Difference]: Without dead ends: 810 [2018-11-23 03:28:49,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2018-11-23 03:28:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 648. [2018-11-23 03:28:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2018-11-23 03:28:49,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 982 transitions. [2018-11-23 03:28:49,649 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 982 transitions. Word has length 23 [2018-11-23 03:28:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,650 INFO L480 AbstractCegarLoop]: Abstraction has 648 states and 982 transitions. [2018-11-23 03:28:49,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 982 transitions. [2018-11-23 03:28:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 03:28:49,651 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:49,652 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1796548700, now seen corresponding path program 1 times [2018-11-23 03:28:49,652 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,670 INFO L87 Difference]: Start difference. First operand 648 states and 982 transitions. Second operand 3 states. [2018-11-23 03:28:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,705 INFO L93 Difference]: Finished difference Result 1500 states and 2280 transitions. [2018-11-23 03:28:49,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-23 03:28:49,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,708 INFO L225 Difference]: With dead ends: 1500 [2018-11-23 03:28:49,708 INFO L226 Difference]: Without dead ends: 874 [2018-11-23 03:28:49,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-11-23 03:28:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 872. [2018-11-23 03:28:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 872 states. [2018-11-23 03:28:49,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1302 transitions. [2018-11-23 03:28:49,736 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1302 transitions. Word has length 23 [2018-11-23 03:28:49,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,736 INFO L480 AbstractCegarLoop]: Abstraction has 872 states and 1302 transitions. [2018-11-23 03:28:49,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,736 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1302 transitions. [2018-11-23 03:28:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 03:28:49,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,737 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:49,737 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash 728586230, now seen corresponding path program 1 times [2018-11-23 03:28:49,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,753 INFO L87 Difference]: Start difference. First operand 872 states and 1302 transitions. Second operand 3 states. [2018-11-23 03:28:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,795 INFO L93 Difference]: Finished difference Result 1308 states and 1944 transitions. [2018-11-23 03:28:49,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 03:28:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,799 INFO L225 Difference]: With dead ends: 1308 [2018-11-23 03:28:49,799 INFO L226 Difference]: Without dead ends: 890 [2018-11-23 03:28:49,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-11-23 03:28:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 888. [2018-11-23 03:28:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-11-23 03:28:49,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1302 transitions. [2018-11-23 03:28:49,827 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1302 transitions. Word has length 24 [2018-11-23 03:28:49,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,827 INFO L480 AbstractCegarLoop]: Abstraction has 888 states and 1302 transitions. [2018-11-23 03:28:49,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,827 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1302 transitions. [2018-11-23 03:28:49,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 03:28:49,828 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:49,829 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,829 INFO L82 PathProgramCache]: Analyzing trace with hash 141780216, now seen corresponding path program 1 times [2018-11-23 03:28:49,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,860 INFO L87 Difference]: Start difference. First operand 888 states and 1302 transitions. Second operand 3 states. [2018-11-23 03:28:49,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:49,895 INFO L93 Difference]: Finished difference Result 1548 states and 2312 transitions. [2018-11-23 03:28:49,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:49,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 03:28:49,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:49,900 INFO L225 Difference]: With dead ends: 1548 [2018-11-23 03:28:49,900 INFO L226 Difference]: Without dead ends: 1546 [2018-11-23 03:28:49,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-11-23 03:28:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1288. [2018-11-23 03:28:49,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1288 states. [2018-11-23 03:28:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1830 transitions. [2018-11-23 03:28:49,940 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1830 transitions. Word has length 24 [2018-11-23 03:28:49,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:49,940 INFO L480 AbstractCegarLoop]: Abstraction has 1288 states and 1830 transitions. [2018-11-23 03:28:49,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1830 transitions. [2018-11-23 03:28:49,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 03:28:49,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:49,942 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:49,942 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:49,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:49,943 INFO L82 PathProgramCache]: Analyzing trace with hash 399945654, now seen corresponding path program 1 times [2018-11-23 03:28:49,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:49,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:49,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:49,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:49,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:49,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:49,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:49,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:49,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:49,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:49,961 INFO L87 Difference]: Start difference. First operand 1288 states and 1830 transitions. Second operand 3 states. [2018-11-23 03:28:50,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:50,005 INFO L93 Difference]: Finished difference Result 2956 states and 4200 transitions. [2018-11-23 03:28:50,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:50,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-23 03:28:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:50,010 INFO L225 Difference]: With dead ends: 2956 [2018-11-23 03:28:50,010 INFO L226 Difference]: Without dead ends: 1706 [2018-11-23 03:28:50,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2018-11-23 03:28:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1704. [2018-11-23 03:28:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2018-11-23 03:28:50,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 2374 transitions. [2018-11-23 03:28:50,066 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 2374 transitions. Word has length 24 [2018-11-23 03:28:50,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:50,066 INFO L480 AbstractCegarLoop]: Abstraction has 1704 states and 2374 transitions. [2018-11-23 03:28:50,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:50,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 2374 transitions. [2018-11-23 03:28:50,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 03:28:50,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:50,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:50,068 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:50,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:50,069 INFO L82 PathProgramCache]: Analyzing trace with hash 100434809, now seen corresponding path program 1 times [2018-11-23 03:28:50,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:50,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:50,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:50,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:50,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:50,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:50,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:50,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:50,081 INFO L87 Difference]: Start difference. First operand 1704 states and 2374 transitions. Second operand 3 states. [2018-11-23 03:28:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:50,143 INFO L93 Difference]: Finished difference Result 2556 states and 3544 transitions. [2018-11-23 03:28:50,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:50,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 03:28:50,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:50,148 INFO L225 Difference]: With dead ends: 2556 [2018-11-23 03:28:50,148 INFO L226 Difference]: Without dead ends: 1738 [2018-11-23 03:28:50,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:50,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-11-23 03:28:50,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2018-11-23 03:28:50,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2018-11-23 03:28:50,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2374 transitions. [2018-11-23 03:28:50,208 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2374 transitions. Word has length 25 [2018-11-23 03:28:50,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:50,208 INFO L480 AbstractCegarLoop]: Abstraction has 1736 states and 2374 transitions. [2018-11-23 03:28:50,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:50,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2374 transitions. [2018-11-23 03:28:50,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 03:28:50,210 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:50,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:50,211 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:50,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:50,211 INFO L82 PathProgramCache]: Analyzing trace with hash -486371205, now seen corresponding path program 1 times [2018-11-23 03:28:50,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:50,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:50,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:50,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:50,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:50,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:50,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:50,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:50,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:50,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:50,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:50,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:50,232 INFO L87 Difference]: Start difference. First operand 1736 states and 2374 transitions. Second operand 3 states. [2018-11-23 03:28:50,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:50,309 INFO L93 Difference]: Finished difference Result 2956 states and 4104 transitions. [2018-11-23 03:28:50,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:50,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 03:28:50,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:50,317 INFO L225 Difference]: With dead ends: 2956 [2018-11-23 03:28:50,317 INFO L226 Difference]: Without dead ends: 2954 [2018-11-23 03:28:50,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-11-23 03:28:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2568. [2018-11-23 03:28:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2568 states. [2018-11-23 03:28:50,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2568 states to 2568 states and 3398 transitions. [2018-11-23 03:28:50,415 INFO L78 Accepts]: Start accepts. Automaton has 2568 states and 3398 transitions. Word has length 25 [2018-11-23 03:28:50,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:50,415 INFO L480 AbstractCegarLoop]: Abstraction has 2568 states and 3398 transitions. [2018-11-23 03:28:50,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:50,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2568 states and 3398 transitions. [2018-11-23 03:28:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 03:28:50,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:50,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:50,419 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:50,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash -228205767, now seen corresponding path program 1 times [2018-11-23 03:28:50,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:50,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:50,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:50,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:50,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:50,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:50,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:50,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:50,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:50,440 INFO L87 Difference]: Start difference. First operand 2568 states and 3398 transitions. Second operand 3 states. [2018-11-23 03:28:50,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:50,531 INFO L93 Difference]: Finished difference Result 5836 states and 7688 transitions. [2018-11-23 03:28:50,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:50,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-23 03:28:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:50,540 INFO L225 Difference]: With dead ends: 5836 [2018-11-23 03:28:50,540 INFO L226 Difference]: Without dead ends: 3338 [2018-11-23 03:28:50,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:50,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3338 states. [2018-11-23 03:28:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3338 to 3336. [2018-11-23 03:28:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-11-23 03:28:50,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4294 transitions. [2018-11-23 03:28:50,643 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4294 transitions. Word has length 25 [2018-11-23 03:28:50,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:50,644 INFO L480 AbstractCegarLoop]: Abstraction has 3336 states and 4294 transitions. [2018-11-23 03:28:50,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:50,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4294 transitions. [2018-11-23 03:28:50,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 03:28:50,647 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:50,647 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:50,647 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:50,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:50,648 INFO L82 PathProgramCache]: Analyzing trace with hash 2102577579, now seen corresponding path program 1 times [2018-11-23 03:28:50,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:50,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:50,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:50,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:50,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:50,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:50,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:50,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:50,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:50,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:50,669 INFO L87 Difference]: Start difference. First operand 3336 states and 4294 transitions. Second operand 3 states. [2018-11-23 03:28:50,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:50,746 INFO L93 Difference]: Finished difference Result 5004 states and 6408 transitions. [2018-11-23 03:28:50,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:50,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 03:28:50,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:50,755 INFO L225 Difference]: With dead ends: 5004 [2018-11-23 03:28:50,755 INFO L226 Difference]: Without dead ends: 3402 [2018-11-23 03:28:50,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:50,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2018-11-23 03:28:50,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3400. [2018-11-23 03:28:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2018-11-23 03:28:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4294 transitions. [2018-11-23 03:28:50,859 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4294 transitions. Word has length 26 [2018-11-23 03:28:50,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:50,859 INFO L480 AbstractCegarLoop]: Abstraction has 3400 states and 4294 transitions. [2018-11-23 03:28:50,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4294 transitions. [2018-11-23 03:28:50,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 03:28:50,863 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:50,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:50,863 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:50,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:50,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1515771565, now seen corresponding path program 1 times [2018-11-23 03:28:50,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:50,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:50,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:50,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:50,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:50,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:50,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:50,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:50,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:50,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:50,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:50,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:50,887 INFO L87 Difference]: Start difference. First operand 3400 states and 4294 transitions. Second operand 3 states. [2018-11-23 03:28:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:51,023 INFO L93 Difference]: Finished difference Result 9804 states and 12104 transitions. [2018-11-23 03:28:51,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:51,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 03:28:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:51,040 INFO L225 Difference]: With dead ends: 9804 [2018-11-23 03:28:51,040 INFO L226 Difference]: Without dead ends: 6538 [2018-11-23 03:28:51,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2018-11-23 03:28:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6536. [2018-11-23 03:28:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-11-23 03:28:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7814 transitions. [2018-11-23 03:28:51,238 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7814 transitions. Word has length 26 [2018-11-23 03:28:51,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:51,239 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7814 transitions. [2018-11-23 03:28:51,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7814 transitions. [2018-11-23 03:28:51,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 03:28:51,244 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:51,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:51,244 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:51,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:51,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1257606127, now seen corresponding path program 1 times [2018-11-23 03:28:51,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:51,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:51,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:51,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:51,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:51,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:51,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:51,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:51,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:51,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:51,264 INFO L87 Difference]: Start difference. First operand 6536 states and 7814 transitions. Second operand 3 states. [2018-11-23 03:28:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:51,431 INFO L93 Difference]: Finished difference Result 7052 states and 8584 transitions. [2018-11-23 03:28:51,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:51,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-23 03:28:51,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:51,444 INFO L225 Difference]: With dead ends: 7052 [2018-11-23 03:28:51,444 INFO L226 Difference]: Without dead ends: 7050 [2018-11-23 03:28:51,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:51,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2018-11-23 03:28:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6536. [2018-11-23 03:28:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6536 states. [2018-11-23 03:28:51,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6536 states to 6536 states and 7686 transitions. [2018-11-23 03:28:51,681 INFO L78 Accepts]: Start accepts. Automaton has 6536 states and 7686 transitions. Word has length 26 [2018-11-23 03:28:51,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:51,681 INFO L480 AbstractCegarLoop]: Abstraction has 6536 states and 7686 transitions. [2018-11-23 03:28:51,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:51,681 INFO L276 IsEmpty]: Start isEmpty. Operand 6536 states and 7686 transitions. [2018-11-23 03:28:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 03:28:51,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:51,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:51,689 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:51,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:51,689 INFO L82 PathProgramCache]: Analyzing trace with hash -255505650, now seen corresponding path program 1 times [2018-11-23 03:28:51,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:51,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:51,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:51,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:51,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:51,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:51,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:51,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:51,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:51,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:51,706 INFO L87 Difference]: Start difference. First operand 6536 states and 7686 transitions. Second operand 3 states. [2018-11-23 03:28:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:51,964 INFO L93 Difference]: Finished difference Result 10634 states and 12423 transitions. [2018-11-23 03:28:51,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:51,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 03:28:51,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:51,981 INFO L225 Difference]: With dead ends: 10634 [2018-11-23 03:28:51,981 INFO L226 Difference]: Without dead ends: 10632 [2018-11-23 03:28:51,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:51,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10632 states. [2018-11-23 03:28:52,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10632 to 10120. [2018-11-23 03:28:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10120 states. [2018-11-23 03:28:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10120 states to 10120 states and 11654 transitions. [2018-11-23 03:28:52,233 INFO L78 Accepts]: Start accepts. Automaton has 10120 states and 11654 transitions. Word has length 27 [2018-11-23 03:28:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:52,233 INFO L480 AbstractCegarLoop]: Abstraction has 10120 states and 11654 transitions. [2018-11-23 03:28:52,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 10120 states and 11654 transitions. [2018-11-23 03:28:52,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 03:28:52,244 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:28:52,244 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:28:52,244 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:28:52,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:28:52,245 INFO L82 PathProgramCache]: Analyzing trace with hash 2659788, now seen corresponding path program 1 times [2018-11-23 03:28:52,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:28:52,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:28:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:52,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:28:52,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:28:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:28:52,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:28:52,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:28:52,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:28:52,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:28:52,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:28:52,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:52,268 INFO L87 Difference]: Start difference. First operand 10120 states and 11654 transitions. Second operand 3 states. [2018-11-23 03:28:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:28:52,535 INFO L93 Difference]: Finished difference Result 22664 states and 25734 transitions. [2018-11-23 03:28:52,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:28:52,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 03:28:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:28:52,535 INFO L225 Difference]: With dead ends: 22664 [2018-11-23 03:28:52,536 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 03:28:52,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:28:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 03:28:52,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 03:28:52,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 03:28:52,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 03:28:52,559 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-23 03:28:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:28:52,559 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 03:28:52,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:28:52,559 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 03:28:52,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 03:28:52,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 03:28:52,594 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 03:28:52,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 03:28:52,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 03:28:52,594 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 03:28:52,594 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 03:28:52,594 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 03:28:52,594 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,594 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 63) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point L61-2(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L451 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2018-11-23 03:28:52,595 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,596 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2018-11-23 03:28:52,596 INFO L448 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-23 03:28:52,596 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-23 03:28:52,596 INFO L448 ceAbstractionStarter]: For program point L89-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,596 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,596 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2018-11-23 03:28:52,596 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,596 INFO L451 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2018-11-23 03:28:52,596 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,596 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,596 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-23 03:28:52,596 INFO L448 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2018-11-23 03:28:52,596 INFO L444 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2018-11-23 03:28:52,597 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,597 INFO L448 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,597 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-23 03:28:52,597 INFO L448 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2018-11-23 03:28:52,597 INFO L448 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,597 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2018-11-23 03:28:52,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:28:52 BoogieIcfgContainer [2018-11-23 03:28:52,602 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:28:52,603 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:28:52,603 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:28:52,603 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:28:52,603 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:28:48" (3/4) ... [2018-11-23 03:28:52,606 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 03:28:52,612 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 03:28:52,612 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 03:28:52,616 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 03:28:52,617 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-23 03:28:52,617 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 03:28:52,659 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f1b3a1ee-80a2-46d6-a71e-085191757012/bin-2019/uautomizer/witness.graphml [2018-11-23 03:28:52,659 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:28:52,659 INFO L168 Benchmark]: Toolchain (without parser) took 4529.36 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 327.2 MB). Free memory was 959.1 MB in the beginning and 1.0 GB in the end (delta: -41.3 MB). Peak memory consumption was 285.8 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:52,660 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:28:52,661 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.68 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:52,661 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.26 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 940.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:52,661 INFO L168 Benchmark]: Boogie Preprocessor took 53.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:52,661 INFO L168 Benchmark]: RCFGBuilder took 212.84 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.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:52,662 INFO L168 Benchmark]: TraceAbstraction took 4026.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.7 MB). Peak memory consumption was 295.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:52,662 INFO L168 Benchmark]: Witness Printer took 56.07 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:28:52,664 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 164.68 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.7 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 13.26 ms. Allocated memory is still 1.0 GB. Free memory was 945.7 MB in the beginning and 940.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 53.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -200.9 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 212.84 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.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4026.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.7 MB). Peak memory consumption was 295.1 MB. Max. memory is 11.5 GB. * Witness Printer took 56.07 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 1 error locations. SAFE Result, 3.9s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 1.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1937 SDtfs, 926 SDslu, 1314 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10120occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 522 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 550 ConstructedInterpolants, 0 QuantifiedInterpolants, 23930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...