./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_7_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_81625d33-c11d-4c0b-b643-bc5ea567002e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/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 ccd6d122756047ddb1225c106ac06a6748e14c22 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 23:47:07,174 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 23:47:07,175 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 23:47:07,181 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 23:47:07,181 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 23:47:07,181 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 23:47:07,182 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 23:47:07,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 23:47:07,183 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 23:47:07,184 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 23:47:07,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 23:47:07,184 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 23:47:07,185 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 23:47:07,185 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 23:47:07,186 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 23:47:07,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 23:47:07,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 23:47:07,187 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 23:47:07,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 23:47:07,189 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 23:47:07,189 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 23:47:07,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 23:47:07,191 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 23:47:07,191 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 23:47:07,191 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 23:47:07,192 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 23:47:07,192 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 23:47:07,193 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 23:47:07,193 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 23:47:07,194 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 23:47:07,194 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 23:47:07,194 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 23:47:07,194 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 23:47:07,194 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 23:47:07,195 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 23:47:07,195 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 23:47:07,195 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-02 23:47:07,202 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 23:47:07,202 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 23:47:07,203 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 23:47:07,203 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 23:47:07,203 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 23:47:07,203 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 23:47:07,203 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 23:47:07,204 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 23:47:07,204 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 23:47:07,204 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 23:47:07,204 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 23:47:07,204 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 23:47:07,204 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 23:47:07,204 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 23:47:07,204 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 23:47:07,204 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 23:47:07,204 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 23:47:07,204 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 23:47:07,205 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 23:47:07,205 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 23:47:07,205 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 23:47:07,205 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 23:47:07,205 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 23:47:07,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:47:07,205 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 23:47:07,205 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 23:47:07,205 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 23:47:07,205 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 23:47:07,206 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 23:47:07,206 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 23:47:07,206 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_81625d33-c11d-4c0b-b643-bc5ea567002e/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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2018-12-02 23:47:07,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 23:47:07,229 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 23:47:07,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 23:47:07,232 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 23:47:07,232 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 23:47:07,233 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/bin-2019/uautomizer/../../sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 23:47:07,267 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/bin-2019/uautomizer/data/6b9c3cf4b/6ab6b98c886947998ac8b40df8b0e1b7/FLAG37a80ad8f [2018-12-02 23:47:07,686 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 23:47:07,686 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/sv-benchmarks/c/locks/test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 23:47:07,690 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/bin-2019/uautomizer/data/6b9c3cf4b/6ab6b98c886947998ac8b40df8b0e1b7/FLAG37a80ad8f [2018-12-02 23:47:07,700 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/bin-2019/uautomizer/data/6b9c3cf4b/6ab6b98c886947998ac8b40df8b0e1b7 [2018-12-02 23:47:07,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 23:47:07,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 23:47:07,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 23:47:07,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 23:47:07,705 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 23:47:07,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:47:07" (1/1) ... [2018-12-02 23:47:07,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54724d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07, skipping insertion in model container [2018-12-02 23:47:07,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:47:07" (1/1) ... [2018-12-02 23:47:07,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 23:47:07,723 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 23:47:07,810 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:47:07,813 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 23:47:07,825 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:47:07,834 INFO L195 MainTranslator]: Completed translation [2018-12-02 23:47:07,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07 WrapperNode [2018-12-02 23:47:07,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 23:47:07,834 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 23:47:07,834 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 23:47:07,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 23:47:07,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07" (1/1) ... [2018-12-02 23:47:07,843 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07" (1/1) ... [2018-12-02 23:47:07,847 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 23:47:07,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 23:47:07,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 23:47:07,847 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 23:47:07,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07" (1/1) ... [2018-12-02 23:47:07,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07" (1/1) ... [2018-12-02 23:47:07,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07" (1/1) ... [2018-12-02 23:47:07,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07" (1/1) ... [2018-12-02 23:47:07,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07" (1/1) ... [2018-12-02 23:47:07,888 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07" (1/1) ... [2018-12-02 23:47:07,889 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07" (1/1) ... [2018-12-02 23:47:07,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 23:47:07,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 23:47:07,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 23:47:07,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 23:47:07,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/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 23:47:07,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 23:47:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 23:47:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 23:47:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 23:47:07,927 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 23:47:07,927 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 23:47:08,041 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 23:47:08,041 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 23:47:08,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:47:08 BoogieIcfgContainer [2018-12-02 23:47:08,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 23:47:08,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 23:47:08,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 23:47:08,044 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 23:47:08,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:47:07" (1/3) ... [2018-12-02 23:47:08,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7f82df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:47:08, skipping insertion in model container [2018-12-02 23:47:08,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:47:07" (2/3) ... [2018-12-02 23:47:08,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7f82df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:47:08, skipping insertion in model container [2018-12-02 23:47:08,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:47:08" (3/3) ... [2018-12-02 23:47:08,047 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_7_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 23:47:08,053 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 23:47:08,057 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 23:47:08,068 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 23:47:08,085 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 23:47:08,086 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 23:47:08,086 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 23:47:08,086 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 23:47:08,086 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 23:47:08,086 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 23:47:08,086 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 23:47:08,086 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 23:47:08,087 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 23:47:08,097 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-12-02 23:47:08,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 23:47:08,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,101 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:47:08,102 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1819770524, now seen corresponding path program 1 times [2018-12-02 23:47:08,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,204 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 23:47:08,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,223 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2018-12-02 23:47:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,253 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2018-12-02 23:47:08,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-02 23:47:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,260 INFO L225 Difference]: With dead ends: 69 [2018-12-02 23:47:08,260 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 23:47:08,262 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 23:47:08,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 23:47:08,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-12-02 23:47:08,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 23:47:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 65 transitions. [2018-12-02 23:47:08,285 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 65 transitions. Word has length 17 [2018-12-02 23:47:08,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,285 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 65 transitions. [2018-12-02 23:47:08,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,285 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 65 transitions. [2018-12-02 23:47:08,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 23:47:08,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:47:08,286 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1426743514, now seen corresponding path program 1 times [2018-12-02 23:47:08,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,314 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 23:47:08,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,316 INFO L87 Difference]: Start difference. First operand 38 states and 65 transitions. Second operand 3 states. [2018-12-02 23:47:08,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,329 INFO L93 Difference]: Finished difference Result 87 states and 152 transitions. [2018-12-02 23:47:08,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-02 23:47:08,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,331 INFO L225 Difference]: With dead ends: 87 [2018-12-02 23:47:08,331 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 23:47:08,331 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 23:47:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 23:47:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-12-02 23:47:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-02 23:47:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 89 transitions. [2018-12-02 23:47:08,336 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 89 transitions. Word has length 17 [2018-12-02 23:47:08,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,336 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 89 transitions. [2018-12-02 23:47:08,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 89 transitions. [2018-12-02 23:47:08,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 23:47:08,336 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,336 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 23:47:08,337 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,337 INFO L82 PathProgramCache]: Analyzing trace with hash 578525748, now seen corresponding path program 1 times [2018-12-02 23:47:08,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,356 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 23:47:08,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,357 INFO L87 Difference]: Start difference. First operand 52 states and 89 transitions. Second operand 3 states. [2018-12-02 23:47:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,370 INFO L93 Difference]: Finished difference Result 81 states and 135 transitions. [2018-12-02 23:47:08,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-02 23:47:08,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,371 INFO L225 Difference]: With dead ends: 81 [2018-12-02 23:47:08,372 INFO L226 Difference]: Without dead ends: 57 [2018-12-02 23:47:08,372 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 23:47:08,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-02 23:47:08,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-12-02 23:47:08,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-02 23:47:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2018-12-02 23:47:08,377 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 18 [2018-12-02 23:47:08,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,378 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2018-12-02 23:47:08,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2018-12-02 23:47:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 23:47:08,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,378 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 23:47:08,379 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1279590326, now seen corresponding path program 1 times [2018-12-02 23:47:08,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,399 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 23:47:08,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,400 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand 3 states. [2018-12-02 23:47:08,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,409 INFO L93 Difference]: Finished difference Result 100 states and 168 transitions. [2018-12-02 23:47:08,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-02 23:47:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,410 INFO L225 Difference]: With dead ends: 100 [2018-12-02 23:47:08,410 INFO L226 Difference]: Without dead ends: 98 [2018-12-02 23:47:08,410 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 23:47:08,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-02 23:47:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2018-12-02 23:47:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 23:47:08,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2018-12-02 23:47:08,414 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 18 [2018-12-02 23:47:08,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,414 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2018-12-02 23:47:08,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,414 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2018-12-02 23:47:08,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 23:47:08,415 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,415 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 23:47:08,415 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,415 INFO L82 PathProgramCache]: Analyzing trace with hash 886563316, now seen corresponding path program 1 times [2018-12-02 23:47:08,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,428 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 23:47:08,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,429 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 3 states. [2018-12-02 23:47:08,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,438 INFO L93 Difference]: Finished difference Result 164 states and 278 transitions. [2018-12-02 23:47:08,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-02 23:47:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,439 INFO L225 Difference]: With dead ends: 164 [2018-12-02 23:47:08,439 INFO L226 Difference]: Without dead ends: 100 [2018-12-02 23:47:08,439 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 23:47:08,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-02 23:47:08,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-12-02 23:47:08,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-02 23:47:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 162 transitions. [2018-12-02 23:47:08,444 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 162 transitions. Word has length 18 [2018-12-02 23:47:08,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,444 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 162 transitions. [2018-12-02 23:47:08,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,444 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 162 transitions. [2018-12-02 23:47:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 23:47:08,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,445 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 23:47:08,445 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1012809135, now seen corresponding path program 1 times [2018-12-02 23:47:08,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,457 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 23:47:08,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,458 INFO L87 Difference]: Start difference. First operand 98 states and 162 transitions. Second operand 3 states. [2018-12-02 23:47:08,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,466 INFO L93 Difference]: Finished difference Result 147 states and 241 transitions. [2018-12-02 23:47:08,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 23:47:08,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,466 INFO L225 Difference]: With dead ends: 147 [2018-12-02 23:47:08,466 INFO L226 Difference]: Without dead ends: 102 [2018-12-02 23:47:08,467 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 23:47:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-02 23:47:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-12-02 23:47:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-02 23:47:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 162 transitions. [2018-12-02 23:47:08,471 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 162 transitions. Word has length 19 [2018-12-02 23:47:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,471 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 162 transitions. [2018-12-02 23:47:08,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,471 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 162 transitions. [2018-12-02 23:47:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 23:47:08,471 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,471 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 23:47:08,472 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1713873713, now seen corresponding path program 1 times [2018-12-02 23:47:08,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,486 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 23:47:08,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,487 INFO L87 Difference]: Start difference. First operand 100 states and 162 transitions. Second operand 3 states. [2018-12-02 23:47:08,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,498 INFO L93 Difference]: Finished difference Result 180 states and 296 transitions. [2018-12-02 23:47:08,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 23:47:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,499 INFO L225 Difference]: With dead ends: 180 [2018-12-02 23:47:08,499 INFO L226 Difference]: Without dead ends: 178 [2018-12-02 23:47:08,500 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 23:47:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-02 23:47:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 136. [2018-12-02 23:47:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-02 23:47:08,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 218 transitions. [2018-12-02 23:47:08,505 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 218 transitions. Word has length 19 [2018-12-02 23:47:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,505 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 218 transitions. [2018-12-02 23:47:08,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 218 transitions. [2018-12-02 23:47:08,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-02 23:47:08,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:47:08,506 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1320846703, now seen corresponding path program 1 times [2018-12-02 23:47:08,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,517 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 23:47:08,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,517 INFO L87 Difference]: Start difference. First operand 136 states and 218 transitions. Second operand 3 states. [2018-12-02 23:47:08,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,527 INFO L93 Difference]: Finished difference Result 312 states and 504 transitions. [2018-12-02 23:47:08,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-02 23:47:08,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,528 INFO L225 Difference]: With dead ends: 312 [2018-12-02 23:47:08,528 INFO L226 Difference]: Without dead ends: 186 [2018-12-02 23:47:08,529 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 23:47:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-02 23:47:08,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-12-02 23:47:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-02 23:47:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 290 transitions. [2018-12-02 23:47:08,536 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 290 transitions. Word has length 19 [2018-12-02 23:47:08,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,536 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 290 transitions. [2018-12-02 23:47:08,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 290 transitions. [2018-12-02 23:47:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 23:47:08,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,538 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 23:47:08,538 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1590692585, now seen corresponding path program 1 times [2018-12-02 23:47:08,538 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:47:08,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,554 INFO L87 Difference]: Start difference. First operand 184 states and 290 transitions. Second operand 3 states. [2018-12-02 23:47:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,565 INFO L93 Difference]: Finished difference Result 276 states and 432 transitions. [2018-12-02 23:47:08,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 23:47:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,567 INFO L225 Difference]: With dead ends: 276 [2018-12-02 23:47:08,567 INFO L226 Difference]: Without dead ends: 190 [2018-12-02 23:47:08,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-02 23:47:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-12-02 23:47:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-02 23:47:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 290 transitions. [2018-12-02 23:47:08,574 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 290 transitions. Word has length 20 [2018-12-02 23:47:08,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,574 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 290 transitions. [2018-12-02 23:47:08,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 290 transitions. [2018-12-02 23:47:08,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 23:47:08,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,575 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 23:47:08,575 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,576 INFO L82 PathProgramCache]: Analyzing trace with hash -2003210133, now seen corresponding path program 1 times [2018-12-02 23:47:08,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,588 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 23:47:08,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,588 INFO L87 Difference]: Start difference. First operand 188 states and 290 transitions. Second operand 3 states. [2018-12-02 23:47:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,603 INFO L93 Difference]: Finished difference Result 332 states and 520 transitions. [2018-12-02 23:47:08,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 23:47:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,604 INFO L225 Difference]: With dead ends: 332 [2018-12-02 23:47:08,604 INFO L226 Difference]: Without dead ends: 330 [2018-12-02 23:47:08,605 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 23:47:08,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-12-02 23:47:08,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 264. [2018-12-02 23:47:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-02 23:47:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 398 transitions. [2018-12-02 23:47:08,612 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 398 transitions. Word has length 20 [2018-12-02 23:47:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,613 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 398 transitions. [2018-12-02 23:47:08,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 398 transitions. [2018-12-02 23:47:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 23:47:08,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,614 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 23:47:08,614 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1898730153, now seen corresponding path program 1 times [2018-12-02 23:47:08,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,629 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 23:47:08,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,630 INFO L87 Difference]: Start difference. First operand 264 states and 398 transitions. Second operand 3 states. [2018-12-02 23:47:08,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,647 INFO L93 Difference]: Finished difference Result 604 states and 912 transitions. [2018-12-02 23:47:08,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 23:47:08,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,649 INFO L225 Difference]: With dead ends: 604 [2018-12-02 23:47:08,649 INFO L226 Difference]: Without dead ends: 354 [2018-12-02 23:47:08,649 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 23:47:08,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-02 23:47:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-12-02 23:47:08,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-12-02 23:47:08,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 518 transitions. [2018-12-02 23:47:08,655 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 518 transitions. Word has length 20 [2018-12-02 23:47:08,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,656 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 518 transitions. [2018-12-02 23:47:08,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,656 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 518 transitions. [2018-12-02 23:47:08,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 23:47:08,656 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,656 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 23:47:08,656 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1969756604, now seen corresponding path program 1 times [2018-12-02 23:47:08,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,670 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 23:47:08,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,670 INFO L87 Difference]: Start difference. First operand 352 states and 518 transitions. Second operand 3 states. [2018-12-02 23:47:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,680 INFO L93 Difference]: Finished difference Result 528 states and 772 transitions. [2018-12-02 23:47:08,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,680 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 23:47:08,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,681 INFO L225 Difference]: With dead ends: 528 [2018-12-02 23:47:08,681 INFO L226 Difference]: Without dead ends: 362 [2018-12-02 23:47:08,682 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 23:47:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-12-02 23:47:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2018-12-02 23:47:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-02 23:47:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 518 transitions. [2018-12-02 23:47:08,689 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 518 transitions. Word has length 21 [2018-12-02 23:47:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,689 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 518 transitions. [2018-12-02 23:47:08,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 518 transitions. [2018-12-02 23:47:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 23:47:08,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,690 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 23:47:08,690 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1268692026, now seen corresponding path program 1 times [2018-12-02 23:47:08,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,702 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 23:47:08,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,703 INFO L87 Difference]: Start difference. First operand 360 states and 518 transitions. Second operand 3 states. [2018-12-02 23:47:08,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,717 INFO L93 Difference]: Finished difference Result 620 states and 904 transitions. [2018-12-02 23:47:08,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 23:47:08,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,718 INFO L225 Difference]: With dead ends: 620 [2018-12-02 23:47:08,718 INFO L226 Difference]: Without dead ends: 618 [2018-12-02 23:47:08,719 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 23:47:08,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-12-02 23:47:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 520. [2018-12-02 23:47:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-02 23:47:08,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 726 transitions. [2018-12-02 23:47:08,730 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 726 transitions. Word has length 21 [2018-12-02 23:47:08,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,730 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 726 transitions. [2018-12-02 23:47:08,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 726 transitions. [2018-12-02 23:47:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 23:47:08,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,731 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 23:47:08,731 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1661719036, now seen corresponding path program 1 times [2018-12-02 23:47:08,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,741 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 23:47:08,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,743 INFO L87 Difference]: Start difference. First operand 520 states and 726 transitions. Second operand 3 states. [2018-12-02 23:47:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,766 INFO L93 Difference]: Finished difference Result 1180 states and 1640 transitions. [2018-12-02 23:47:08,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-02 23:47:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,769 INFO L225 Difference]: With dead ends: 1180 [2018-12-02 23:47:08,769 INFO L226 Difference]: Without dead ends: 682 [2018-12-02 23:47:08,770 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 23:47:08,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2018-12-02 23:47:08,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 680. [2018-12-02 23:47:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-12-02 23:47:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 918 transitions. [2018-12-02 23:47:08,795 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 918 transitions. Word has length 21 [2018-12-02 23:47:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,795 INFO L480 AbstractCegarLoop]: Abstraction has 680 states and 918 transitions. [2018-12-02 23:47:08,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 918 transitions. [2018-12-02 23:47:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 23:47:08,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,796 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 23:47:08,797 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,797 INFO L82 PathProgramCache]: Analyzing trace with hash -674531426, now seen corresponding path program 1 times [2018-12-02 23:47:08,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,809 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 23:47:08,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,810 INFO L87 Difference]: Start difference. First operand 680 states and 918 transitions. Second operand 3 states. [2018-12-02 23:47:08,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,833 INFO L93 Difference]: Finished difference Result 1020 states and 1368 transitions. [2018-12-02 23:47:08,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 23:47:08,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,835 INFO L225 Difference]: With dead ends: 1020 [2018-12-02 23:47:08,835 INFO L226 Difference]: Without dead ends: 698 [2018-12-02 23:47:08,836 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 23:47:08,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-12-02 23:47:08,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-12-02 23:47:08,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-12-02 23:47:08,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 918 transitions. [2018-12-02 23:47:08,854 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 918 transitions. Word has length 22 [2018-12-02 23:47:08,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,854 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 918 transitions. [2018-12-02 23:47:08,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,854 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 918 transitions. [2018-12-02 23:47:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 23:47:08,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,855 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 23:47:08,855 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash 26533152, now seen corresponding path program 1 times [2018-12-02 23:47:08,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:47:08,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,865 INFO L87 Difference]: Start difference. First operand 696 states and 918 transitions. Second operand 3 states. [2018-12-02 23:47:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,896 INFO L93 Difference]: Finished difference Result 1164 states and 1544 transitions. [2018-12-02 23:47:08,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 23:47:08,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,899 INFO L225 Difference]: With dead ends: 1164 [2018-12-02 23:47:08,899 INFO L226 Difference]: Without dead ends: 1162 [2018-12-02 23:47:08,900 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 23:47:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2018-12-02 23:47:08,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1032. [2018-12-02 23:47:08,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-12-02 23:47:08,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1318 transitions. [2018-12-02 23:47:08,931 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1318 transitions. Word has length 22 [2018-12-02 23:47:08,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:08,932 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1318 transitions. [2018-12-02 23:47:08,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1318 transitions. [2018-12-02 23:47:08,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 23:47:08,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:08,933 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 23:47:08,934 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:08,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:08,934 INFO L82 PathProgramCache]: Analyzing trace with hash -366493858, now seen corresponding path program 1 times [2018-12-02 23:47:08,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:08,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:08,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:08,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:08,946 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 23:47:08,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:08,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:08,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:08,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:08,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:08,947 INFO L87 Difference]: Start difference. First operand 1032 states and 1318 transitions. Second operand 3 states. [2018-12-02 23:47:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:08,989 INFO L93 Difference]: Finished difference Result 2316 states and 2920 transitions. [2018-12-02 23:47:08,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:08,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-02 23:47:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:08,993 INFO L225 Difference]: With dead ends: 2316 [2018-12-02 23:47:08,993 INFO L226 Difference]: Without dead ends: 1322 [2018-12-02 23:47:08,994 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 23:47:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2018-12-02 23:47:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1320. [2018-12-02 23:47:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1320 states. [2018-12-02 23:47:09,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1606 transitions. [2018-12-02 23:47:09,025 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1606 transitions. Word has length 22 [2018-12-02 23:47:09,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:09,025 INFO L480 AbstractCegarLoop]: Abstraction has 1320 states and 1606 transitions. [2018-12-02 23:47:09,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:09,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1606 transitions. [2018-12-02 23:47:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 23:47:09,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:09,026 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 23:47:09,026 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:09,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:09,027 INFO L82 PathProgramCache]: Analyzing trace with hash 822743769, now seen corresponding path program 1 times [2018-12-02 23:47:09,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:09,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:09,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:09,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:09,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:09,041 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 23:47:09,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:09,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:09,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:09,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:09,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:09,042 INFO L87 Difference]: Start difference. First operand 1320 states and 1606 transitions. Second operand 3 states. [2018-12-02 23:47:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:09,076 INFO L93 Difference]: Finished difference Result 1980 states and 2392 transitions. [2018-12-02 23:47:09,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:09,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 23:47:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:09,079 INFO L225 Difference]: With dead ends: 1980 [2018-12-02 23:47:09,079 INFO L226 Difference]: Without dead ends: 1354 [2018-12-02 23:47:09,079 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 23:47:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-12-02 23:47:09,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-12-02 23:47:09,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-02 23:47:09,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1606 transitions. [2018-12-02 23:47:09,103 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1606 transitions. Word has length 23 [2018-12-02 23:47:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:09,104 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 1606 transitions. [2018-12-02 23:47:09,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1606 transitions. [2018-12-02 23:47:09,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 23:47:09,105 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:09,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:47:09,105 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:09,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1523808347, now seen corresponding path program 1 times [2018-12-02 23:47:09,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:09,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:09,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:09,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:09,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:09,117 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 23:47:09,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:09,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:09,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:09,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:09,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:09,118 INFO L87 Difference]: Start difference. First operand 1352 states and 1606 transitions. Second operand 3 states. [2018-12-02 23:47:09,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:09,170 INFO L93 Difference]: Finished difference Result 2186 states and 2567 transitions. [2018-12-02 23:47:09,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:09,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 23:47:09,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:09,175 INFO L225 Difference]: With dead ends: 2186 [2018-12-02 23:47:09,175 INFO L226 Difference]: Without dead ends: 2184 [2018-12-02 23:47:09,176 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 23:47:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2018-12-02 23:47:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2056. [2018-12-02 23:47:09,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-12-02 23:47:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2374 transitions. [2018-12-02 23:47:09,227 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2374 transitions. Word has length 23 [2018-12-02 23:47:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:09,227 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 2374 transitions. [2018-12-02 23:47:09,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2374 transitions. [2018-12-02 23:47:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 23:47:09,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:47:09,229 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 23:47:09,230 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:47:09,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:47:09,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1130781337, now seen corresponding path program 1 times [2018-12-02 23:47:09,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 23:47:09,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 23:47:09,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:09,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:47:09,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:47:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:47:09,242 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 23:47:09,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:47:09,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:47:09,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:47:09,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:47:09,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:47:09,243 INFO L87 Difference]: Start difference. First operand 2056 states and 2374 transitions. Second operand 3 states. [2018-12-02 23:47:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:47:09,299 INFO L93 Difference]: Finished difference Result 4552 states and 5126 transitions. [2018-12-02 23:47:09,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:47:09,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-02 23:47:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:47:09,300 INFO L225 Difference]: With dead ends: 4552 [2018-12-02 23:47:09,300 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 23:47:09,304 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 23:47:09,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 23:47:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 23:47:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 23:47:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 23:47:09,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-12-02 23:47:09,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:47:09,305 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 23:47:09,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:47:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 23:47:09,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 23:47:09,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 23:47:09,324 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 23:47:09,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 23:47:09,324 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 23:47:09,325 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 23:47:09,325 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 23:47:09,325 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 23:47:09,325 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 121) no Hoare annotation was computed. [2018-12-02 23:47:09,325 INFO L448 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-12-02 23:47:09,325 INFO L448 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,325 INFO L451 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2018-12-02 23:47:09,325 INFO L448 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-12-02 23:47:09,325 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-12-02 23:47:09,325 INFO L444 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2018-12-02 23:47:09,325 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 121) no Hoare annotation was computed. [2018-12-02 23:47:09,325 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 121) the Hoare annotation is: true [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,326 INFO L448 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,327 INFO L448 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2018-12-02 23:47:09,327 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,327 INFO L451 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2018-12-02 23:47:09,327 INFO L448 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2018-12-02 23:47:09,327 INFO L448 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,327 INFO L448 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2018-12-02 23:47:09,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:47:09 BoogieIcfgContainer [2018-12-02 23:47:09,332 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 23:47:09,333 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 23:47:09,333 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 23:47:09,333 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 23:47:09,333 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:47:08" (3/4) ... [2018-12-02 23:47:09,336 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 23:47:09,341 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 23:47:09,342 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 23:47:09,345 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 23:47:09,346 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 23:47:09,346 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 23:47:09,386 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_81625d33-c11d-4c0b-b643-bc5ea567002e/bin-2019/uautomizer/witness.graphml [2018-12-02 23:47:09,387 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 23:47:09,387 INFO L168 Benchmark]: Toolchain (without parser) took 1685.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 953.3 MB in the beginning and 985.5 MB in the end (delta: -32.2 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. [2018-12-02 23:47:09,388 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:47:09,389 INFO L168 Benchmark]: CACSL2BoogieTranslator took 130.99 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 23:47:09,389 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.30 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:47:09,389 INFO L168 Benchmark]: Boogie Preprocessor took 43.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-12-02 23:47:09,389 INFO L168 Benchmark]: RCFGBuilder took 150.79 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-02 23:47:09,389 INFO L168 Benchmark]: TraceAbstraction took 1290.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 989.0 MB in the end (delta: 79.0 MB). Peak memory consumption was 79.0 MB. Max. memory is 11.5 GB. [2018-12-02 23:47:09,390 INFO L168 Benchmark]: Witness Printer took 54.09 ms. Allocated memory is still 1.1 GB. Free memory was 989.0 MB in the beginning and 985.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 23:47:09,391 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 130.99 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.30 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.0 MB). Free memory was 942.6 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 150.79 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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1290.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 989.0 MB in the end (delta: 79.0 MB). Peak memory consumption was 79.0 MB. Max. memory is 11.5 GB. * Witness Printer took 54.09 ms. Allocated memory is still 1.1 GB. Free memory was 989.0 MB in the beginning and 985.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 30]: 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, 35 locations, 1 error locations. SAFE Result, 1.2s OverallTime, 20 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1238 SDtfs, 574 SDslu, 829 SDs, 0 SdLazy, 107 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2056occurred in iteration=19, 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.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 530 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 138 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, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 383 ConstructedInterpolants, 0 QuantifiedInterpolants, 13856 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...