./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/thin002_tso.opt_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_tso.opt_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/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 e5c28b64dced7375be2011a670be7b0024d9ff8d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 19:48:03,651 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 19:48:03,652 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 19:48:03,658 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 19:48:03,658 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 19:48:03,659 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 19:48:03,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 19:48:03,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 19:48:03,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 19:48:03,661 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 19:48:03,662 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 19:48:03,662 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 19:48:03,662 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 19:48:03,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 19:48:03,663 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 19:48:03,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 19:48:03,664 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 19:48:03,665 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 19:48:03,666 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 19:48:03,667 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 19:48:03,667 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 19:48:03,668 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 19:48:03,669 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 19:48:03,669 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 19:48:03,669 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 19:48:03,670 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 19:48:03,670 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 19:48:03,670 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 19:48:03,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 19:48:03,671 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 19:48:03,671 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 19:48:03,672 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 19:48:03,672 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 19:48:03,672 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 19:48:03,673 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 19:48:03,673 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 19:48:03,673 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 19:48:03,680 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 19:48:03,680 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 19:48:03,681 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 19:48:03,681 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 19:48:03,681 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 19:48:03,681 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 19:48:03,681 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 19:48:03,681 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 19:48:03,681 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 19:48:03,682 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 19:48:03,682 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 19:48:03,682 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 19:48:03,682 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 19:48:03,682 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 19:48:03,682 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 19:48:03,682 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 19:48:03,682 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 19:48:03,683 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 19:48:03,683 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 19:48:03,683 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 19:48:03,683 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 19:48:03,683 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 19:48:03,683 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 19:48:03,683 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 19:48:03,683 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 19:48:03,683 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 19:48:03,683 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 19:48:03,683 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 19:48:03,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 19:48:03,684 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 19:48:03,684 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 19:48:03,684 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 19:48:03,684 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 19:48:03,684 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 19:48:03,684 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 19:48:03,684 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 19:48:03,684 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_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/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 -> e5c28b64dced7375be2011a670be7b0024d9ff8d [2018-12-02 19:48:03,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 19:48:03,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 19:48:03,710 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 19:48:03,711 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 19:48:03,711 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 19:48:03,711 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/thin002_tso.opt_true-unreach-call.i [2018-12-02 19:48:03,747 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/bin-2019/utaipan/data/bf9ec669c/022d45dfebc34cc0b590ebd954cf6674/FLAGb9d38da82 [2018-12-02 19:48:04,081 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 19:48:04,081 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/sv-benchmarks/c/pthread-wmm/thin002_tso.opt_true-unreach-call.i [2018-12-02 19:48:04,089 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/bin-2019/utaipan/data/bf9ec669c/022d45dfebc34cc0b590ebd954cf6674/FLAGb9d38da82 [2018-12-02 19:48:04,097 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/bin-2019/utaipan/data/bf9ec669c/022d45dfebc34cc0b590ebd954cf6674 [2018-12-02 19:48:04,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 19:48:04,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 19:48:04,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 19:48:04,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 19:48:04,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 19:48:04,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:48:04" (1/1) ... [2018-12-02 19:48:04,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c3629c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04, skipping insertion in model container [2018-12-02 19:48:04,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 07:48:04" (1/1) ... [2018-12-02 19:48:04,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 19:48:04,129 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 19:48:04,292 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 19:48:04,300 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 19:48:04,366 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 19:48:04,398 INFO L195 MainTranslator]: Completed translation [2018-12-02 19:48:04,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04 WrapperNode [2018-12-02 19:48:04,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 19:48:04,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 19:48:04,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 19:48:04,400 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 19:48:04,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04" (1/1) ... [2018-12-02 19:48:04,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04" (1/1) ... [2018-12-02 19:48:04,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 19:48:04,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 19:48:04,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 19:48:04,428 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 19:48:04,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04" (1/1) ... [2018-12-02 19:48:04,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04" (1/1) ... [2018-12-02 19:48:04,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04" (1/1) ... [2018-12-02 19:48:04,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04" (1/1) ... [2018-12-02 19:48:04,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04" (1/1) ... [2018-12-02 19:48:04,441 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04" (1/1) ... [2018-12-02 19:48:04,442 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04" (1/1) ... [2018-12-02 19:48:04,444 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 19:48:04,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 19:48:04,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 19:48:04,444 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 19:48:04,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/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-12-02 19:48:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 19:48:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 19:48:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 19:48:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 19:48:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 19:48:04,483 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 19:48:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 19:48:04,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 19:48:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 19:48:04,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 19:48:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2018-12-02 19:48:04,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2018-12-02 19:48:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 19:48:04,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 19:48:04,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 19:48:04,485 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 19:48:04,649 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 19:48:04,649 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-02 19:48:04,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:48:04 BoogieIcfgContainer [2018-12-02 19:48:04,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 19:48:04,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 19:48:04,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 19:48:04,652 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 19:48:04,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 07:48:04" (1/3) ... [2018-12-02 19:48:04,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9db283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:48:04, skipping insertion in model container [2018-12-02 19:48:04,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 07:48:04" (2/3) ... [2018-12-02 19:48:04,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b9db283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 07:48:04, skipping insertion in model container [2018-12-02 19:48:04,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:48:04" (3/3) ... [2018-12-02 19:48:04,654 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_tso.opt_true-unreach-call.i [2018-12-02 19:48:04,674 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,674 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,674 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,674 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,675 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,675 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,675 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,675 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,676 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,676 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,676 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,676 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,676 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,677 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,677 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,677 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,677 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,677 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,677 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,677 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,677 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,677 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,677 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,678 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,678 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,678 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,678 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,678 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,678 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 19:48:04,685 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 19:48:04,685 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 19:48:04,690 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 19:48:04,699 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 19:48:04,714 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 19:48:04,714 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 19:48:04,714 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 19:48:04,714 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 19:48:04,714 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 19:48:04,714 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 19:48:04,714 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 19:48:04,714 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 19:48:04,719 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70places, 66 transitions [2018-12-02 19:48:05,347 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13138 states. [2018-12-02 19:48:05,349 INFO L276 IsEmpty]: Start isEmpty. Operand 13138 states. [2018-12-02 19:48:05,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 19:48:05,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:48:05,365 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:48:05,367 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:48:05,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:48:05,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1445141644, now seen corresponding path program 1 times [2018-12-02 19:48:05,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:48:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:05,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:48:05,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:05,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:48:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:48:05,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:48:05,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:48:05,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 19:48:05,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:48:05,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 19:48:05,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 19:48:05,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 19:48:05,549 INFO L87 Difference]: Start difference. First operand 13138 states. Second operand 4 states. [2018-12-02 19:48:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:48:05,678 INFO L93 Difference]: Finished difference Result 13744 states and 55795 transitions. [2018-12-02 19:48:05,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 19:48:05,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-02 19:48:05,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:48:05,709 INFO L225 Difference]: With dead ends: 13744 [2018-12-02 19:48:05,710 INFO L226 Difference]: Without dead ends: 5631 [2018-12-02 19:48:05,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:48:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2018-12-02 19:48:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 5631. [2018-12-02 19:48:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5631 states. [2018-12-02 19:48:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5631 states to 5631 states and 22354 transitions. [2018-12-02 19:48:05,862 INFO L78 Accepts]: Start accepts. Automaton has 5631 states and 22354 transitions. Word has length 37 [2018-12-02 19:48:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:48:05,863 INFO L480 AbstractCegarLoop]: Abstraction has 5631 states and 22354 transitions. [2018-12-02 19:48:05,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 19:48:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 5631 states and 22354 transitions. [2018-12-02 19:48:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-02 19:48:05,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:48:05,867 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:48:05,867 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:48:05,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:48:05,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1883999228, now seen corresponding path program 1 times [2018-12-02 19:48:05,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:48:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:05,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:48:05,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:05,870 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:48:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:48:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:48:05,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:48:05,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 19:48:05,916 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:48:05,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 19:48:05,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 19:48:05,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 19:48:05,917 INFO L87 Difference]: Start difference. First operand 5631 states and 22354 transitions. Second operand 5 states. [2018-12-02 19:48:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:48:05,998 INFO L93 Difference]: Finished difference Result 6143 states and 23834 transitions. [2018-12-02 19:48:05,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 19:48:05,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-02 19:48:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:48:06,016 INFO L225 Difference]: With dead ends: 6143 [2018-12-02 19:48:06,017 INFO L226 Difference]: Without dead ends: 5519 [2018-12-02 19:48:06,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:48:06,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2018-12-02 19:48:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 5519. [2018-12-02 19:48:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5519 states. [2018-12-02 19:48:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5519 states to 5519 states and 21822 transitions. [2018-12-02 19:48:06,157 INFO L78 Accepts]: Start accepts. Automaton has 5519 states and 21822 transitions. Word has length 38 [2018-12-02 19:48:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:48:06,157 INFO L480 AbstractCegarLoop]: Abstraction has 5519 states and 21822 transitions. [2018-12-02 19:48:06,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 19:48:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 5519 states and 21822 transitions. [2018-12-02 19:48:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 19:48:06,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:48:06,161 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:48:06,162 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:48:06,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:48:06,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1586589234, now seen corresponding path program 1 times [2018-12-02 19:48:06,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:48:06,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:06,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:48:06,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:06,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:48:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:48:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:48:06,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:48:06,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 19:48:06,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:48:06,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 19:48:06,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 19:48:06,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 19:48:06,203 INFO L87 Difference]: Start difference. First operand 5519 states and 21822 transitions. Second operand 6 states. [2018-12-02 19:48:06,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:48:06,294 INFO L93 Difference]: Finished difference Result 5455 states and 20830 transitions. [2018-12-02 19:48:06,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 19:48:06,294 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-12-02 19:48:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:48:06,313 INFO L225 Difference]: With dead ends: 5455 [2018-12-02 19:48:06,313 INFO L226 Difference]: Without dead ends: 4847 [2018-12-02 19:48:06,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 19:48:06,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2018-12-02 19:48:06,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 4847. [2018-12-02 19:48:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4847 states. [2018-12-02 19:48:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4847 states to 4847 states and 18798 transitions. [2018-12-02 19:48:06,395 INFO L78 Accepts]: Start accepts. Automaton has 4847 states and 18798 transitions. Word has length 39 [2018-12-02 19:48:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:48:06,396 INFO L480 AbstractCegarLoop]: Abstraction has 4847 states and 18798 transitions. [2018-12-02 19:48:06,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 19:48:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 4847 states and 18798 transitions. [2018-12-02 19:48:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 19:48:06,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:48:06,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:48:06,400 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:48:06,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:48:06,400 INFO L82 PathProgramCache]: Analyzing trace with hash 2117960818, now seen corresponding path program 1 times [2018-12-02 19:48:06,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:48:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:06,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:48:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:06,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:48:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:48:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:48:06,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:48:06,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 19:48:06,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:48:06,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 19:48:06,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 19:48:06,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:48:06,458 INFO L87 Difference]: Start difference. First operand 4847 states and 18798 transitions. Second operand 7 states. [2018-12-02 19:48:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:48:06,529 INFO L93 Difference]: Finished difference Result 3567 states and 13038 transitions. [2018-12-02 19:48:06,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 19:48:06,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2018-12-02 19:48:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:48:06,538 INFO L225 Difference]: With dead ends: 3567 [2018-12-02 19:48:06,538 INFO L226 Difference]: Without dead ends: 3055 [2018-12-02 19:48:06,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-02 19:48:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2018-12-02 19:48:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3055. [2018-12-02 19:48:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3055 states. [2018-12-02 19:48:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 11182 transitions. [2018-12-02 19:48:06,585 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 11182 transitions. Word has length 40 [2018-12-02 19:48:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:48:06,586 INFO L480 AbstractCegarLoop]: Abstraction has 3055 states and 11182 transitions. [2018-12-02 19:48:06,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 19:48:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 11182 transitions. [2018-12-02 19:48:06,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 19:48:06,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:48:06,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:48:06,589 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:48:06,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:48:06,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2066804268, now seen corresponding path program 1 times [2018-12-02 19:48:06,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:48:06,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:06,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:48:06,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:06,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:48:06,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:48:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:48:06,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:48:06,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 19:48:06,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:48:06,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 19:48:06,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 19:48:06,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-02 19:48:06,713 INFO L87 Difference]: Start difference. First operand 3055 states and 11182 transitions. Second operand 12 states. [2018-12-02 19:48:06,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:48:06,880 INFO L93 Difference]: Finished difference Result 5279 states and 19302 transitions. [2018-12-02 19:48:06,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 19:48:06,880 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-12-02 19:48:06,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:48:06,886 INFO L225 Difference]: With dead ends: 5279 [2018-12-02 19:48:06,886 INFO L226 Difference]: Without dead ends: 3003 [2018-12-02 19:48:06,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-12-02 19:48:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2018-12-02 19:48:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 3003. [2018-12-02 19:48:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3003 states. [2018-12-02 19:48:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3003 states to 3003 states and 11022 transitions. [2018-12-02 19:48:06,926 INFO L78 Accepts]: Start accepts. Automaton has 3003 states and 11022 transitions. Word has length 41 [2018-12-02 19:48:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:48:06,927 INFO L480 AbstractCegarLoop]: Abstraction has 3003 states and 11022 transitions. [2018-12-02 19:48:06,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 19:48:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 3003 states and 11022 transitions. [2018-12-02 19:48:06,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 19:48:06,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:48:06,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:48:06,929 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:48:06,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:48:06,930 INFO L82 PathProgramCache]: Analyzing trace with hash -994845904, now seen corresponding path program 2 times [2018-12-02 19:48:06,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:48:06,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:06,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:48:06,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:06,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:48:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:48:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:48:06,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:48:06,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 19:48:06,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:48:06,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 19:48:06,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 19:48:06,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:48:06,978 INFO L87 Difference]: Start difference. First operand 3003 states and 11022 transitions. Second operand 7 states. [2018-12-02 19:48:07,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:48:07,064 INFO L93 Difference]: Finished difference Result 4923 states and 18158 transitions. [2018-12-02 19:48:07,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 19:48:07,065 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-02 19:48:07,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:48:07,071 INFO L225 Difference]: With dead ends: 4923 [2018-12-02 19:48:07,071 INFO L226 Difference]: Without dead ends: 2663 [2018-12-02 19:48:07,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 19:48:07,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2018-12-02 19:48:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2663. [2018-12-02 19:48:07,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2663 states. [2018-12-02 19:48:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 9870 transitions. [2018-12-02 19:48:07,117 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 9870 transitions. Word has length 41 [2018-12-02 19:48:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:48:07,117 INFO L480 AbstractCegarLoop]: Abstraction has 2663 states and 9870 transitions. [2018-12-02 19:48:07,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 19:48:07,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 9870 transitions. [2018-12-02 19:48:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 19:48:07,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:48:07,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:48:07,119 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:48:07,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:48:07,119 INFO L82 PathProgramCache]: Analyzing trace with hash 2040016274, now seen corresponding path program 3 times [2018-12-02 19:48:07,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:48:07,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:07,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 19:48:07,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:07,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:48:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:48:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:48:07,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:48:07,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 19:48:07,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:48:07,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 19:48:07,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 19:48:07,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 19:48:07,173 INFO L87 Difference]: Start difference. First operand 2663 states and 9870 transitions. Second operand 7 states. [2018-12-02 19:48:07,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:48:07,235 INFO L93 Difference]: Finished difference Result 4263 states and 15966 transitions. [2018-12-02 19:48:07,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 19:48:07,236 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-12-02 19:48:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:48:07,239 INFO L225 Difference]: With dead ends: 4263 [2018-12-02 19:48:07,239 INFO L226 Difference]: Without dead ends: 2263 [2018-12-02 19:48:07,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 19:48:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2263 states. [2018-12-02 19:48:07,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2263 to 2263. [2018-12-02 19:48:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2263 states. [2018-12-02 19:48:07,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 8530 transitions. [2018-12-02 19:48:07,264 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 8530 transitions. Word has length 41 [2018-12-02 19:48:07,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:48:07,264 INFO L480 AbstractCegarLoop]: Abstraction has 2263 states and 8530 transitions. [2018-12-02 19:48:07,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 19:48:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 8530 transitions. [2018-12-02 19:48:07,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 19:48:07,265 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:48:07,265 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:48:07,265 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:48:07,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:48:07,265 INFO L82 PathProgramCache]: Analyzing trace with hash -390113582, now seen corresponding path program 4 times [2018-12-02 19:48:07,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:48:07,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:07,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 19:48:07,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:07,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:48:07,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:48:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:48:07,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:48:07,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-02 19:48:07,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:48:07,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 19:48:07,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 19:48:07,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-12-02 19:48:07,374 INFO L87 Difference]: Start difference. First operand 2263 states and 8530 transitions. Second operand 12 states. [2018-12-02 19:48:07,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:48:07,495 INFO L93 Difference]: Finished difference Result 3879 states and 14666 transitions. [2018-12-02 19:48:07,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 19:48:07,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-12-02 19:48:07,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:48:07,498 INFO L225 Difference]: With dead ends: 3879 [2018-12-02 19:48:07,498 INFO L226 Difference]: Without dead ends: 2243 [2018-12-02 19:48:07,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-12-02 19:48:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2018-12-02 19:48:07,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2243. [2018-12-02 19:48:07,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2018-12-02 19:48:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 8490 transitions. [2018-12-02 19:48:07,525 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 8490 transitions. Word has length 41 [2018-12-02 19:48:07,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:48:07,525 INFO L480 AbstractCegarLoop]: Abstraction has 2243 states and 8490 transitions. [2018-12-02 19:48:07,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 19:48:07,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 8490 transitions. [2018-12-02 19:48:07,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 19:48:07,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 19:48:07,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 19:48:07,526 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 19:48:07,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 19:48:07,527 INFO L82 PathProgramCache]: Analyzing trace with hash -663323788, now seen corresponding path program 5 times [2018-12-02 19:48:07,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 19:48:07,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:07,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 19:48:07,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 19:48:07,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 19:48:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 19:48:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 19:48:07,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 19:48:07,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 19:48:07,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 19:48:07,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 19:48:07,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 19:48:07,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 19:48:07,605 INFO L87 Difference]: Start difference. First operand 2243 states and 8490 transitions. Second operand 8 states. [2018-12-02 19:48:07,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 19:48:07,701 INFO L93 Difference]: Finished difference Result 1731 states and 6442 transitions. [2018-12-02 19:48:07,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 19:48:07,701 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-12-02 19:48:07,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 19:48:07,701 INFO L225 Difference]: With dead ends: 1731 [2018-12-02 19:48:07,702 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 19:48:07,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-02 19:48:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 19:48:07,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 19:48:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 19:48:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 19:48:07,702 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-12-02 19:48:07,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 19:48:07,702 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 19:48:07,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 19:48:07,702 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 19:48:07,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 19:48:07,704 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 19:48:07,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 07:48:07 BasicIcfg [2018-12-02 19:48:07,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 19:48:07,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 19:48:07,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 19:48:07,706 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 19:48:07,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 07:48:04" (3/4) ... [2018-12-02 19:48:07,709 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 19:48:07,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2018-12-02 19:48:07,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2018-12-02 19:48:07,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2018-12-02 19:48:07,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2018-12-02 19:48:07,717 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-02 19:48:07,718 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 19:48:07,753 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4ea70cf7-c19a-498e-94fd-eeb4cf311b52/bin-2019/utaipan/witness.graphml [2018-12-02 19:48:07,753 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 19:48:07,753 INFO L168 Benchmark]: Toolchain (without parser) took 3654.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 948.1 MB in the beginning and 841.8 MB in the end (delta: 106.3 MB). Peak memory consumption was 279.3 MB. Max. memory is 11.5 GB. [2018-12-02 19:48:07,755 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 19:48:07,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -125.7 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2018-12-02 19:48:07,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 19:48:07,756 INFO L168 Benchmark]: Boogie Preprocessor took 16.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 19:48:07,756 INFO L168 Benchmark]: RCFGBuilder took 205.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 19:48:07,757 INFO L168 Benchmark]: TraceAbstraction took 3055.55 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.0 GB in the beginning and 848.6 MB in the end (delta: 194.7 MB). Peak memory consumption was 272.3 MB. Max. memory is 11.5 GB. [2018-12-02 19:48:07,757 INFO L168 Benchmark]: Witness Printer took 46.82 ms. Allocated memory is still 1.2 GB. Free memory was 848.6 MB in the beginning and 841.8 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 19:48:07,759 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -125.7 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.07 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.05 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 205.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3055.55 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 77.6 MB). Free memory was 1.0 GB in the beginning and 848.6 MB in the end (delta: 194.7 MB). Peak memory consumption was 272.3 MB. Max. memory is 11.5 GB. * Witness Printer took 46.82 ms. Allocated memory is still 1.2 GB. Free memory was 848.6 MB in the beginning and 841.8 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 90 locations, 1 error locations. SAFE Result, 2.9s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 712 SDtfs, 1190 SDslu, 3013 SDs, 0 SdLazy, 409 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13138occurred in iteration=0, 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.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 50310 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...