./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe018_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/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 b79dddd7d9e2c4a1dea51534d81c18928c635387 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:11:35,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:11:35,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:11:35,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:11:35,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:11:35,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:11:35,576 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:11:35,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:11:35,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:11:35,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:11:35,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:11:35,581 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:11:35,581 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:11:35,582 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:11:35,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:11:35,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:11:35,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:11:35,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:11:35,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:11:35,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:11:35,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:11:35,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:11:35,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:11:35,590 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:11:35,592 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:11:35,592 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:11:35,592 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:11:35,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:11:35,593 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:11:35,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:11:35,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:11:35,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:11:35,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:11:35,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:11:35,595 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:11:35,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:11:35,596 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:11:35,596 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:11:35,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:11:35,597 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:11:35,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:11:35,598 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:11:35,608 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:11:35,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:11:35,608 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:11:35,609 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:11:35,609 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:11:35,609 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:11:35,609 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:11:35,609 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:11:35,609 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:11:35,609 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:11:35,610 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:11:35,610 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:11:35,610 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:11:35,610 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:11:35,610 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:11:35,611 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:11:35,611 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:11:35,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:11:35,611 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:11:35,611 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:11:35,611 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:11:35,611 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:11:35,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:11:35,612 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:11:35,612 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:11:35,612 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:11:35,612 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:11:35,612 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:11:35,612 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:11:35,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:11:35,613 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:11:35,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:11:35,613 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:11:35,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:11:35,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:11:35,613 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:11:35,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:11:35,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:11:35,614 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:11:35,614 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:11:35,614 INFO L138 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/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/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 -> b79dddd7d9e2c4a1dea51534d81c18928c635387 [2019-12-07 21:11:35,712 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:11:35,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:11:35,722 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:11:35,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:11:35,723 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:11:35,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe018_pso.opt.i [2019-12-07 21:11:35,761 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/utaipan/data/0a2af709a/973ec19f5de94a72a16be43c88e0ddcf/FLAG5d71d8770 [2019-12-07 21:11:36,159 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:11:36,160 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/sv-benchmarks/c/pthread-wmm/safe018_pso.opt.i [2019-12-07 21:11:36,172 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/utaipan/data/0a2af709a/973ec19f5de94a72a16be43c88e0ddcf/FLAG5d71d8770 [2019-12-07 21:11:36,181 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/utaipan/data/0a2af709a/973ec19f5de94a72a16be43c88e0ddcf [2019-12-07 21:11:36,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:11:36,184 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:11:36,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:11:36,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:11:36,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:11:36,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:11:36" (1/1) ... [2019-12-07 21:11:36,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61040381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36, skipping insertion in model container [2019-12-07 21:11:36,190 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:11:36" (1/1) ... [2019-12-07 21:11:36,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:11:36,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:11:36,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:11:36,455 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:11:36,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:11:36,534 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:11:36,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36 WrapperNode [2019-12-07 21:11:36,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:11:36,535 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:11:36,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:11:36,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:11:36,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36" (1/1) ... [2019-12-07 21:11:36,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36" (1/1) ... [2019-12-07 21:11:36,566 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:11:36,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:11:36,567 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:11:36,567 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:11:36,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36" (1/1) ... [2019-12-07 21:11:36,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36" (1/1) ... [2019-12-07 21:11:36,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36" (1/1) ... [2019-12-07 21:11:36,576 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36" (1/1) ... [2019-12-07 21:11:36,580 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36" (1/1) ... [2019-12-07 21:11:36,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36" (1/1) ... [2019-12-07 21:11:36,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36" (1/1) ... [2019-12-07 21:11:36,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:11:36,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:11:36,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:11:36,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:11:36,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/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 [2019-12-07 21:11:36,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:11:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:11:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:11:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:11:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:11:36,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:11:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:11:36,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:11:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 21:11:36,631 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 21:11:36,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:11:36,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:11:36,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:11:36,633 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 21:11:36,810 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:11:36,810 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 21:11:36,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:11:36 BoogieIcfgContainer [2019-12-07 21:11:36,811 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:11:36,812 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:11:36,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:11:36,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:11:36,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:11:36" (1/3) ... [2019-12-07 21:11:36,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eaca663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:11:36, skipping insertion in model container [2019-12-07 21:11:36,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:11:36" (2/3) ... [2019-12-07 21:11:36,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eaca663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:11:36, skipping insertion in model container [2019-12-07 21:11:36,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:11:36" (3/3) ... [2019-12-07 21:11:36,816 INFO L109 eAbstractionObserver]: Analyzing ICFG safe018_pso.opt.i [2019-12-07 21:11:36,822 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:11:36,822 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:11:36,826 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:11:36,826 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:11:36,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,844 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,844 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,845 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,845 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,846 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,846 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:11:36,860 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-07 21:11:36,872 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:11:36,872 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:11:36,872 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:11:36,872 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:11:36,872 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:11:36,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:11:36,873 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:11:36,873 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:11:36,881 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 54 transitions [2019-12-07 21:11:36,882 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 63 places, 54 transitions [2019-12-07 21:11:36,908 INFO L134 PetriNetUnfolder]: 1/51 cut-off events. [2019-12-07 21:11:36,908 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:11:36,912 INFO L76 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 51 events. 1/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs. 9/58 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2019-12-07 21:11:36,914 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 63 places, 54 transitions [2019-12-07 21:11:36,923 INFO L134 PetriNetUnfolder]: 1/51 cut-off events. [2019-12-07 21:11:36,924 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:11:36,924 INFO L76 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 51 events. 1/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs. 9/58 useless extension candidates. Maximal degree in co-relation 39. Up to 2 conditions per place. [2019-12-07 21:11:36,925 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 450 [2019-12-07 21:11:36,926 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:11:37,726 INFO L206 etLargeBlockEncoding]: Checked pairs total: 482 [2019-12-07 21:11:37,726 INFO L214 etLargeBlockEncoding]: Total number of compositions: 45 [2019-12-07 21:11:37,728 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 21 places, 15 transitions [2019-12-07 21:11:37,735 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 46 states. [2019-12-07 21:11:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-12-07 21:11:37,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 21:11:37,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:11:37,742 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:11:37,742 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:11:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:11:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1824698528, now seen corresponding path program 1 times [2019-12-07 21:11:37,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:11:37,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931027901] [2019-12-07 21:11:37,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:11:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:11:37,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:11:37,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931027901] [2019-12-07 21:11:37,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:11:37,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:11:37,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157900447] [2019-12-07 21:11:37,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:11:37,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:11:37,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:11:37,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:11:37,929 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2019-12-07 21:11:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:11:37,950 INFO L93 Difference]: Finished difference Result 50 states and 96 transitions. [2019-12-07 21:11:37,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:11:37,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 21:11:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:11:37,960 INFO L225 Difference]: With dead ends: 50 [2019-12-07 21:11:37,960 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 21:11:37,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:11:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 21:11:37,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 21:11:37,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 21:11:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 69 transitions. [2019-12-07 21:11:37,986 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 69 transitions. Word has length 8 [2019-12-07 21:11:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:11:37,986 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 69 transitions. [2019-12-07 21:11:37,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:11:37,987 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 69 transitions. [2019-12-07 21:11:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:11:37,987 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:11:37,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:11:37,987 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:11:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:11:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1592223242, now seen corresponding path program 1 times [2019-12-07 21:11:37,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:11:37,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716040870] [2019-12-07 21:11:37,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:11:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:11:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:11:38,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716040870] [2019-12-07 21:11:38,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:11:38,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:11:38,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060786585] [2019-12-07 21:11:38,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:11:38,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:11:38,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:11:38,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:11:38,051 INFO L87 Difference]: Start difference. First operand 36 states and 69 transitions. Second operand 4 states. [2019-12-07 21:11:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:11:38,062 INFO L93 Difference]: Finished difference Result 34 states and 64 transitions. [2019-12-07 21:11:38,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:11:38,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 21:11:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:11:38,064 INFO L225 Difference]: With dead ends: 34 [2019-12-07 21:11:38,064 INFO L226 Difference]: Without dead ends: 34 [2019-12-07 21:11:38,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:11:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-07 21:11:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-07 21:11:38,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 21:11:38,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 64 transitions. [2019-12-07 21:11:38,074 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 64 transitions. Word has length 9 [2019-12-07 21:11:38,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:11:38,074 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 64 transitions. [2019-12-07 21:11:38,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:11:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 64 transitions. [2019-12-07 21:11:38,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:11:38,075 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:11:38,075 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:11:38,075 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:11:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:11:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash -731020953, now seen corresponding path program 1 times [2019-12-07 21:11:38,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:11:38,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962712095] [2019-12-07 21:11:38,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:11:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:11:38,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:11:38,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962712095] [2019-12-07 21:11:38,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:11:38,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:11:38,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681382648] [2019-12-07 21:11:38,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:11:38,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:11:38,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:11:38,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:11:38,144 INFO L87 Difference]: Start difference. First operand 34 states and 64 transitions. Second operand 5 states. [2019-12-07 21:11:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:11:38,182 INFO L93 Difference]: Finished difference Result 37 states and 64 transitions. [2019-12-07 21:11:38,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:11:38,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 21:11:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:11:38,183 INFO L225 Difference]: With dead ends: 37 [2019-12-07 21:11:38,183 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 21:11:38,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:11:38,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 21:11:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-12-07 21:11:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-07 21:11:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 48 transitions. [2019-12-07 21:11:38,186 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 48 transitions. Word has length 9 [2019-12-07 21:11:38,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:11:38,186 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 48 transitions. [2019-12-07 21:11:38,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:11:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 48 transitions. [2019-12-07 21:11:38,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:11:38,187 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:11:38,187 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:11:38,187 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:11:38,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:11:38,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2114338813, now seen corresponding path program 1 times [2019-12-07 21:11:38,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:11:38,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654416919] [2019-12-07 21:11:38,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:11:38,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:11:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:11:38,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654416919] [2019-12-07 21:11:38,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:11:38,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:11:38,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238170537] [2019-12-07 21:11:38,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:11:38,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:11:38,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:11:38,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:11:38,235 INFO L87 Difference]: Start difference. First operand 29 states and 48 transitions. Second operand 4 states. [2019-12-07 21:11:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:11:38,257 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2019-12-07 21:11:38,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:11:38,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 21:11:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:11:38,258 INFO L225 Difference]: With dead ends: 35 [2019-12-07 21:11:38,258 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 21:11:38,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:11:38,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 21:11:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-12-07 21:11:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-07 21:11:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2019-12-07 21:11:38,263 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 10 [2019-12-07 21:11:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:11:38,263 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2019-12-07 21:11:38,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:11:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2019-12-07 21:11:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:11:38,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:11:38,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:11:38,264 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:11:38,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:11:38,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1301449846, now seen corresponding path program 1 times [2019-12-07 21:11:38,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:11:38,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121041945] [2019-12-07 21:11:38,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:11:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:11:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:11:38,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121041945] [2019-12-07 21:11:38,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:11:38,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:11:38,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163703924] [2019-12-07 21:11:38,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:11:38,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:11:38,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:11:38,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:11:38,303 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand 4 states. [2019-12-07 21:11:38,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:11:38,310 INFO L93 Difference]: Finished difference Result 30 states and 48 transitions. [2019-12-07 21:11:38,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:11:38,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 21:11:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:11:38,311 INFO L225 Difference]: With dead ends: 30 [2019-12-07 21:11:38,311 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 21:11:38,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:11:38,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 21:11:38,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-12-07 21:11:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 21:11:38,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2019-12-07 21:11:38,314 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 10 [2019-12-07 21:11:38,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:11:38,314 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. [2019-12-07 21:11:38,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:11:38,314 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2019-12-07 21:11:38,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:11:38,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:11:38,315 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:11:38,315 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:11:38,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:11:38,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1186765067, now seen corresponding path program 2 times [2019-12-07 21:11:38,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:11:38,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380419590] [2019-12-07 21:11:38,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:11:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:11:38,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:11:38,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380419590] [2019-12-07 21:11:38,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:11:38,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:11:38,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854563062] [2019-12-07 21:11:38,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:11:38,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:11:38,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:11:38,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:11:38,359 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand 5 states. [2019-12-07 21:11:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:11:38,373 INFO L93 Difference]: Finished difference Result 31 states and 47 transitions. [2019-12-07 21:11:38,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:11:38,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 21:11:38,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:11:38,374 INFO L225 Difference]: With dead ends: 31 [2019-12-07 21:11:38,374 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 21:11:38,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:11:38,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 21:11:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 21:11:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 21:11:38,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 37 transitions. [2019-12-07 21:11:38,377 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 37 transitions. Word has length 10 [2019-12-07 21:11:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:11:38,377 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 37 transitions. [2019-12-07 21:11:38,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:11:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 37 transitions. [2019-12-07 21:11:38,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:11:38,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:11:38,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:11:38,378 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:11:38,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:11:38,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1005356980, now seen corresponding path program 1 times [2019-12-07 21:11:38,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:11:38,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173457878] [2019-12-07 21:11:38,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:11:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:11:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:11:38,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173457878] [2019-12-07 21:11:38,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:11:38,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:11:38,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877500016] [2019-12-07 21:11:38,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:11:38,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:11:38,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:11:38,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:11:38,420 INFO L87 Difference]: Start difference. First operand 24 states and 37 transitions. Second operand 5 states. [2019-12-07 21:11:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:11:38,433 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2019-12-07 21:11:38,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:11:38,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-07 21:11:38,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:11:38,434 INFO L225 Difference]: With dead ends: 26 [2019-12-07 21:11:38,434 INFO L226 Difference]: Without dead ends: 15 [2019-12-07 21:11:38,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:11:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-12-07 21:11:38,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-12-07 21:11:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-12-07 21:11:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-12-07 21:11:38,437 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 11 [2019-12-07 21:11:38,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:11:38,437 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-12-07 21:11:38,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:11:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2019-12-07 21:11:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:11:38,437 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:11:38,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:11:38,438 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:11:38,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:11:38,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1690191566, now seen corresponding path program 2 times [2019-12-07 21:11:38,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:11:38,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877265424] [2019-12-07 21:11:38,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:11:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:11:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:11:38,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877265424] [2019-12-07 21:11:38,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:11:38,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:11:38,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418518915] [2019-12-07 21:11:38,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:11:38,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:11:38,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:11:38,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:11:38,478 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 4 states. [2019-12-07 21:11:38,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:11:38,491 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2019-12-07 21:11:38,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:11:38,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 21:11:38,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:11:38,492 INFO L225 Difference]: With dead ends: 14 [2019-12-07 21:11:38,492 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:11:38,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:11:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:11:38,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:11:38,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:11:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:11:38,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-12-07 21:11:38,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:11:38,493 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:11:38,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:11:38,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:11:38,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:11:38,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:11:38 BasicIcfg [2019-12-07 21:11:38,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:11:38,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:11:38,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:11:38,496 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:11:38,496 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:11:36" (3/4) ... [2019-12-07 21:11:38,499 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:11:38,503 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-12-07 21:11:38,503 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-12-07 21:11:38,503 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-12-07 21:11:38,506 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-12-07 21:11:38,506 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-12-07 21:11:38,506 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 21:11:38,534 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4517ba6e-8c91-4718-8792-ef35b69d13e1/bin/utaipan/witness.graphml [2019-12-07 21:11:38,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:11:38,535 INFO L168 Benchmark]: Toolchain (without parser) took 2350.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.8 MB in the beginning and 1.0 GB in the end (delta: -102.3 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-12-07 21:11:38,536 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:11:38,536 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:11:38,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:11:38,536 INFO L168 Benchmark]: Boogie Preprocessor took 18.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:11:38,537 INFO L168 Benchmark]: RCFGBuilder took 225.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:11:38,537 INFO L168 Benchmark]: TraceAbstraction took 1683.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2019-12-07 21:11:38,537 INFO L168 Benchmark]: Witness Printer took 38.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:11:38,539 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 350.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 225.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1683.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 29.8 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. * Witness Printer took 38.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.8s, 63 ProgramPointsBefore, 21 ProgramPointsAfterwards, 54 TransitionsBefore, 15 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 7 FixpointIterations, 14 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 243 VarBasedMoverChecksPositive, 13 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 17 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 482 CheckedPairsTotal, 45 TotalNumberOfCompositions - 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 4 procedures, 54 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 83 SDtfs, 89 SDslu, 64 SDs, 0 SdLazy, 58 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 3754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...