./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe015_tso.opt_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/pthread-wmm/safe015_tso.opt_true-unreach-call.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2059cdb9d50c5563f9c2024cc6a14d3d80f1421a .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-13 05:50:16,936 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-13 05:50:16,938 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-13 05:50:16,950 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-13 05:50:16,950 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-13 05:50:16,952 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-13 05:50:16,953 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-13 05:50:16,963 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-13 05:50:16,965 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-13 05:50:16,966 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-13 05:50:16,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-13 05:50:16,967 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-13 05:50:16,968 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-13 05:50:16,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-13 05:50:16,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-13 05:50:16,971 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-13 05:50:16,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-13 05:50:16,973 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-13 05:50:16,975 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-13 05:50:16,977 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-13 05:50:16,978 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-13 05:50:16,979 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-13 05:50:16,982 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-13 05:50:16,982 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-13 05:50:16,982 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-13 05:50:16,983 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-13 05:50:16,984 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-13 05:50:16,985 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-13 05:50:16,986 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-13 05:50:16,987 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-13 05:50:16,987 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-13 05:50:16,988 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-13 05:50:16,988 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-13 05:50:16,989 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-13 05:50:16,990 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-13 05:50:16,990 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-13 05:50:16,991 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-13 05:50:17,010 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-13 05:50:17,010 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-13 05:50:17,011 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-13 05:50:17,012 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-13 05:50:17,012 INFO L133 SettingsManager]: * Use SBE=true [2019-01-13 05:50:17,012 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-13 05:50:17,012 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-13 05:50:17,012 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-13 05:50:17,013 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-13 05:50:17,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-13 05:50:17,013 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-13 05:50:17,013 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-13 05:50:17,013 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-13 05:50:17,013 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-13 05:50:17,014 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-13 05:50:17,014 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-13 05:50:17,014 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-13 05:50:17,014 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-13 05:50:17,014 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-13 05:50:17,015 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-13 05:50:17,015 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-13 05:50:17,015 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-13 05:50:17,015 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-13 05:50:17,015 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-13 05:50:17,015 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-13 05:50:17,016 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-13 05:50:17,016 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-13 05:50:17,016 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-13 05:50:17,016 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2059cdb9d50c5563f9c2024cc6a14d3d80f1421a [2019-01-13 05:50:17,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-13 05:50:17,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-13 05:50:17,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-13 05:50:17,090 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-13 05:50:17,090 INFO L276 PluginConnector]: CDTParser initialized [2019-01-13 05:50:17,091 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe015_tso.opt_true-unreach-call.i [2019-01-13 05:50:17,165 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0425d9dc2/b7a2aa9070c24306b22240801304caf1/FLAGd9d29716f [2019-01-13 05:50:17,731 INFO L307 CDTParser]: Found 1 translation units. [2019-01-13 05:50:17,732 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe015_tso.opt_true-unreach-call.i [2019-01-13 05:50:17,751 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0425d9dc2/b7a2aa9070c24306b22240801304caf1/FLAGd9d29716f [2019-01-13 05:50:17,989 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0425d9dc2/b7a2aa9070c24306b22240801304caf1 [2019-01-13 05:50:17,993 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-13 05:50:17,995 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-13 05:50:17,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-13 05:50:17,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-13 05:50:18,000 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-13 05:50:18,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:50:17" (1/1) ... [2019-01-13 05:50:18,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378931a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18, skipping insertion in model container [2019-01-13 05:50:18,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.01 05:50:17" (1/1) ... [2019-01-13 05:50:18,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-13 05:50:18,064 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-13 05:50:18,464 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:50:18,481 INFO L191 MainTranslator]: Completed pre-run [2019-01-13 05:50:18,600 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-13 05:50:18,676 INFO L195 MainTranslator]: Completed translation [2019-01-13 05:50:18,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18 WrapperNode [2019-01-13 05:50:18,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-13 05:50:18,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-13 05:50:18,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-13 05:50:18,678 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-13 05:50:18,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18" (1/1) ... [2019-01-13 05:50:18,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18" (1/1) ... [2019-01-13 05:50:18,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-13 05:50:18,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-13 05:50:18,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-13 05:50:18,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-13 05:50:18,738 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18" (1/1) ... [2019-01-13 05:50:18,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18" (1/1) ... [2019-01-13 05:50:18,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18" (1/1) ... [2019-01-13 05:50:18,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18" (1/1) ... [2019-01-13 05:50:18,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18" (1/1) ... [2019-01-13 05:50:18,752 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18" (1/1) ... [2019-01-13 05:50:18,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18" (1/1) ... [2019-01-13 05:50:18,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-13 05:50:18,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-13 05:50:18,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-13 05:50:18,758 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-13 05:50:18,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-13 05:50:18,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-13 05:50:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-13 05:50:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-13 05:50:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-13 05:50:18,839 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-13 05:50:18,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-13 05:50:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-13 05:50:18,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-13 05:50:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-13 05:50:18,840 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-13 05:50:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-13 05:50:18,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-13 05:50:18,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-13 05:50:18,846 WARN L204 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-13 05:50:19,315 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-13 05:50:19,316 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-13 05:50:19,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:50:19 BoogieIcfgContainer [2019-01-13 05:50:19,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-13 05:50:19,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-13 05:50:19,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-13 05:50:19,322 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-13 05:50:19,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.01 05:50:17" (1/3) ... [2019-01-13 05:50:19,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35269d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:50:19, skipping insertion in model container [2019-01-13 05:50:19,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.01 05:50:18" (2/3) ... [2019-01-13 05:50:19,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35269d88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.01 05:50:19, skipping insertion in model container [2019-01-13 05:50:19,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:50:19" (3/3) ... [2019-01-13 05:50:19,325 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_tso.opt_true-unreach-call.i [2019-01-13 05:50:19,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,360 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,360 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,360 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,361 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,362 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,362 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,362 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,363 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,363 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,363 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,363 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,363 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,364 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,364 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,364 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,364 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,364 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,365 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,365 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,365 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,366 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,367 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-13 05:50:19,401 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-13 05:50:19,401 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-13 05:50:19,410 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-13 05:50:19,428 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-13 05:50:19,454 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-13 05:50:19,455 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-13 05:50:19,455 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-13 05:50:19,455 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-13 05:50:19,456 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-13 05:50:19,456 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-13 05:50:19,456 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-13 05:50:19,456 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-13 05:50:19,456 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-13 05:50:19,466 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55places, 52 transitions [2019-01-13 05:50:19,598 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2384 states. [2019-01-13 05:50:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2384 states. [2019-01-13 05:50:19,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-13 05:50:19,622 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:50:19,623 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] [2019-01-13 05:50:19,625 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:50:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:50:19,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1952890995, now seen corresponding path program 1 times [2019-01-13 05:50:19,634 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:50:19,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:50:19,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:50:19,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:50:19,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:50:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:50:20,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:50:20,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:50:20,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-13 05:50:20,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-13 05:50:20,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-13 05:50:20,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-13 05:50:20,095 INFO L87 Difference]: Start difference. First operand 2384 states. Second operand 4 states. [2019-01-13 05:50:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:50:20,330 INFO L93 Difference]: Finished difference Result 2492 states and 8068 transitions. [2019-01-13 05:50:20,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-13 05:50:20,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-01-13 05:50:20,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:50:20,366 INFO L225 Difference]: With dead ends: 2492 [2019-01-13 05:50:20,366 INFO L226 Difference]: Without dead ends: 1127 [2019-01-13 05:50:20,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:50:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2019-01-13 05:50:20,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1127. [2019-01-13 05:50:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1127 states. [2019-01-13 05:50:20,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 3557 transitions. [2019-01-13 05:50:20,515 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 3557 transitions. Word has length 29 [2019-01-13 05:50:20,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:50:20,516 INFO L480 AbstractCegarLoop]: Abstraction has 1127 states and 3557 transitions. [2019-01-13 05:50:20,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-13 05:50:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 3557 transitions. [2019-01-13 05:50:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-13 05:50:20,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:50:20,522 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] [2019-01-13 05:50:20,522 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:50:20,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:50:20,522 INFO L82 PathProgramCache]: Analyzing trace with hash 237831011, now seen corresponding path program 1 times [2019-01-13 05:50:20,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:50:20,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:50:20,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:50:20,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:50:20,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:50:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:50:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:50:20,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:50:20,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-13 05:50:20,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-13 05:50:20,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-13 05:50:20,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-13 05:50:20,792 INFO L87 Difference]: Start difference. First operand 1127 states and 3557 transitions. Second operand 5 states. [2019-01-13 05:50:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:50:21,232 INFO L93 Difference]: Finished difference Result 1167 states and 3551 transitions. [2019-01-13 05:50:21,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-13 05:50:21,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-13 05:50:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:50:21,246 INFO L225 Difference]: With dead ends: 1167 [2019-01-13 05:50:21,246 INFO L226 Difference]: Without dead ends: 1043 [2019-01-13 05:50:21,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:50:21,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-01-13 05:50:21,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2019-01-13 05:50:21,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1043 states. [2019-01-13 05:50:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 3242 transitions. [2019-01-13 05:50:21,311 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 3242 transitions. Word has length 30 [2019-01-13 05:50:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:50:21,312 INFO L480 AbstractCegarLoop]: Abstraction has 1043 states and 3242 transitions. [2019-01-13 05:50:21,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-13 05:50:21,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 3242 transitions. [2019-01-13 05:50:21,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-13 05:50:21,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:50:21,318 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] [2019-01-13 05:50:21,319 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:50:21,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:50:21,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1963848659, now seen corresponding path program 1 times [2019-01-13 05:50:21,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:50:21,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:50:21,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:50:21,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:50:21,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:50:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:50:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:50:21,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:50:21,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-13 05:50:21,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-13 05:50:21,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-13 05:50:21,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-13 05:50:21,625 INFO L87 Difference]: Start difference. First operand 1043 states and 3242 transitions. Second operand 6 states. [2019-01-13 05:50:21,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:50:21,824 INFO L93 Difference]: Finished difference Result 819 states and 2378 transitions. [2019-01-13 05:50:21,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:50:21,824 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-01-13 05:50:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:50:21,830 INFO L225 Difference]: With dead ends: 819 [2019-01-13 05:50:21,830 INFO L226 Difference]: Without dead ends: 707 [2019-01-13 05:50:21,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-13 05:50:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-01-13 05:50:21,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2019-01-13 05:50:21,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2019-01-13 05:50:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 2066 transitions. [2019-01-13 05:50:21,858 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 2066 transitions. Word has length 31 [2019-01-13 05:50:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:50:21,859 INFO L480 AbstractCegarLoop]: Abstraction has 707 states and 2066 transitions. [2019-01-13 05:50:21,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-13 05:50:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 2066 transitions. [2019-01-13 05:50:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 05:50:21,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:50:21,861 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] [2019-01-13 05:50:21,862 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:50:21,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:50:21,863 INFO L82 PathProgramCache]: Analyzing trace with hash 994118133, now seen corresponding path program 1 times [2019-01-13 05:50:21,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:50:21,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:50:21,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:50:21,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:50:21,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:50:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:50:22,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:50:22,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:50:22,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 05:50:22,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 05:50:22,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 05:50:22,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-13 05:50:22,185 INFO L87 Difference]: Start difference. First operand 707 states and 2066 transitions. Second operand 10 states. [2019-01-13 05:50:22,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:50:22,998 INFO L93 Difference]: Finished difference Result 1107 states and 3290 transitions. [2019-01-13 05:50:23,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-13 05:50:23,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-01-13 05:50:23,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:50:23,006 INFO L225 Difference]: With dead ends: 1107 [2019-01-13 05:50:23,006 INFO L226 Difference]: Without dead ends: 591 [2019-01-13 05:50:23,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-01-13 05:50:23,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-01-13 05:50:23,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-01-13 05:50:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-01-13 05:50:23,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1754 transitions. [2019-01-13 05:50:23,033 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1754 transitions. Word has length 32 [2019-01-13 05:50:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:50:23,034 INFO L480 AbstractCegarLoop]: Abstraction has 591 states and 1754 transitions. [2019-01-13 05:50:23,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 05:50:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1754 transitions. [2019-01-13 05:50:23,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 05:50:23,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:50:23,036 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] [2019-01-13 05:50:23,037 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:50:23,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:50:23,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1831555919, now seen corresponding path program 2 times [2019-01-13 05:50:23,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:50:23,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:50:23,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:50:23,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-13 05:50:23,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:50:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:50:23,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:50:23,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:50:23,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-13 05:50:23,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-13 05:50:23,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-13 05:50:23,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-13 05:50:23,411 INFO L87 Difference]: Start difference. First operand 591 states and 1754 transitions. Second operand 10 states. [2019-01-13 05:50:23,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:50:23,674 INFO L93 Difference]: Finished difference Result 991 states and 2978 transitions. [2019-01-13 05:50:23,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-13 05:50:23,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-01-13 05:50:23,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:50:23,684 INFO L225 Difference]: With dead ends: 991 [2019-01-13 05:50:23,684 INFO L226 Difference]: Without dead ends: 571 [2019-01-13 05:50:23,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-13 05:50:23,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-01-13 05:50:23,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-01-13 05:50:23,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-01-13 05:50:23,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1714 transitions. [2019-01-13 05:50:23,706 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 1714 transitions. Word has length 32 [2019-01-13 05:50:23,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:50:23,707 INFO L480 AbstractCegarLoop]: Abstraction has 571 states and 1714 transitions. [2019-01-13 05:50:23,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-13 05:50:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 1714 transitions. [2019-01-13 05:50:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-13 05:50:23,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-13 05:50:23,710 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] [2019-01-13 05:50:23,710 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-13 05:50:23,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-13 05:50:23,711 INFO L82 PathProgramCache]: Analyzing trace with hash 2073035831, now seen corresponding path program 3 times [2019-01-13 05:50:23,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-13 05:50:23,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-13 05:50:23,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:50:23,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-13 05:50:23,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-13 05:50:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-13 05:50:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-13 05:50:23,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-13 05:50:23,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-13 05:50:23,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-13 05:50:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-13 05:50:23,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-13 05:50:23,918 INFO L87 Difference]: Start difference. First operand 571 states and 1714 transitions. Second operand 7 states. [2019-01-13 05:50:24,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-13 05:50:24,009 INFO L93 Difference]: Finished difference Result 443 states and 1298 transitions. [2019-01-13 05:50:24,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-13 05:50:24,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-01-13 05:50:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-13 05:50:24,010 INFO L225 Difference]: With dead ends: 443 [2019-01-13 05:50:24,010 INFO L226 Difference]: Without dead ends: 0 [2019-01-13 05:50:24,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-13 05:50:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-13 05:50:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-13 05:50:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-13 05:50:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-13 05:50:24,013 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-01-13 05:50:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-13 05:50:24,013 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-13 05:50:24,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-13 05:50:24,013 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-13 05:50:24,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-13 05:50:24,018 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-13 05:50:24,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.01 05:50:24 BasicIcfg [2019-01-13 05:50:24,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-13 05:50:24,021 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-13 05:50:24,021 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-13 05:50:24,022 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-13 05:50:24,022 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.01 05:50:19" (3/4) ... [2019-01-13 05:50:24,027 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-13 05:50:24,036 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-01-13 05:50:24,036 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-01-13 05:50:24,036 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-01-13 05:50:24,041 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-01-13 05:50:24,041 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-13 05:50:24,087 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-13 05:50:24,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-13 05:50:24,088 INFO L168 Benchmark]: Toolchain (without parser) took 6093.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.0 MB in the beginning and 831.0 MB in the end (delta: 115.0 MB). Peak memory consumption was 258.2 MB. Max. memory is 11.5 GB. [2019-01-13 05:50:24,090 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:50:24,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 681.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. [2019-01-13 05:50:24,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.65 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-13 05:50:24,093 INFO L168 Benchmark]: Boogie Preprocessor took 27.11 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-01-13 05:50:24,093 INFO L168 Benchmark]: RCFGBuilder took 559.31 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: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-01-13 05:50:24,094 INFO L168 Benchmark]: TraceAbstraction took 4702.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 831.0 MB in the end (delta: 254.2 MB). Peak memory consumption was 254.2 MB. Max. memory is 11.5 GB. [2019-01-13 05:50:24,096 INFO L168 Benchmark]: Witness Printer took 65.76 ms. Allocated memory is still 1.2 GB. Free memory is still 831.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-13 05:50:24,100 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 681.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -170.3 MB). Peak memory consumption was 30.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.65 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.11 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 559.31 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: 24.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4702.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 831.0 MB in the end (delta: 254.2 MB). Peak memory consumption was 254.2 MB. Max. memory is 11.5 GB. * Witness Printer took 65.76 ms. Allocated memory is still 1.2 GB. Free memory is still 831.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 70 locations, 1 error locations. SAFE Result, 4.5s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 2.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 360 SDtfs, 435 SDslu, 1452 SDs, 0 SdLazy, 267 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2384occurred 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 19005 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...