./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/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 f2cbbf56a13532141372a32a461d64a9d1351c0e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 22:07:37,736 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 22:07:37,738 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 22:07:37,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 22:07:37,746 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 22:07:37,746 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 22:07:37,747 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 22:07:37,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 22:07:37,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 22:07:37,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 22:07:37,749 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 22:07:37,749 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 22:07:37,750 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 22:07:37,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 22:07:37,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 22:07:37,751 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 22:07:37,752 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 22:07:37,753 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 22:07:37,754 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 22:07:37,755 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 22:07:37,755 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 22:07:37,756 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 22:07:37,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 22:07:37,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 22:07:37,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 22:07:37,757 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 22:07:37,758 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 22:07:37,758 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 22:07:37,759 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 22:07:37,759 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 22:07:37,760 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 22:07:37,760 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 22:07:37,760 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 22:07:37,760 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 22:07:37,761 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 22:07:37,761 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 22:07:37,762 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 22:07:37,771 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 22:07:37,771 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 22:07:37,772 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 22:07:37,772 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 22:07:37,773 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 22:07:37,773 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 22:07:37,773 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 22:07:37,773 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 22:07:37,773 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 22:07:37,774 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 22:07:37,774 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 22:07:37,774 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 22:07:37,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 22:07:37,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 22:07:37,774 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 22:07:37,774 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 22:07:37,775 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 22:07:37,775 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 22:07:37,775 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 22:07:37,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 22:07:37,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 22:07:37,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 22:07:37,776 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 22:07:37,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 22:07:37,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 22:07:37,776 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 22:07:37,776 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 22:07:37,776 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 22:07:37,776 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 22:07:37,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 22:07:37,777 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_a57beec3-39d0-4362-b705-367447350be2/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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2018-12-02 22:07:37,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 22:07:37,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 22:07:37,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 22:07:37,810 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 22:07:37,811 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 22:07:37,811 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 22:07:37,848 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/bin-2019/uautomizer/data/4ae7a90ab/644c712025364b7eb2740fa082646561/FLAG7e736b32f [2018-12-02 22:07:38,229 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 22:07:38,230 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/sv-benchmarks/c/locks/test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 22:07:38,234 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/bin-2019/uautomizer/data/4ae7a90ab/644c712025364b7eb2740fa082646561/FLAG7e736b32f [2018-12-02 22:07:38,242 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/bin-2019/uautomizer/data/4ae7a90ab/644c712025364b7eb2740fa082646561 [2018-12-02 22:07:38,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 22:07:38,245 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 22:07:38,245 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 22:07:38,245 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 22:07:38,247 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 22:07:38,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:07:38" (1/1) ... [2018-12-02 22:07:38,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a59d0df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38, skipping insertion in model container [2018-12-02 22:07:38,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 10:07:38" (1/1) ... [2018-12-02 22:07:38,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 22:07:38,264 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 22:07:38,351 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:07:38,354 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 22:07:38,366 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 22:07:38,374 INFO L195 MainTranslator]: Completed translation [2018-12-02 22:07:38,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38 WrapperNode [2018-12-02 22:07:38,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 22:07:38,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 22:07:38,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 22:07:38,375 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 22:07:38,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38" (1/1) ... [2018-12-02 22:07:38,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38" (1/1) ... [2018-12-02 22:07:38,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 22:07:38,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 22:07:38,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 22:07:38,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 22:07:38,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38" (1/1) ... [2018-12-02 22:07:38,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38" (1/1) ... [2018-12-02 22:07:38,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38" (1/1) ... [2018-12-02 22:07:38,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38" (1/1) ... [2018-12-02 22:07:38,421 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38" (1/1) ... [2018-12-02 22:07:38,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38" (1/1) ... [2018-12-02 22:07:38,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38" (1/1) ... [2018-12-02 22:07:38,427 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 22:07:38,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 22:07:38,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 22:07:38,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 22:07:38,428 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 22:07:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 22:07:38,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 22:07:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 22:07:38,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 22:07:38,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 22:07:38,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 22:07:38,574 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 22:07:38,574 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 22:07:38,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:07:38 BoogieIcfgContainer [2018-12-02 22:07:38,575 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 22:07:38,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 22:07:38,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 22:07:38,577 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 22:07:38,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 10:07:38" (1/3) ... [2018-12-02 22:07:38,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a02a03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:07:38, skipping insertion in model container [2018-12-02 22:07:38,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 10:07:38" (2/3) ... [2018-12-02 22:07:38,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a02a03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 10:07:38, skipping insertion in model container [2018-12-02 22:07:38,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:07:38" (3/3) ... [2018-12-02 22:07:38,579 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_8_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 22:07:38,585 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 22:07:38,589 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 22:07:38,597 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 22:07:38,613 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 22:07:38,614 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 22:07:38,614 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 22:07:38,614 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 22:07:38,614 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 22:07:38,614 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 22:07:38,614 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 22:07:38,614 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 22:07:38,614 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 22:07:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-12-02 22:07:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 22:07:38,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:38,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:07:38,628 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:38,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:38,632 INFO L82 PathProgramCache]: Analyzing trace with hash 577441593, now seen corresponding path program 1 times [2018-12-02 22:07:38,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:38,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:38,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:38,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:38,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:38,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:38,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:38,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:38,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:38,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:38,748 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2018-12-02 22:07:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:38,773 INFO L93 Difference]: Finished difference Result 75 states and 126 transitions. [2018-12-02 22:07:38,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:38,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-02 22:07:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:38,780 INFO L225 Difference]: With dead ends: 75 [2018-12-02 22:07:38,780 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 22:07:38,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:38,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 22:07:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2018-12-02 22:07:38,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 22:07:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 73 transitions. [2018-12-02 22:07:38,804 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 73 transitions. Word has length 18 [2018-12-02 22:07:38,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:38,805 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 73 transitions. [2018-12-02 22:07:38,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 73 transitions. [2018-12-02 22:07:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 22:07:38,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:38,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:07:38,805 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:38,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:38,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1278506171, now seen corresponding path program 1 times [2018-12-02 22:07:38,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:38,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:38,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:38,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:38,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:38,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:38,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:38,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:38,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:38,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:38,829 INFO L87 Difference]: Start difference. First operand 42 states and 73 transitions. Second operand 3 states. [2018-12-02 22:07:38,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:38,844 INFO L93 Difference]: Finished difference Result 97 states and 172 transitions. [2018-12-02 22:07:38,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:38,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-02 22:07:38,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:38,845 INFO L225 Difference]: With dead ends: 97 [2018-12-02 22:07:38,845 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 22:07:38,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:38,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 22:07:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-12-02 22:07:38,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-02 22:07:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 101 transitions. [2018-12-02 22:07:38,849 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 101 transitions. Word has length 18 [2018-12-02 22:07:38,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:38,850 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 101 transitions. [2018-12-02 22:07:38,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 101 transitions. [2018-12-02 22:07:38,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 22:07:38,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:38,850 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-12-02 22:07:38,850 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:38,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:38,851 INFO L82 PathProgramCache]: Analyzing trace with hash 721034227, now seen corresponding path program 1 times [2018-12-02 22:07:38,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:38,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:38,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:38,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:38,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:38,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:38,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:38,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:38,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:38,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:38,871 INFO L87 Difference]: Start difference. First operand 58 states and 101 transitions. Second operand 3 states. [2018-12-02 22:07:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:38,883 INFO L93 Difference]: Finished difference Result 90 states and 153 transitions. [2018-12-02 22:07:38,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:38,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 22:07:38,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:38,884 INFO L225 Difference]: With dead ends: 90 [2018-12-02 22:07:38,884 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 22:07:38,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:38,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 22:07:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-12-02 22:07:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 22:07:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 103 transitions. [2018-12-02 22:07:38,888 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 103 transitions. Word has length 19 [2018-12-02 22:07:38,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:38,888 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 103 transitions. [2018-12-02 22:07:38,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:38,888 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2018-12-02 22:07:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 22:07:38,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:38,889 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-12-02 22:07:38,889 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:38,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:38,889 INFO L82 PathProgramCache]: Analyzing trace with hash 979199665, now seen corresponding path program 1 times [2018-12-02 22:07:38,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:38,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:38,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:38,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:38,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:38,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:38,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:38,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:38,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:38,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:38,908 INFO L87 Difference]: Start difference. First operand 61 states and 103 transitions. Second operand 3 states. [2018-12-02 22:07:38,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:38,917 INFO L93 Difference]: Finished difference Result 112 states and 192 transitions. [2018-12-02 22:07:38,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:38,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 22:07:38,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:38,918 INFO L225 Difference]: With dead ends: 112 [2018-12-02 22:07:38,918 INFO L226 Difference]: Without dead ends: 110 [2018-12-02 22:07:38,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:38,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-02 22:07:38,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2018-12-02 22:07:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-02 22:07:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 136 transitions. [2018-12-02 22:07:38,923 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 136 transitions. Word has length 19 [2018-12-02 22:07:38,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:38,923 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 136 transitions. [2018-12-02 22:07:38,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 136 transitions. [2018-12-02 22:07:38,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 22:07:38,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:38,924 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-12-02 22:07:38,924 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:38,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:38,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1680264243, now seen corresponding path program 1 times [2018-12-02 22:07:38,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:38,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:38,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:38,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:38,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:38,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:38,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:38,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:38,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:38,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:38,939 INFO L87 Difference]: Start difference. First operand 80 states and 136 transitions. Second operand 3 states. [2018-12-02 22:07:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:38,958 INFO L93 Difference]: Finished difference Result 184 states and 318 transitions. [2018-12-02 22:07:38,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:38,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 22:07:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:38,959 INFO L225 Difference]: With dead ends: 184 [2018-12-02 22:07:38,959 INFO L226 Difference]: Without dead ends: 112 [2018-12-02 22:07:38,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-02 22:07:38,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-12-02 22:07:38,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-02 22:07:38,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 186 transitions. [2018-12-02 22:07:38,964 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 186 transitions. Word has length 19 [2018-12-02 22:07:38,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:38,965 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 186 transitions. [2018-12-02 22:07:38,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:38,965 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 186 transitions. [2018-12-02 22:07:38,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 22:07:38,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:38,965 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-12-02 22:07:38,966 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:38,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:38,966 INFO L82 PathProgramCache]: Analyzing trace with hash 290632912, now seen corresponding path program 1 times [2018-12-02 22:07:38,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:38,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:38,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:38,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:38,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:38,982 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:38,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:38,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:38,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:38,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:38,983 INFO L87 Difference]: Start difference. First operand 110 states and 186 transitions. Second operand 3 states. [2018-12-02 22:07:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:38,992 INFO L93 Difference]: Finished difference Result 165 states and 277 transitions. [2018-12-02 22:07:38,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:38,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 22:07:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:38,993 INFO L225 Difference]: With dead ends: 165 [2018-12-02 22:07:38,993 INFO L226 Difference]: Without dead ends: 114 [2018-12-02 22:07:38,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:38,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-02 22:07:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-12-02 22:07:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-02 22:07:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 186 transitions. [2018-12-02 22:07:38,998 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 186 transitions. Word has length 20 [2018-12-02 22:07:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:38,998 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 186 transitions. [2018-12-02 22:07:38,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 186 transitions. [2018-12-02 22:07:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 22:07:38,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:38,999 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-12-02 22:07:38,999 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:38,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:38,999 INFO L82 PathProgramCache]: Analyzing trace with hash 548798350, now seen corresponding path program 1 times [2018-12-02 22:07:38,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:38,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,017 INFO L87 Difference]: Start difference. First operand 112 states and 186 transitions. Second operand 3 states. [2018-12-02 22:07:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,025 INFO L93 Difference]: Finished difference Result 204 states and 344 transitions. [2018-12-02 22:07:39,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 22:07:39,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,026 INFO L225 Difference]: With dead ends: 204 [2018-12-02 22:07:39,026 INFO L226 Difference]: Without dead ends: 202 [2018-12-02 22:07:39,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-02 22:07:39,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2018-12-02 22:07:39,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-02 22:07:39,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 250 transitions. [2018-12-02 22:07:39,032 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 250 transitions. Word has length 20 [2018-12-02 22:07:39,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,032 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 250 transitions. [2018-12-02 22:07:39,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 250 transitions. [2018-12-02 22:07:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 22:07:39,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,033 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-12-02 22:07:39,033 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1249862928, now seen corresponding path program 1 times [2018-12-02 22:07:39,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,048 INFO L87 Difference]: Start difference. First operand 152 states and 250 transitions. Second operand 3 states. [2018-12-02 22:07:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,062 INFO L93 Difference]: Finished difference Result 352 states and 584 transitions. [2018-12-02 22:07:39,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 22:07:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,064 INFO L225 Difference]: With dead ends: 352 [2018-12-02 22:07:39,064 INFO L226 Difference]: Without dead ends: 210 [2018-12-02 22:07:39,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-02 22:07:39,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-12-02 22:07:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-02 22:07:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 338 transitions. [2018-12-02 22:07:39,076 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 338 transitions. Word has length 20 [2018-12-02 22:07:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,076 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 338 transitions. [2018-12-02 22:07:39,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 338 transitions. [2018-12-02 22:07:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 22:07:39,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,077 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-12-02 22:07:39,077 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,077 INFO L82 PathProgramCache]: Analyzing trace with hash -166905624, now seen corresponding path program 1 times [2018-12-02 22:07:39,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,092 INFO L87 Difference]: Start difference. First operand 208 states and 338 transitions. Second operand 3 states. [2018-12-02 22:07:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,103 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-12-02 22:07:39,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 22:07:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,104 INFO L225 Difference]: With dead ends: 312 [2018-12-02 22:07:39,104 INFO L226 Difference]: Without dead ends: 214 [2018-12-02 22:07:39,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-02 22:07:39,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-12-02 22:07:39,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-12-02 22:07:39,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 338 transitions. [2018-12-02 22:07:39,113 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 338 transitions. Word has length 21 [2018-12-02 22:07:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,113 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 338 transitions. [2018-12-02 22:07:39,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 338 transitions. [2018-12-02 22:07:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 22:07:39,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,115 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-12-02 22:07:39,115 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,115 INFO L82 PathProgramCache]: Analyzing trace with hash 91259814, now seen corresponding path program 1 times [2018-12-02 22:07:39,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,132 INFO L87 Difference]: Start difference. First operand 212 states and 338 transitions. Second operand 3 states. [2018-12-02 22:07:39,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,144 INFO L93 Difference]: Finished difference Result 380 states and 616 transitions. [2018-12-02 22:07:39,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 22:07:39,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,145 INFO L225 Difference]: With dead ends: 380 [2018-12-02 22:07:39,146 INFO L226 Difference]: Without dead ends: 378 [2018-12-02 22:07:39,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-02 22:07:39,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 296. [2018-12-02 22:07:39,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-02 22:07:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 462 transitions. [2018-12-02 22:07:39,152 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 462 transitions. Word has length 21 [2018-12-02 22:07:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,152 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 462 transitions. [2018-12-02 22:07:39,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 462 transitions. [2018-12-02 22:07:39,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 22:07:39,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,152 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-12-02 22:07:39,153 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,153 INFO L82 PathProgramCache]: Analyzing trace with hash 792324392, now seen corresponding path program 1 times [2018-12-02 22:07:39,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,167 INFO L87 Difference]: Start difference. First operand 296 states and 462 transitions. Second operand 3 states. [2018-12-02 22:07:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,182 INFO L93 Difference]: Finished difference Result 684 states and 1072 transitions. [2018-12-02 22:07:39,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,182 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 22:07:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,183 INFO L225 Difference]: With dead ends: 684 [2018-12-02 22:07:39,183 INFO L226 Difference]: Without dead ends: 402 [2018-12-02 22:07:39,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-02 22:07:39,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2018-12-02 22:07:39,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-02 22:07:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 614 transitions. [2018-12-02 22:07:39,191 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 614 transitions. Word has length 21 [2018-12-02 22:07:39,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,191 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 614 transitions. [2018-12-02 22:07:39,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,191 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 614 transitions. [2018-12-02 22:07:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 22:07:39,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,191 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-12-02 22:07:39,192 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1465698011, now seen corresponding path program 1 times [2018-12-02 22:07:39,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,208 INFO L87 Difference]: Start difference. First operand 400 states and 614 transitions. Second operand 3 states. [2018-12-02 22:07:39,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,224 INFO L93 Difference]: Finished difference Result 600 states and 916 transitions. [2018-12-02 22:07:39,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 22:07:39,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,226 INFO L225 Difference]: With dead ends: 600 [2018-12-02 22:07:39,226 INFO L226 Difference]: Without dead ends: 410 [2018-12-02 22:07:39,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-12-02 22:07:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-12-02 22:07:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-12-02 22:07:39,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 614 transitions. [2018-12-02 22:07:39,239 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 614 transitions. Word has length 22 [2018-12-02 22:07:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,240 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 614 transitions. [2018-12-02 22:07:39,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 614 transitions. [2018-12-02 22:07:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 22:07:39,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,241 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-12-02 22:07:39,241 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1207532573, now seen corresponding path program 1 times [2018-12-02 22:07:39,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,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-12-02 22:07:39,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,264 INFO L87 Difference]: Start difference. First operand 408 states and 614 transitions. Second operand 3 states. [2018-12-02 22:07:39,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,282 INFO L93 Difference]: Finished difference Result 716 states and 1096 transitions. [2018-12-02 22:07:39,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 22:07:39,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,284 INFO L225 Difference]: With dead ends: 716 [2018-12-02 22:07:39,284 INFO L226 Difference]: Without dead ends: 714 [2018-12-02 22:07:39,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-12-02 22:07:39,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 584. [2018-12-02 22:07:39,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-12-02 22:07:39,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 854 transitions. [2018-12-02 22:07:39,296 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 854 transitions. Word has length 22 [2018-12-02 22:07:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,296 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 854 transitions. [2018-12-02 22:07:39,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,296 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 854 transitions. [2018-12-02 22:07:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 22:07:39,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,297 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-12-02 22:07:39,297 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,298 INFO L82 PathProgramCache]: Analyzing trace with hash -506467995, now seen corresponding path program 1 times [2018-12-02 22:07:39,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,312 INFO L87 Difference]: Start difference. First operand 584 states and 854 transitions. Second operand 3 states. [2018-12-02 22:07:39,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,338 INFO L93 Difference]: Finished difference Result 1340 states and 1960 transitions. [2018-12-02 22:07:39,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 22:07:39,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,340 INFO L225 Difference]: With dead ends: 1340 [2018-12-02 22:07:39,340 INFO L226 Difference]: Without dead ends: 778 [2018-12-02 22:07:39,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-12-02 22:07:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 776. [2018-12-02 22:07:39,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2018-12-02 22:07:39,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1110 transitions. [2018-12-02 22:07:39,359 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1110 transitions. Word has length 22 [2018-12-02 22:07:39,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,359 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 1110 transitions. [2018-12-02 22:07:39,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,359 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1110 transitions. [2018-12-02 22:07:39,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 22:07:39,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,360 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-12-02 22:07:39,360 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1221411293, now seen corresponding path program 1 times [2018-12-02 22:07:39,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,370 INFO L87 Difference]: Start difference. First operand 776 states and 1110 transitions. Second operand 3 states. [2018-12-02 22:07:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,386 INFO L93 Difference]: Finished difference Result 1164 states and 1656 transitions. [2018-12-02 22:07:39,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 22:07:39,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,387 INFO L225 Difference]: With dead ends: 1164 [2018-12-02 22:07:39,387 INFO L226 Difference]: Without dead ends: 794 [2018-12-02 22:07:39,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2018-12-02 22:07:39,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 792. [2018-12-02 22:07:39,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2018-12-02 22:07:39,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1110 transitions. [2018-12-02 22:07:39,403 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1110 transitions. Word has length 23 [2018-12-02 22:07:39,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,403 INFO L480 AbstractCegarLoop]: Abstraction has 792 states and 1110 transitions. [2018-12-02 22:07:39,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,404 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1110 transitions. [2018-12-02 22:07:39,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 22:07:39,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,404 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-12-02 22:07:39,404 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1479576731, now seen corresponding path program 1 times [2018-12-02 22:07:39,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,415 INFO L87 Difference]: Start difference. First operand 792 states and 1110 transitions. Second operand 3 states. [2018-12-02 22:07:39,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,448 INFO L93 Difference]: Finished difference Result 1356 states and 1928 transitions. [2018-12-02 22:07:39,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 22:07:39,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,452 INFO L225 Difference]: With dead ends: 1356 [2018-12-02 22:07:39,452 INFO L226 Difference]: Without dead ends: 1354 [2018-12-02 22:07:39,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-12-02 22:07:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1160. [2018-12-02 22:07:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1160 states. [2018-12-02 22:07:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1574 transitions. [2018-12-02 22:07:39,478 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1574 transitions. Word has length 23 [2018-12-02 22:07:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,478 INFO L480 AbstractCegarLoop]: Abstraction has 1160 states and 1574 transitions. [2018-12-02 22:07:39,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1574 transitions. [2018-12-02 22:07:39,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 22:07:39,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,479 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-12-02 22:07:39,480 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash -2114325987, now seen corresponding path program 1 times [2018-12-02 22:07:39,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,492 INFO L87 Difference]: Start difference. First operand 1160 states and 1574 transitions. Second operand 3 states. [2018-12-02 22:07:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,538 INFO L93 Difference]: Finished difference Result 2636 states and 3560 transitions. [2018-12-02 22:07:39,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 22:07:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,542 INFO L225 Difference]: With dead ends: 2636 [2018-12-02 22:07:39,542 INFO L226 Difference]: Without dead ends: 1514 [2018-12-02 22:07:39,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-12-02 22:07:39,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2018-12-02 22:07:39,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1512. [2018-12-02 22:07:39,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1512 states. [2018-12-02 22:07:39,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 1990 transitions. [2018-12-02 22:07:39,583 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 1990 transitions. Word has length 23 [2018-12-02 22:07:39,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,584 INFO L480 AbstractCegarLoop]: Abstraction has 1512 states and 1990 transitions. [2018-12-02 22:07:39,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 1990 transitions. [2018-12-02 22:07:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 22:07:39,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:07:39,586 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1377545862, now seen corresponding path program 1 times [2018-12-02 22:07:39,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,607 INFO L87 Difference]: Start difference. First operand 1512 states and 1990 transitions. Second operand 3 states. [2018-12-02 22:07:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,647 INFO L93 Difference]: Finished difference Result 2268 states and 2968 transitions. [2018-12-02 22:07:39,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 22:07:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,651 INFO L225 Difference]: With dead ends: 2268 [2018-12-02 22:07:39,651 INFO L226 Difference]: Without dead ends: 1546 [2018-12-02 22:07:39,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1546 states. [2018-12-02 22:07:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1546 to 1544. [2018-12-02 22:07:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2018-12-02 22:07:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1990 transitions. [2018-12-02 22:07:39,688 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1990 transitions. Word has length 24 [2018-12-02 22:07:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,688 INFO L480 AbstractCegarLoop]: Abstraction has 1544 states and 1990 transitions. [2018-12-02 22:07:39,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1990 transitions. [2018-12-02 22:07:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 22:07:39,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:07:39,690 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1119380424, now seen corresponding path program 1 times [2018-12-02 22:07:39,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,700 INFO L87 Difference]: Start difference. First operand 1544 states and 1990 transitions. Second operand 3 states. [2018-12-02 22:07:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,753 INFO L93 Difference]: Finished difference Result 2572 states and 3336 transitions. [2018-12-02 22:07:39,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 22:07:39,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,759 INFO L225 Difference]: With dead ends: 2572 [2018-12-02 22:07:39,759 INFO L226 Difference]: Without dead ends: 2570 [2018-12-02 22:07:39,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2018-12-02 22:07:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2312. [2018-12-02 22:07:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2018-12-02 22:07:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 2886 transitions. [2018-12-02 22:07:39,798 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 2886 transitions. Word has length 24 [2018-12-02 22:07:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,799 INFO L480 AbstractCegarLoop]: Abstraction has 2312 states and 2886 transitions. [2018-12-02 22:07:39,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 2886 transitions. [2018-12-02 22:07:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 22:07:39,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:07:39,801 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,801 INFO L82 PathProgramCache]: Analyzing trace with hash -418315846, now seen corresponding path program 1 times [2018-12-02 22:07:39,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,811 INFO L87 Difference]: Start difference. First operand 2312 states and 2886 transitions. Second operand 3 states. [2018-12-02 22:07:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:39,870 INFO L93 Difference]: Finished difference Result 5196 states and 6408 transitions. [2018-12-02 22:07:39,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:39,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 22:07:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:39,874 INFO L225 Difference]: With dead ends: 5196 [2018-12-02 22:07:39,875 INFO L226 Difference]: Without dead ends: 2954 [2018-12-02 22:07:39,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2954 states. [2018-12-02 22:07:39,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2954 to 2952. [2018-12-02 22:07:39,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2952 states. [2018-12-02 22:07:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2952 states to 2952 states and 3526 transitions. [2018-12-02 22:07:39,931 INFO L78 Accepts]: Start accepts. Automaton has 2952 states and 3526 transitions. Word has length 24 [2018-12-02 22:07:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:39,931 INFO L480 AbstractCegarLoop]: Abstraction has 2952 states and 3526 transitions. [2018-12-02 22:07:39,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:39,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2952 states and 3526 transitions. [2018-12-02 22:07:39,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 22:07:39,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:39,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:07:39,934 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:39,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:39,934 INFO L82 PathProgramCache]: Analyzing trace with hash -340838702, now seen corresponding path program 1 times [2018-12-02 22:07:39,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:39,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:39,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:39,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:39,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:39,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:39,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:39,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:39,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:39,955 INFO L87 Difference]: Start difference. First operand 2952 states and 3526 transitions. Second operand 3 states. [2018-12-02 22:07:40,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:40,020 INFO L93 Difference]: Finished difference Result 4428 states and 5256 transitions. [2018-12-02 22:07:40,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:40,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 22:07:40,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:40,027 INFO L225 Difference]: With dead ends: 4428 [2018-12-02 22:07:40,027 INFO L226 Difference]: Without dead ends: 3018 [2018-12-02 22:07:40,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2018-12-02 22:07:40,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3016. [2018-12-02 22:07:40,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-12-02 22:07:40,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3526 transitions. [2018-12-02 22:07:40,107 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3526 transitions. Word has length 25 [2018-12-02 22:07:40,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:40,108 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3526 transitions. [2018-12-02 22:07:40,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:40,108 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3526 transitions. [2018-12-02 22:07:40,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 22:07:40,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:40,110 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:07:40,110 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:40,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:40,110 INFO L82 PathProgramCache]: Analyzing trace with hash -82673264, now seen corresponding path program 1 times [2018-12-02 22:07:40,111 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:40,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:40,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:40,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:40,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:40,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:40,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:40,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:40,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:40,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:40,123 INFO L87 Difference]: Start difference. First operand 3016 states and 3526 transitions. Second operand 3 states. [2018-12-02 22:07:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:40,194 INFO L93 Difference]: Finished difference Result 8650 states and 9799 transitions. [2018-12-02 22:07:40,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:40,195 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 22:07:40,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:40,199 INFO L225 Difference]: With dead ends: 8650 [2018-12-02 22:07:40,199 INFO L226 Difference]: Without dead ends: 3016 [2018-12-02 22:07:40,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:40,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3016 states. [2018-12-02 22:07:40,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3016 to 3016. [2018-12-02 22:07:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3016 states. [2018-12-02 22:07:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3016 states to 3016 states and 3270 transitions. [2018-12-02 22:07:40,278 INFO L78 Accepts]: Start accepts. Automaton has 3016 states and 3270 transitions. Word has length 25 [2018-12-02 22:07:40,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:40,278 INFO L480 AbstractCegarLoop]: Abstraction has 3016 states and 3270 transitions. [2018-12-02 22:07:40,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:40,278 INFO L276 IsEmpty]: Start isEmpty. Operand 3016 states and 3270 transitions. [2018-12-02 22:07:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 22:07:40,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 22:07:40,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 22:07:40,281 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 22:07:40,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 22:07:40,281 INFO L82 PathProgramCache]: Analyzing trace with hash -783737842, now seen corresponding path program 1 times [2018-12-02 22:07:40,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 22:07:40,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 22:07:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:40,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 22:07:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 22:07:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 22:07:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 22:07:40,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 22:07:40,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 22:07:40,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 22:07:40,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 22:07:40,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:40,291 INFO L87 Difference]: Start difference. First operand 3016 states and 3270 transitions. Second operand 3 states. [2018-12-02 22:07:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 22:07:40,324 INFO L93 Difference]: Finished difference Result 3016 states and 3270 transitions. [2018-12-02 22:07:40,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 22:07:40,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 22:07:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 22:07:40,325 INFO L225 Difference]: With dead ends: 3016 [2018-12-02 22:07:40,325 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 22:07:40,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 22:07:40,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 22:07:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 22:07:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 22:07:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 22:07:40,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-12-02 22:07:40,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 22:07:40,328 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 22:07:40,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 22:07:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 22:07:40,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 22:07:40,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 22:07:40,348 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 22:07:40,349 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 22:07:40,349 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 22:07:40,349 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 22:07:40,349 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 22:07:40,349 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 22:07:40,349 INFO L448 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-12-02 22:07:40,349 INFO L444 ceAbstractionStarter]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2018-12-02 22:07:40,349 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,349 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 135) no Hoare annotation was computed. [2018-12-02 22:07:40,349 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,349 INFO L448 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-12-02 22:07:40,349 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,349 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,350 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 135) no Hoare annotation was computed. [2018-12-02 22:07:40,350 INFO L448 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-12-02 22:07:40,350 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 135) the Hoare annotation is: true [2018-12-02 22:07:40,350 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-12-02 22:07:40,350 INFO L448 ceAbstractionStarter]: For program point L80-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,350 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,350 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,350 INFO L448 ceAbstractionStarter]: For program point L64-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,350 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-12-02 22:07:40,350 INFO L448 ceAbstractionStarter]: For program point L56-2(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,350 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-12-02 22:07:40,350 INFO L451 ceAbstractionStarter]: At program point L131(lines 5 135) the Hoare annotation is: true [2018-12-02 22:07:40,350 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,350 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,351 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-12-02 22:07:40,351 INFO L448 ceAbstractionStarter]: For program point L116(line 116) no Hoare annotation was computed. [2018-12-02 22:07:40,351 INFO L448 ceAbstractionStarter]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,351 INFO L451 ceAbstractionStarter]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2018-12-02 22:07:40,351 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,351 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2018-12-02 22:07:40,351 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,351 INFO L448 ceAbstractionStarter]: For program point L101(line 101) no Hoare annotation was computed. [2018-12-02 22:07:40,351 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 37) no Hoare annotation was computed. [2018-12-02 22:07:40,351 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 33 130) no Hoare annotation was computed. [2018-12-02 22:07:40,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 10:07:40 BoogieIcfgContainer [2018-12-02 22:07:40,356 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 22:07:40,357 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 22:07:40,357 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 22:07:40,357 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 22:07:40,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 10:07:38" (3/4) ... [2018-12-02 22:07:40,360 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 22:07:40,366 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 22:07:40,366 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 22:07:40,370 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 22:07:40,370 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 22:07:40,370 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 22:07:40,404 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a57beec3-39d0-4362-b705-367447350be2/bin-2019/uautomizer/witness.graphml [2018-12-02 22:07:40,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 22:07:40,405 INFO L168 Benchmark]: Toolchain (without parser) took 2160.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 957.1 MB in the beginning and 1.1 GB in the end (delta: -134.3 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2018-12-02 22:07:40,405 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:07:40,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.04 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 945.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-02 22:07:40,406 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.22 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 22:07:40,406 INFO L168 Benchmark]: Boogie Preprocessor took 40.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-02 22:07:40,406 INFO L168 Benchmark]: RCFGBuilder took 147.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-02 22:07:40,406 INFO L168 Benchmark]: TraceAbstraction took 1781.26 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.1 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2018-12-02 22:07:40,406 INFO L168 Benchmark]: Witness Printer took 47.20 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: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. [2018-12-02 22:07:40,407 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 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 129.04 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 945.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.22 ms. Allocated memory is still 1.0 GB. Free memory is still 945.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 147.95 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1781.26 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 66.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.1 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * Witness Printer took 47.20 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: 7.9 MB). Peak memory consumption was 7.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 1 error locations. SAFE Result, 1.7s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1573 SDtfs, 755 SDslu, 1056 SDs, 0 SdLazy, 121 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3016occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 790 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 498 NumberOfCodeBlocks, 498 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 19027 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...