./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-atomic/lamport_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_a415c82f-07b2-40b0-9282-e1b9d29e2351/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-atomic/lamport_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/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 66ad1ff9e8f4055d6bc44dc751cea83862f50a74 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 23:25:27,424 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 23:25:27,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 23:25:27,431 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 23:25:27,431 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 23:25:27,432 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 23:25:27,432 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 23:25:27,433 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 23:25:27,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 23:25:27,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 23:25:27,435 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 23:25:27,435 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 23:25:27,435 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 23:25:27,436 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 23:25:27,436 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 23:25:27,437 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 23:25:27,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 23:25:27,438 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 23:25:27,439 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 23:25:27,439 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 23:25:27,440 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 23:25:27,440 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 23:25:27,442 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 23:25:27,442 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 23:25:27,442 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 23:25:27,442 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 23:25:27,443 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 23:25:27,443 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 23:25:27,444 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 23:25:27,444 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 23:25:27,444 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 23:25:27,444 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 23:25:27,445 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 23:25:27,445 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 23:25:27,445 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 23:25:27,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 23:25:27,446 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 23:25:27,453 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 23:25:27,453 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 23:25:27,453 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 23:25:27,454 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 23:25:27,454 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 23:25:27,454 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 23:25:27,454 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 23:25:27,454 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 23:25:27,454 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 23:25:27,454 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 23:25:27,454 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 23:25:27,454 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 23:25:27,454 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 23:25:27,455 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 23:25:27,455 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 23:25:27,455 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 23:25:27,455 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 23:25:27,455 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 23:25:27,455 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 23:25:27,455 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 23:25:27,455 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 23:25:27,455 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 23:25:27,456 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 23:25:27,456 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 23:25:27,456 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 23:25:27,456 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 23:25:27,456 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 23:25:27,456 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 23:25:27,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:25:27,456 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 23:25:27,456 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 23:25:27,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 23:25:27,457 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 23:25:27,457 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 23:25:27,457 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 23:25:27,457 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 23:25:27,457 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_a415c82f-07b2-40b0-9282-e1b9d29e2351/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 -> 66ad1ff9e8f4055d6bc44dc751cea83862f50a74 [2018-12-02 23:25:27,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 23:25:27,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 23:25:27,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 23:25:27,483 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 23:25:27,483 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 23:25:27,484 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/bin-2019/utaipan/../../sv-benchmarks/c/pthread-atomic/lamport_true-unreach-call.i [2018-12-02 23:25:27,518 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/bin-2019/utaipan/data/30773f5ef/ee134faa84334c998cce26b8acad131d/FLAG49131249b [2018-12-02 23:25:27,920 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 23:25:27,920 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/sv-benchmarks/c/pthread-atomic/lamport_true-unreach-call.i [2018-12-02 23:25:27,926 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/bin-2019/utaipan/data/30773f5ef/ee134faa84334c998cce26b8acad131d/FLAG49131249b [2018-12-02 23:25:27,935 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/bin-2019/utaipan/data/30773f5ef/ee134faa84334c998cce26b8acad131d [2018-12-02 23:25:27,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 23:25:27,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 23:25:27,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 23:25:27,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 23:25:27,940 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 23:25:27,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:25:27" (1/1) ... [2018-12-02 23:25:27,942 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eda5476 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:27, skipping insertion in model container [2018-12-02 23:25:27,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:25:27" (1/1) ... [2018-12-02 23:25:27,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 23:25:27,965 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 23:25:28,122 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:25:28,128 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 23:25:28,190 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:25:28,224 INFO L195 MainTranslator]: Completed translation [2018-12-02 23:25:28,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:28 WrapperNode [2018-12-02 23:25:28,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 23:25:28,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 23:25:28,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 23:25:28,225 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 23:25:28,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:28" (1/1) ... [2018-12-02 23:25:28,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:28" (1/1) ... [2018-12-02 23:25:28,247 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 23:25:28,248 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 23:25:28,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 23:25:28,248 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 23:25:28,253 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:28" (1/1) ... [2018-12-02 23:25:28,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:28" (1/1) ... [2018-12-02 23:25:28,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:28" (1/1) ... [2018-12-02 23:25:28,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:28" (1/1) ... [2018-12-02 23:25:28,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:28" (1/1) ... [2018-12-02 23:25:28,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:28" (1/1) ... [2018-12-02 23:25:28,262 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:28" (1/1) ... [2018-12-02 23:25:28,263 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 23:25:28,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 23:25:28,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 23:25:28,263 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 23:25:28,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/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 23:25:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 23:25:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 23:25:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2018-12-02 23:25:28,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2018-12-02 23:25:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2018-12-02 23:25:28,294 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2018-12-02 23:25:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 23:25:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 23:25:28,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 23:25:28,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 23:25:28,295 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 23:25:28,451 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 23:25:28,452 INFO L280 CfgBuilder]: Removed 12 assue(true) statements. [2018-12-02 23:25:28,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:25:28 BoogieIcfgContainer [2018-12-02 23:25:28,453 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 23:25:28,454 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 23:25:28,454 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 23:25:28,455 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 23:25:28,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:25:27" (1/3) ... [2018-12-02 23:25:28,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42810c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:25:28, skipping insertion in model container [2018-12-02 23:25:28,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:25:28" (2/3) ... [2018-12-02 23:25:28,456 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42810c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:25:28, skipping insertion in model container [2018-12-02 23:25:28,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:25:28" (3/3) ... [2018-12-02 23:25:28,457 INFO L112 eAbstractionObserver]: Analyzing ICFG lamport_true-unreach-call.i [2018-12-02 23:25:28,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thr2_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:25:28,477 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thr2_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:25:28,477 WARN L317 ript$VariableManager]: TermVariabe Thread1_thr2_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:25:28,477 WARN L317 ript$VariableManager]: TermVariabe Thread1_thr2_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:25:28,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thr2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:25:28,478 WARN L317 ript$VariableManager]: TermVariabe |Thread1_thr2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:25:28,478 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#in~_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:25:28,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#in~_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:25:28,479 WARN L317 ript$VariableManager]: TermVariabe Thread0_thr1_~_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:25:28,479 WARN L317 ript$VariableManager]: TermVariabe Thread0_thr1_~_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:25:28,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:25:28,479 WARN L317 ript$VariableManager]: TermVariabe |Thread0_thr1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 23:25:28,487 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 23:25:28,487 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 23:25:28,492 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-02 23:25:28,500 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-02 23:25:28,514 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 23:25:28,514 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 23:25:28,514 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 23:25:28,514 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 23:25:28,515 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 23:25:28,515 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 23:25:28,515 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 23:25:28,515 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 23:25:28,520 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77places, 100 transitions [2018-12-02 23:25:28,561 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1816 states. [2018-12-02 23:25:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1816 states. [2018-12-02 23:25:28,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 23:25:28,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:28,568 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:25:28,569 INFO L423 AbstractCegarLoop]: === Iteration 1 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:28,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:28,572 INFO L82 PathProgramCache]: Analyzing trace with hash -772610409, now seen corresponding path program 1 times [2018-12-02 23:25:28,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:25:28,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:28,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:28,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:28,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:25:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:25:28,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:28,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 23:25:28,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:25:28,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-02 23:25:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-02 23:25:28,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 23:25:28,667 INFO L87 Difference]: Start difference. First operand 1816 states. Second operand 2 states. [2018-12-02 23:25:28,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:28,698 INFO L93 Difference]: Finished difference Result 1816 states and 5404 transitions. [2018-12-02 23:25:28,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 23:25:28,699 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-12-02 23:25:28,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:28,715 INFO L225 Difference]: With dead ends: 1816 [2018-12-02 23:25:28,715 INFO L226 Difference]: Without dead ends: 1702 [2018-12-02 23:25:28,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-02 23:25:28,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2018-12-02 23:25:28,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2018-12-02 23:25:28,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2018-12-02 23:25:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 5134 transitions. [2018-12-02 23:25:28,786 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 5134 transitions. Word has length 18 [2018-12-02 23:25:28,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:28,786 INFO L480 AbstractCegarLoop]: Abstraction has 1702 states and 5134 transitions. [2018-12-02 23:25:28,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-02 23:25:28,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 5134 transitions. [2018-12-02 23:25:28,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 23:25:28,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:28,788 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:25:28,788 INFO L423 AbstractCegarLoop]: === Iteration 2 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:28,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:28,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1584356875, now seen corresponding path program 1 times [2018-12-02 23:25:28,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:25:28,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:28,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:28,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:28,791 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:25:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:25:28,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:28,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:25:28,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:25:28,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:25:28,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:25:28,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:28,825 INFO L87 Difference]: Start difference. First operand 1702 states and 5134 transitions. Second operand 3 states. [2018-12-02 23:25:28,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:28,852 INFO L93 Difference]: Finished difference Result 1687 states and 5003 transitions. [2018-12-02 23:25:28,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:25:28,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 23:25:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:28,859 INFO L225 Difference]: With dead ends: 1687 [2018-12-02 23:25:28,859 INFO L226 Difference]: Without dead ends: 1399 [2018-12-02 23:25:28,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:28,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2018-12-02 23:25:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1345. [2018-12-02 23:25:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2018-12-02 23:25:28,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 4069 transitions. [2018-12-02 23:25:28,889 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 4069 transitions. Word has length 24 [2018-12-02 23:25:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:28,889 INFO L480 AbstractCegarLoop]: Abstraction has 1345 states and 4069 transitions. [2018-12-02 23:25:28,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:25:28,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 4069 transitions. [2018-12-02 23:25:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 23:25:28,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:28,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:25:28,892 INFO L423 AbstractCegarLoop]: === Iteration 3 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:28,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:28,892 INFO L82 PathProgramCache]: Analyzing trace with hash 443111029, now seen corresponding path program 1 times [2018-12-02 23:25:28,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:25:28,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:28,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:28,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:28,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:25:28,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:25:28,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:28,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:25:28,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:25:28,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:25:28,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:25:28,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:28,922 INFO L87 Difference]: Start difference. First operand 1345 states and 4069 transitions. Second operand 3 states. [2018-12-02 23:25:28,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:28,944 INFO L93 Difference]: Finished difference Result 1255 states and 3767 transitions. [2018-12-02 23:25:28,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:25:28,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 23:25:28,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:28,949 INFO L225 Difference]: With dead ends: 1255 [2018-12-02 23:25:28,950 INFO L226 Difference]: Without dead ends: 952 [2018-12-02 23:25:28,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:28,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2018-12-02 23:25:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2018-12-02 23:25:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2018-12-02 23:25:28,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2914 transitions. [2018-12-02 23:25:28,971 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2914 transitions. Word has length 27 [2018-12-02 23:25:28,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:28,972 INFO L480 AbstractCegarLoop]: Abstraction has 952 states and 2914 transitions. [2018-12-02 23:25:28,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:25:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2914 transitions. [2018-12-02 23:25:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 23:25:28,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:28,975 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] [2018-12-02 23:25:28,975 INFO L423 AbstractCegarLoop]: === Iteration 4 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:28,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:28,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1505967266, now seen corresponding path program 1 times [2018-12-02 23:25:28,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:25:28,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:28,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:28,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:28,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:25:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:29,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:25:29,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:29,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:25:29,010 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:25:29,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:25:29,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:25:29,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:29,011 INFO L87 Difference]: Start difference. First operand 952 states and 2914 transitions. Second operand 3 states. [2018-12-02 23:25:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:29,064 INFO L93 Difference]: Finished difference Result 1228 states and 3688 transitions. [2018-12-02 23:25:29,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:25:29,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-02 23:25:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:29,069 INFO L225 Difference]: With dead ends: 1228 [2018-12-02 23:25:29,069 INFO L226 Difference]: Without dead ends: 994 [2018-12-02 23:25:29,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:29,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2018-12-02 23:25:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 943. [2018-12-02 23:25:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-12-02 23:25:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 2817 transitions. [2018-12-02 23:25:29,093 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 2817 transitions. Word has length 36 [2018-12-02 23:25:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:29,093 INFO L480 AbstractCegarLoop]: Abstraction has 943 states and 2817 transitions. [2018-12-02 23:25:29,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:25:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 2817 transitions. [2018-12-02 23:25:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 23:25:29,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:29,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:25:29,095 INFO L423 AbstractCegarLoop]: === Iteration 5 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:29,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:29,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1422434340, now seen corresponding path program 2 times [2018-12-02 23:25:29,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:25:29,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:29,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:29,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:29,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:25:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:25:29,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:29,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 23:25:29,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:25:29,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 23:25:29,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 23:25:29,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:25:29,128 INFO L87 Difference]: Start difference. First operand 943 states and 2817 transitions. Second operand 4 states. [2018-12-02 23:25:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:29,155 INFO L93 Difference]: Finished difference Result 1456 states and 4146 transitions. [2018-12-02 23:25:29,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:25:29,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-02 23:25:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:29,161 INFO L225 Difference]: With dead ends: 1456 [2018-12-02 23:25:29,161 INFO L226 Difference]: Without dead ends: 1456 [2018-12-02 23:25:29,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 23:25:29,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2018-12-02 23:25:29,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1051. [2018-12-02 23:25:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2018-12-02 23:25:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 3108 transitions. [2018-12-02 23:25:29,193 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 3108 transitions. Word has length 36 [2018-12-02 23:25:29,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:29,193 INFO L480 AbstractCegarLoop]: Abstraction has 1051 states and 3108 transitions. [2018-12-02 23:25:29,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 23:25:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 3108 transitions. [2018-12-02 23:25:29,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 23:25:29,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:29,196 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] [2018-12-02 23:25:29,196 INFO L423 AbstractCegarLoop]: === Iteration 6 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:29,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:29,196 INFO L82 PathProgramCache]: Analyzing trace with hash -163632108, now seen corresponding path program 3 times [2018-12-02 23:25:29,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:25:29,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:29,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:25:29,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:29,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:25:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:29,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:25:29,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:29,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:25:29,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:25:29,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:25:29,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:25:29,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:29,228 INFO L87 Difference]: Start difference. First operand 1051 states and 3108 transitions. Second operand 3 states. [2018-12-02 23:25:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:29,243 INFO L93 Difference]: Finished difference Result 1303 states and 3546 transitions. [2018-12-02 23:25:29,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:25:29,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-02 23:25:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:29,249 INFO L225 Difference]: With dead ends: 1303 [2018-12-02 23:25:29,249 INFO L226 Difference]: Without dead ends: 1294 [2018-12-02 23:25:29,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2018-12-02 23:25:29,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 973. [2018-12-02 23:25:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 973 states. [2018-12-02 23:25:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 2744 transitions. [2018-12-02 23:25:29,275 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 2744 transitions. Word has length 36 [2018-12-02 23:25:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:29,275 INFO L480 AbstractCegarLoop]: Abstraction has 973 states and 2744 transitions. [2018-12-02 23:25:29,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:25:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 2744 transitions. [2018-12-02 23:25:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 23:25:29,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:29,277 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] [2018-12-02 23:25:29,277 INFO L423 AbstractCegarLoop]: === Iteration 7 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:29,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:29,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1616007366, now seen corresponding path program 4 times [2018-12-02 23:25:29,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:25:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:29,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 23:25:29,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:29,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:25:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:29,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:25:29,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:29,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:25:29,299 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:25:29,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:25:29,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:25:29,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:29,300 INFO L87 Difference]: Start difference. First operand 973 states and 2744 transitions. Second operand 3 states. [2018-12-02 23:25:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:29,341 INFO L93 Difference]: Finished difference Result 880 states and 2301 transitions. [2018-12-02 23:25:29,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:25:29,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-02 23:25:29,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:29,344 INFO L225 Difference]: With dead ends: 880 [2018-12-02 23:25:29,345 INFO L226 Difference]: Without dead ends: 655 [2018-12-02 23:25:29,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2018-12-02 23:25:29,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 568. [2018-12-02 23:25:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2018-12-02 23:25:29,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1424 transitions. [2018-12-02 23:25:29,358 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1424 transitions. Word has length 36 [2018-12-02 23:25:29,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:29,358 INFO L480 AbstractCegarLoop]: Abstraction has 568 states and 1424 transitions. [2018-12-02 23:25:29,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:25:29,358 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1424 transitions. [2018-12-02 23:25:29,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 23:25:29,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:29,360 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:25:29,360 INFO L423 AbstractCegarLoop]: === Iteration 8 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:29,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:29,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1142059985, now seen corresponding path program 1 times [2018-12-02 23:25:29,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:25:29,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:29,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:29,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:29,363 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:25:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:25:29,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:29,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:25:29,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:25:29,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:25:29,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:25:29,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:29,398 INFO L87 Difference]: Start difference. First operand 568 states and 1424 transitions. Second operand 3 states. [2018-12-02 23:25:29,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:29,405 INFO L93 Difference]: Finished difference Result 544 states and 1360 transitions. [2018-12-02 23:25:29,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:25:29,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-02 23:25:29,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:29,407 INFO L225 Difference]: With dead ends: 544 [2018-12-02 23:25:29,407 INFO L226 Difference]: Without dead ends: 469 [2018-12-02 23:25:29,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:29,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-12-02 23:25:29,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 469. [2018-12-02 23:25:29,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-12-02 23:25:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1171 transitions. [2018-12-02 23:25:29,415 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1171 transitions. Word has length 39 [2018-12-02 23:25:29,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:29,416 INFO L480 AbstractCegarLoop]: Abstraction has 469 states and 1171 transitions. [2018-12-02 23:25:29,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:25:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1171 transitions. [2018-12-02 23:25:29,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 23:25:29,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:29,417 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 23:25:29,417 INFO L423 AbstractCegarLoop]: === Iteration 9 === [thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr2Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:29,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:29,417 INFO L82 PathProgramCache]: Analyzing trace with hash -547744875, now seen corresponding path program 1 times [2018-12-02 23:25:29,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:25:29,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:29,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:29,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:29,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:25:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:25:29,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:29,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:25:29,439 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:25:29,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:25:29,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:25:29,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:29,440 INFO L87 Difference]: Start difference. First operand 469 states and 1171 transitions. Second operand 3 states. [2018-12-02 23:25:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:29,444 INFO L93 Difference]: Finished difference Result 310 states and 825 transitions. [2018-12-02 23:25:29,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:25:29,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-02 23:25:29,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:29,445 INFO L225 Difference]: With dead ends: 310 [2018-12-02 23:25:29,445 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 23:25:29,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 23:25:29,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 23:25:29,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 23:25:29,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 23:25:29,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-12-02 23:25:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:29,446 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 23:25:29,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:25:29,446 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 23:25:29,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 23:25:29,449 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 23:25:29,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:25:29 BasicIcfg [2018-12-02 23:25:29,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 23:25:29,450 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 23:25:29,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 23:25:29,451 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 23:25:29,451 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:25:28" (3/4) ... [2018-12-02 23:25:29,454 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 23:25:29,459 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr2 [2018-12-02 23:25:29,460 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thr1 [2018-12-02 23:25:29,463 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-02 23:25:29,463 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 23:25:29,488 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a415c82f-07b2-40b0-9282-e1b9d29e2351/bin-2019/utaipan/witness.graphml [2018-12-02 23:25:29,488 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 23:25:29,489 INFO L168 Benchmark]: Toolchain (without parser) took 1551.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -102.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:25:29,489 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:25:29,490 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -126.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:29,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.08 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:29,490 INFO L168 Benchmark]: Boogie Preprocessor took 15.18 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:29,491 INFO L168 Benchmark]: RCFGBuilder took 190.21 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:29,491 INFO L168 Benchmark]: TraceAbstraction took 996.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -7.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:25:29,491 INFO L168 Benchmark]: Witness Printer took 37.85 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:29,493 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 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 286.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 90.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -126.5 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.08 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.18 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 190.21 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 996.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -7.1 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 37.85 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 659]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 685]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 659]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 123 locations, 4 error locations. SAFE Result, 0.9s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 795 SDtfs, 283 SDslu, 511 SDs, 0 SdLazy, 91 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1816occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 918 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 12878 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...