./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 21:57:23,717 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 21:57:23,718 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 21:57:23,726 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 21:57:23,726 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 21:57:23,726 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 21:57:23,727 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 21:57:23,728 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 21:57:23,729 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 21:57:23,730 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 21:57:23,731 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 21:57:23,731 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 21:57:23,731 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 21:57:23,732 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 21:57:23,733 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 21:57:23,733 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 21:57:23,734 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 21:57:23,735 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 21:57:23,736 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 21:57:23,737 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 21:57:23,738 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 21:57:23,739 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 21:57:23,740 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 21:57:23,741 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 21:57:23,741 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 21:57:23,741 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 21:57:23,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 21:57:23,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 21:57:23,743 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 21:57:23,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 21:57:23,744 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 21:57:23,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 21:57:23,745 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 21:57:23,745 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 21:57:23,745 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 21:57:23,746 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 21:57:23,746 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 21:57:23,756 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 21:57:23,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 21:57:23,757 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 21:57:23,757 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 21:57:23,757 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 21:57:23,757 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 21:57:23,757 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 21:57:23,758 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 21:57:23,758 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 21:57:23,758 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 21:57:23,758 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 21:57:23,758 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 21:57:23,758 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 21:57:23,759 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 21:57:23,759 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 21:57:23,759 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 21:57:23,759 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 21:57:23,759 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 21:57:23,759 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 21:57:23,760 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 21:57:23,760 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 21:57:23,760 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 21:57:23,760 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 21:57:23,760 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 21:57:23,760 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 21:57:23,760 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 21:57:23,761 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 21:57:23,761 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 21:57:23,761 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 21:57:23,761 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:57:23,761 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 21:57:23,761 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 21:57:23,761 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 21:57:23,762 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 21:57:23,762 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 21:57:23,762 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 21:57:23,762 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 21:57:23,762 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan 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 -> Taipan 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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2018-11-22 21:57:23,784 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 21:57:23,792 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 21:57:23,794 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 21:57:23,795 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 21:57:23,795 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 21:57:23,796 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 21:57:23,830 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan/data/a68f9b640/28cc9fe5f87e4ce0b0c7d1c04f72162c/FLAG6e859a553 [2018-11-22 21:57:24,230 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 21:57:24,231 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 21:57:24,235 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan/data/a68f9b640/28cc9fe5f87e4ce0b0c7d1c04f72162c/FLAG6e859a553 [2018-11-22 21:57:24,243 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan/data/a68f9b640/28cc9fe5f87e4ce0b0c7d1c04f72162c [2018-11-22 21:57:24,245 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 21:57:24,246 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 21:57:24,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 21:57:24,247 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 21:57:24,249 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 21:57:24,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:57:24" (1/1) ... [2018-11-22 21:57:24,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cfd07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24, skipping insertion in model container [2018-11-22 21:57:24,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:57:24" (1/1) ... [2018-11-22 21:57:24,257 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 21:57:24,269 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 21:57:24,378 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:57:24,380 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 21:57:24,393 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 21:57:24,401 INFO L195 MainTranslator]: Completed translation [2018-11-22 21:57:24,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24 WrapperNode [2018-11-22 21:57:24,402 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 21:57:24,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 21:57:24,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 21:57:24,402 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 21:57:24,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24" (1/1) ... [2018-11-22 21:57:24,410 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24" (1/1) ... [2018-11-22 21:57:24,414 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 21:57:24,414 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 21:57:24,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 21:57:24,414 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 21:57:24,420 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24" (1/1) ... [2018-11-22 21:57:24,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24" (1/1) ... [2018-11-22 21:57:24,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24" (1/1) ... [2018-11-22 21:57:24,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24" (1/1) ... [2018-11-22 21:57:24,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24" (1/1) ... [2018-11-22 21:57:24,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24" (1/1) ... [2018-11-22 21:57:24,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24" (1/1) ... [2018-11-22 21:57:24,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 21:57:24,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 21:57:24,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 21:57:24,429 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 21:57:24,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 21:57:24,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 21:57:24,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 21:57:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 21:57:24,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 21:57:24,497 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 21:57:24,497 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 21:57:24,631 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 21:57:24,632 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-22 21:57:24,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:57:24 BoogieIcfgContainer [2018-11-22 21:57:24,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 21:57:24,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 21:57:24,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 21:57:24,634 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 21:57:24,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:57:24" (1/3) ... [2018-11-22 21:57:24,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb243f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:57:24, skipping insertion in model container [2018-11-22 21:57:24,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:57:24" (2/3) ... [2018-11-22 21:57:24,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb243f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:57:24, skipping insertion in model container [2018-11-22 21:57:24,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:57:24" (3/3) ... [2018-11-22 21:57:24,637 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-22 21:57:24,643 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 21:57:24,647 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 21:57:24,656 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 21:57:24,673 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 21:57:24,674 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 21:57:24,674 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 21:57:24,674 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 21:57:24,674 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 21:57:24,674 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 21:57:24,674 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 21:57:24,674 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 21:57:24,685 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-22 21:57:24,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-22 21:57:24,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:24,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:24,690 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:24,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:24,693 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2018-11-22 21:57:24,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:24,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:24,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:24,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:24,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:24,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:24,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:24,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:24,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:24,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:24,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:24,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:24,806 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-11-22 21:57:24,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:24,837 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2018-11-22 21:57:24,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:24,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-22 21:57:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:24,845 INFO L225 Difference]: With dead ends: 57 [2018-11-22 21:57:24,845 INFO L226 Difference]: Without dead ends: 42 [2018-11-22 21:57:24,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:24,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-22 21:57:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-11-22 21:57:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-22 21:57:24,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-11-22 21:57:24,871 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2018-11-22 21:57:24,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:24,872 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-11-22 21:57:24,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:24,872 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-11-22 21:57:24,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-22 21:57:24,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:24,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:24,873 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:24,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2018-11-22 21:57:24,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:24,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:24,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:24,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:24,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:24,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:24,906 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:24,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:24,906 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:24,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:24,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:24,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:24,908 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2018-11-22 21:57:24,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:24,937 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2018-11-22 21:57:24,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:24,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-22 21:57:24,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:24,938 INFO L225 Difference]: With dead ends: 67 [2018-11-22 21:57:24,938 INFO L226 Difference]: Without dead ends: 42 [2018-11-22 21:57:24,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:24,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-22 21:57:24,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-11-22 21:57:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-22 21:57:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2018-11-22 21:57:24,942 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2018-11-22 21:57:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:24,943 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2018-11-22 21:57:24,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:24,943 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2018-11-22 21:57:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-22 21:57:24,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:24,944 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:24,944 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:24,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2018-11-22 21:57:24,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:24,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:24,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:24,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:24,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:24,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:24,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:24,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:24,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:24,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:24,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:24,974 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2018-11-22 21:57:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:24,989 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2018-11-22 21:57:24,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:24,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-22 21:57:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:24,990 INFO L225 Difference]: With dead ends: 63 [2018-11-22 21:57:24,990 INFO L226 Difference]: Without dead ends: 45 [2018-11-22 21:57:24,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:24,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-22 21:57:24,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-22 21:57:24,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-22 21:57:24,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2018-11-22 21:57:24,994 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2018-11-22 21:57:24,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:24,994 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2018-11-22 21:57:24,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2018-11-22 21:57:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-22 21:57:24,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:24,995 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:24,995 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:24,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:24,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2018-11-22 21:57:24,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:24,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:24,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:24,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:24,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:25,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:25,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:25,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:25,016 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:25,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:25,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:25,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,017 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2018-11-22 21:57:25,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:25,034 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2018-11-22 21:57:25,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:25,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-22 21:57:25,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:25,036 INFO L225 Difference]: With dead ends: 76 [2018-11-22 21:57:25,036 INFO L226 Difference]: Without dead ends: 74 [2018-11-22 21:57:25,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-22 21:57:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2018-11-22 21:57:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-22 21:57:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2018-11-22 21:57:25,040 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2018-11-22 21:57:25,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:25,040 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2018-11-22 21:57:25,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:25,041 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2018-11-22 21:57:25,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-22 21:57:25,041 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:25,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:25,041 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:25,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:25,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2018-11-22 21:57:25,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:25,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:25,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:25,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:25,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:25,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:25,066 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:25,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:25,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:25,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,067 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2018-11-22 21:57:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:25,089 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2018-11-22 21:57:25,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:25,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-22 21:57:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:25,090 INFO L225 Difference]: With dead ends: 124 [2018-11-22 21:57:25,090 INFO L226 Difference]: Without dead ends: 76 [2018-11-22 21:57:25,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-22 21:57:25,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-11-22 21:57:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-22 21:57:25,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2018-11-22 21:57:25,095 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2018-11-22 21:57:25,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:25,096 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2018-11-22 21:57:25,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:25,096 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2018-11-22 21:57:25,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 21:57:25,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:25,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:25,096 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:25,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:25,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2018-11-22 21:57:25,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:25,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:25,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:25,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:25,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:25,115 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:25,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:25,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:25,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,115 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2018-11-22 21:57:25,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:25,133 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2018-11-22 21:57:25,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:25,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-22 21:57:25,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:25,135 INFO L225 Difference]: With dead ends: 111 [2018-11-22 21:57:25,135 INFO L226 Difference]: Without dead ends: 78 [2018-11-22 21:57:25,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-22 21:57:25,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-22 21:57:25,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-22 21:57:25,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2018-11-22 21:57:25,142 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2018-11-22 21:57:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:25,143 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2018-11-22 21:57:25,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2018-11-22 21:57:25,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 21:57:25,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:25,143 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:25,144 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:25,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:25,144 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2018-11-22 21:57:25,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:25,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:25,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:25,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:25,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:25,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:25,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:25,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,168 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2018-11-22 21:57:25,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:25,180 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2018-11-22 21:57:25,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:25,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-22 21:57:25,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:25,181 INFO L225 Difference]: With dead ends: 132 [2018-11-22 21:57:25,181 INFO L226 Difference]: Without dead ends: 130 [2018-11-22 21:57:25,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-22 21:57:25,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2018-11-22 21:57:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-22 21:57:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2018-11-22 21:57:25,187 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2018-11-22 21:57:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:25,187 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2018-11-22 21:57:25,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2018-11-22 21:57:25,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 21:57:25,188 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:25,188 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:25,188 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:25,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:25,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2018-11-22 21:57:25,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:25,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:25,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,190 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:25,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:25,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:25,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:25,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:25,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:25,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:25,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:25,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,207 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2018-11-22 21:57:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:25,226 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2018-11-22 21:57:25,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:25,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-22 21:57:25,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:25,227 INFO L225 Difference]: With dead ends: 232 [2018-11-22 21:57:25,227 INFO L226 Difference]: Without dead ends: 138 [2018-11-22 21:57:25,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-22 21:57:25,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-11-22 21:57:25,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-22 21:57:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2018-11-22 21:57:25,238 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2018-11-22 21:57:25,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:25,238 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2018-11-22 21:57:25,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:25,238 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2018-11-22 21:57:25,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:57:25,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:25,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:25,239 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:25,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:25,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2018-11-22 21:57:25,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:25,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,240 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:25,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:25,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:25,266 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:25,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:25,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:25,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,267 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2018-11-22 21:57:25,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:25,293 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2018-11-22 21:57:25,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:25,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-22 21:57:25,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:25,295 INFO L225 Difference]: With dead ends: 204 [2018-11-22 21:57:25,295 INFO L226 Difference]: Without dead ends: 142 [2018-11-22 21:57:25,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-11-22 21:57:25,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-11-22 21:57:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-11-22 21:57:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2018-11-22 21:57:25,307 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2018-11-22 21:57:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:25,307 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2018-11-22 21:57:25,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2018-11-22 21:57:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:57:25,308 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:25,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:25,310 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:25,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:25,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2018-11-22 21:57:25,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:25,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:25,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:25,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:25,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:25,328 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:25,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:25,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:25,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,329 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2018-11-22 21:57:25,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:25,342 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2018-11-22 21:57:25,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:25,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-22 21:57:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:25,345 INFO L225 Difference]: With dead ends: 236 [2018-11-22 21:57:25,345 INFO L226 Difference]: Without dead ends: 234 [2018-11-22 21:57:25,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-11-22 21:57:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2018-11-22 21:57:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-11-22 21:57:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2018-11-22 21:57:25,357 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2018-11-22 21:57:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:25,358 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2018-11-22 21:57:25,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2018-11-22 21:57:25,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 21:57:25,359 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:25,359 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:25,359 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:25,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:25,359 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2018-11-22 21:57:25,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:25,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:25,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:25,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:25,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:25,394 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:25,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:25,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:25,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,395 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2018-11-22 21:57:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:25,413 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2018-11-22 21:57:25,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:25,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-22 21:57:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:25,414 INFO L225 Difference]: With dead ends: 444 [2018-11-22 21:57:25,414 INFO L226 Difference]: Without dead ends: 258 [2018-11-22 21:57:25,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-11-22 21:57:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-11-22 21:57:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-22 21:57:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2018-11-22 21:57:25,425 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2018-11-22 21:57:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:25,425 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2018-11-22 21:57:25,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2018-11-22 21:57:25,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 21:57:25,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:25,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:25,426 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:25,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:25,426 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2018-11-22 21:57:25,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:25,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:25,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:25,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:25,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:25,450 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:25,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:25,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:25,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,451 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2018-11-22 21:57:25,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:25,466 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2018-11-22 21:57:25,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:25,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-22 21:57:25,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:25,467 INFO L225 Difference]: With dead ends: 384 [2018-11-22 21:57:25,467 INFO L226 Difference]: Without dead ends: 266 [2018-11-22 21:57:25,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-11-22 21:57:25,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-11-22 21:57:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-11-22 21:57:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2018-11-22 21:57:25,474 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2018-11-22 21:57:25,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:25,474 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2018-11-22 21:57:25,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2018-11-22 21:57:25,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 21:57:25,475 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:25,475 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:25,475 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:25,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:25,475 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2018-11-22 21:57:25,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:25,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:25,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,476 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:25,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-11-22 21:57:25,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:25,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:25,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:25,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:25,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:25,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,487 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2018-11-22 21:57:25,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:25,506 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2018-11-22 21:57:25,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:25,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-22 21:57:25,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:25,509 INFO L225 Difference]: With dead ends: 426 [2018-11-22 21:57:25,509 INFO L226 Difference]: Without dead ends: 424 [2018-11-22 21:57:25,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-11-22 21:57:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2018-11-22 21:57:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-11-22 21:57:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2018-11-22 21:57:25,523 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2018-11-22 21:57:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:25,524 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2018-11-22 21:57:25,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:25,524 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2018-11-22 21:57:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-22 21:57:25,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 21:57:25,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 21:57:25,525 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 21:57:25,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 21:57:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2018-11-22 21:57:25,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 21:57:25,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 21:57:25,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 21:57:25,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 21:57:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 21:57:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 21:57:25,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 21:57:25,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 21:57:25,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 21:57:25,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 21:57:25,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 21:57:25,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,546 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2018-11-22 21:57:25,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 21:57:25,567 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2018-11-22 21:57:25,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 21:57:25,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-22 21:57:25,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 21:57:25,568 INFO L225 Difference]: With dead ends: 856 [2018-11-22 21:57:25,568 INFO L226 Difference]: Without dead ends: 0 [2018-11-22 21:57:25,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 21:57:25,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-22 21:57:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-22 21:57:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-22 21:57:25,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-22 21:57:25,570 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-11-22 21:57:25,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 21:57:25,571 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-22 21:57:25,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 21:57:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-22 21:57:25,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-22 21:57:25,574 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-22 21:57:25,589 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-22 21:57:25,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:57:25,589 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-22 21:57:25,589 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-22 21:57:25,589 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L451 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L448 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2018-11-22 21:57:25,590 INFO L451 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2018-11-22 21:57:25,591 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-22 21:57:25,591 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2018-11-22 21:57:25,591 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2018-11-22 21:57:25,591 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2018-11-22 21:57:25,591 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-11-22 21:57:25,591 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-22 21:57:25,591 INFO L444 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2018-11-22 21:57:25,591 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2018-11-22 21:57:25,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:57:25 BoogieIcfgContainer [2018-11-22 21:57:25,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 21:57:25,596 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 21:57:25,596 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 21:57:25,596 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 21:57:25,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:57:24" (3/4) ... [2018-11-22 21:57:25,599 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-22 21:57:25,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-22 21:57:25,603 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-22 21:57:25,605 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-22 21:57:25,606 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-22 21:57:25,606 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-22 21:57:25,640 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a9f45e48-635d-4390-bb58-88450071a680/bin-2019/utaipan/witness.graphml [2018-11-22 21:57:25,640 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 21:57:25,641 INFO L168 Benchmark]: Toolchain (without parser) took 1395.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 958.2 MB in the beginning and 969.2 MB in the end (delta: -11.0 MB). Peak memory consumption was 117.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:57:25,642 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:57:25,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 155.11 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:57:25,642 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.14 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 21:57:25,643 INFO L168 Benchmark]: Boogie Preprocessor took 14.21 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 21:57:25,643 INFO L168 Benchmark]: RCFGBuilder took 203.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-22 21:57:25,643 INFO L168 Benchmark]: TraceAbstraction took 962.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.6 MB in the end (delta: 134.3 MB). Peak memory consumption was 134.3 MB. Max. memory is 11.5 GB. [2018-11-22 21:57:25,643 INFO L168 Benchmark]: Witness Printer took 44.62 ms. Allocated memory is still 1.2 GB. Free memory was 974.6 MB in the beginning and 969.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-22 21:57:25,645 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 155.11 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 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.14 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.21 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 203.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 962.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 974.6 MB in the end (delta: 134.3 MB). Peak memory consumption was 134.3 MB. Max. memory is 11.5 GB. * Witness Printer took 44.62 ms. Allocated memory is still 1.2 GB. Free memory was 974.6 MB in the beginning and 969.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 91]: 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: 24]: 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, 29 locations, 1 error locations. SAFE Result, 0.9s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, 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.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 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, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...