./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/safe016_pso.opt_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/safe016_pso.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 02d75519333542a15e7dcb21b27a9b41d0fdb88b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 00:57:13,045 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:57:13,047 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:57:13,059 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:57:13,059 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:57:13,061 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:57:13,062 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:57:13,064 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:57:13,066 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:57:13,070 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:57:13,074 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:57:13,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:57:13,075 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:57:13,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:57:13,078 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:57:13,079 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:57:13,079 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:57:13,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:57:13,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:57:13,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:57:13,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:57:13,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:57:13,091 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:57:13,092 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:57:13,092 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:57:13,093 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:57:13,095 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:57:13,096 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:57:13,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:57:13,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:57:13,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:57:13,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:57:13,100 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:57:13,100 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:57:13,101 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:57:13,102 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:57:13,102 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-01 00:57:13,128 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:57:13,128 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:57:13,130 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:57:13,130 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:57:13,130 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:57:13,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:57:13,132 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:57:13,132 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:57:13,132 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:57:13,132 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:57:13,133 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:57:13,133 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:57:13,133 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:57:13,133 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:57:13,133 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:57:13,133 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:57:13,136 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:57:13,136 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:57:13,136 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:57:13,137 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:57:13,137 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:57:13,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:57:13,137 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:57:13,137 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:57:13,138 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:57:13,138 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:57:13,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:57:13,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:57:13,138 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 -> 02d75519333542a15e7dcb21b27a9b41d0fdb88b [2019-01-01 00:57:13,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:57:13,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:57:13,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:57:13,203 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:57:13,203 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:57:13,204 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/safe016_pso.opt_true-unreach-call.i [2019-01-01 00:57:13,258 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87f063439/c681f1e08e814c1aaa52489b7675edbb/FLAGf05dd91d2 [2019-01-01 00:57:13,778 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:57:13,779 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/safe016_pso.opt_true-unreach-call.i [2019-01-01 00:57:13,795 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87f063439/c681f1e08e814c1aaa52489b7675edbb/FLAGf05dd91d2 [2019-01-01 00:57:14,049 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87f063439/c681f1e08e814c1aaa52489b7675edbb [2019-01-01 00:57:14,053 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:57:14,054 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:57:14,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:57:14,056 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:57:14,059 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:57:14,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:57:14" (1/1) ... [2019-01-01 00:57:14,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ece022e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14, skipping insertion in model container [2019-01-01 00:57:14,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:57:14" (1/1) ... [2019-01-01 00:57:14,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:57:14,137 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:57:14,550 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:57:14,566 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:57:14,762 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:57:14,862 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:57:14,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14 WrapperNode [2019-01-01 00:57:14,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:57:14,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:57:14,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:57:14,865 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:57:14,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14" (1/1) ... [2019-01-01 00:57:14,894 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14" (1/1) ... [2019-01-01 00:57:14,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:57:14,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:57:14,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:57:14,921 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:57:14,931 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14" (1/1) ... [2019-01-01 00:57:14,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14" (1/1) ... [2019-01-01 00:57:14,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14" (1/1) ... [2019-01-01 00:57:14,936 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14" (1/1) ... [2019-01-01 00:57:14,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14" (1/1) ... [2019-01-01 00:57:14,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14" (1/1) ... [2019-01-01 00:57:14,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14" (1/1) ... [2019-01-01 00:57:14,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:57:14,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:57:14,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:57:14,955 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:57:14,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14" (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-01 00:57:15,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:57:15,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:57:15,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:57:15,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:57:15,025 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:57:15,025 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:57:15,026 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:57:15,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:57:15,026 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-01 00:57:15,026 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-01 00:57:15,026 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-01-01 00:57:15,027 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-01-01 00:57:15,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:57:15,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:57:15,027 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:57:15,029 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-01-01 00:57:15,579 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:57:15,579 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 00:57:15,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:57:15 BoogieIcfgContainer [2019-01-01 00:57:15,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:57:15,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:57:15,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:57:15,587 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:57:15,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:57:14" (1/3) ... [2019-01-01 00:57:15,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5400bd38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:57:15, skipping insertion in model container [2019-01-01 00:57:15,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:57:14" (2/3) ... [2019-01-01 00:57:15,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5400bd38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:57:15, skipping insertion in model container [2019-01-01 00:57:15,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:57:15" (3/3) ... [2019-01-01 00:57:15,593 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_pso.opt_true-unreach-call.i [2019-01-01 00:57:15,646 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,646 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,646 WARN L317 ript$VariableManager]: TermVariabe Thread3_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,646 WARN L317 ript$VariableManager]: TermVariabe Thread3_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,647 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,647 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,648 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,648 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,648 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,648 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,649 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,649 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,649 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,650 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,652 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,652 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,653 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,653 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,654 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,654 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,655 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,655 WARN L317 ript$VariableManager]: TermVariabe Thread2_P3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,655 WARN L317 ript$VariableManager]: TermVariabe Thread2_P3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,655 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,655 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,655 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,656 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,658 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,658 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:57:15,676 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:57:15,676 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:57:15,691 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-01 00:57:15,709 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-01 00:57:15,735 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:57:15,735 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:57:15,735 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:57:15,736 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:57:15,736 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:57:15,736 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:57:15,736 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:57:15,736 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:57:15,736 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:57:15,747 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66places, 62 transitions [2019-01-01 00:57:16,751 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13134 states. [2019-01-01 00:57:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13134 states. [2019-01-01 00:57:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-01 00:57:16,803 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:16,804 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:16,808 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:16,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:16,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2047867289, now seen corresponding path program 1 times [2019-01-01 00:57:16,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:16,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:16,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:16,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:16,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:17,212 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-01 00:57:17,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:17,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:57:17,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:57:17,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:57:17,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:57:17,241 INFO L87 Difference]: Start difference. First operand 13134 states. Second operand 4 states. [2019-01-01 00:57:17,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:17,814 INFO L93 Difference]: Finished difference Result 13740 states and 55791 transitions. [2019-01-01 00:57:17,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:57:17,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-01-01 00:57:17,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:17,898 INFO L225 Difference]: With dead ends: 13740 [2019-01-01 00:57:17,898 INFO L226 Difference]: Without dead ends: 5627 [2019-01-01 00:57:17,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:57:18,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5627 states. [2019-01-01 00:57:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5627 to 5627. [2019-01-01 00:57:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5627 states. [2019-01-01 00:57:18,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5627 states to 5627 states and 22350 transitions. [2019-01-01 00:57:18,400 INFO L78 Accepts]: Start accepts. Automaton has 5627 states and 22350 transitions. Word has length 33 [2019-01-01 00:57:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:18,403 INFO L480 AbstractCegarLoop]: Abstraction has 5627 states and 22350 transitions. [2019-01-01 00:57:18,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:57:18,405 INFO L276 IsEmpty]: Start isEmpty. Operand 5627 states and 22350 transitions. [2019-01-01 00:57:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 00:57:18,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:18,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:18,414 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:18,415 INFO L82 PathProgramCache]: Analyzing trace with hash -142231847, now seen corresponding path program 1 times [2019-01-01 00:57:18,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:18,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:18,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:18,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:18,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:18,756 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-01 00:57:18,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:18,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:57:18,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:57:18,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:57:18,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:57:18,760 INFO L87 Difference]: Start difference. First operand 5627 states and 22350 transitions. Second operand 5 states. [2019-01-01 00:57:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:19,407 INFO L93 Difference]: Finished difference Result 6139 states and 23830 transitions. [2019-01-01 00:57:19,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:57:19,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-01-01 00:57:19,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:19,457 INFO L225 Difference]: With dead ends: 6139 [2019-01-01 00:57:19,458 INFO L226 Difference]: Without dead ends: 5515 [2019-01-01 00:57:19,459 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-01 00:57:19,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5515 states. [2019-01-01 00:57:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5515 to 5515. [2019-01-01 00:57:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5515 states. [2019-01-01 00:57:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5515 states to 5515 states and 21818 transitions. [2019-01-01 00:57:19,663 INFO L78 Accepts]: Start accepts. Automaton has 5515 states and 21818 transitions. Word has length 34 [2019-01-01 00:57:19,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:19,664 INFO L480 AbstractCegarLoop]: Abstraction has 5515 states and 21818 transitions. [2019-01-01 00:57:19,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:57:19,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5515 states and 21818 transitions. [2019-01-01 00:57:19,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 00:57:19,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:19,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:19,675 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:19,675 INFO L82 PathProgramCache]: Analyzing trace with hash 728950643, now seen corresponding path program 1 times [2019-01-01 00:57:19,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:19,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:19,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:19,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:19,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:19,855 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-01 00:57:19,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:19,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:57:19,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:57:19,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:57:19,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:57:19,858 INFO L87 Difference]: Start difference. First operand 5515 states and 21818 transitions. Second operand 6 states. [2019-01-01 00:57:20,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:20,200 INFO L93 Difference]: Finished difference Result 5451 states and 20826 transitions. [2019-01-01 00:57:20,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:20,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-01-01 00:57:20,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:20,244 INFO L225 Difference]: With dead ends: 5451 [2019-01-01 00:57:20,244 INFO L226 Difference]: Without dead ends: 4843 [2019-01-01 00:57:20,244 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-01 00:57:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4843 states. [2019-01-01 00:57:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4843 to 4843. [2019-01-01 00:57:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4843 states. [2019-01-01 00:57:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 18794 transitions. [2019-01-01 00:57:20,408 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 18794 transitions. Word has length 35 [2019-01-01 00:57:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:20,408 INFO L480 AbstractCegarLoop]: Abstraction has 4843 states and 18794 transitions. [2019-01-01 00:57:20,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:57:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 18794 transitions. [2019-01-01 00:57:20,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 00:57:20,418 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:20,418 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:20,418 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:20,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:20,419 INFO L82 PathProgramCache]: Analyzing trace with hash 908223265, now seen corresponding path program 1 times [2019-01-01 00:57:20,420 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:20,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:20,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:20,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:20,608 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-01 00:57:20,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:20,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:57:20,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:57:20,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:57:20,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:57:20,611 INFO L87 Difference]: Start difference. First operand 4843 states and 18794 transitions. Second operand 7 states. [2019-01-01 00:57:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:21,084 INFO L93 Difference]: Finished difference Result 3563 states and 13034 transitions. [2019-01-01 00:57:21,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:57:21,085 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-01-01 00:57:21,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:21,101 INFO L225 Difference]: With dead ends: 3563 [2019-01-01 00:57:21,102 INFO L226 Difference]: Without dead ends: 3051 [2019-01-01 00:57:21,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:57:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2019-01-01 00:57:21,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 3051. [2019-01-01 00:57:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3051 states. [2019-01-01 00:57:21,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3051 states to 3051 states and 11178 transitions. [2019-01-01 00:57:21,211 INFO L78 Accepts]: Start accepts. Automaton has 3051 states and 11178 transitions. Word has length 36 [2019-01-01 00:57:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:21,212 INFO L480 AbstractCegarLoop]: Abstraction has 3051 states and 11178 transitions. [2019-01-01 00:57:21,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:57:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 3051 states and 11178 transitions. [2019-01-01 00:57:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 00:57:21,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:21,221 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:21,221 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:21,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:21,221 INFO L82 PathProgramCache]: Analyzing trace with hash 552013999, now seen corresponding path program 1 times [2019-01-01 00:57:21,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:21,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:21,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:21,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:21,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:21,617 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-01 00:57:21,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:21,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:57:21,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:57:21,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:57:21,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:57:21,619 INFO L87 Difference]: Start difference. First operand 3051 states and 11178 transitions. Second operand 7 states. [2019-01-01 00:57:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:21,867 INFO L93 Difference]: Finished difference Result 5131 states and 18858 transitions. [2019-01-01 00:57:21,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:21,868 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-01-01 00:57:21,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:21,882 INFO L225 Difference]: With dead ends: 5131 [2019-01-01 00:57:21,882 INFO L226 Difference]: Without dead ends: 2855 [2019-01-01 00:57:21,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:57:21,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2019-01-01 00:57:21,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 2855. [2019-01-01 00:57:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2019-01-01 00:57:21,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 10542 transitions. [2019-01-01 00:57:21,983 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 10542 transitions. Word has length 37 [2019-01-01 00:57:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:21,983 INFO L480 AbstractCegarLoop]: Abstraction has 2855 states and 10542 transitions. [2019-01-01 00:57:21,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:57:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 10542 transitions. [2019-01-01 00:57:21,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 00:57:21,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:21,991 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:21,991 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:21,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:21,992 INFO L82 PathProgramCache]: Analyzing trace with hash 385641711, now seen corresponding path program 2 times [2019-01-01 00:57:21,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:21,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:21,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:21,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:57:21,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:22,238 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-01 00:57:22,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:22,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:57:22,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:57:22,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:57:22,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:57:22,240 INFO L87 Difference]: Start difference. First operand 2855 states and 10542 transitions. Second operand 6 states. [2019-01-01 00:57:22,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:22,448 INFO L93 Difference]: Finished difference Result 4535 states and 16902 transitions. [2019-01-01 00:57:22,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:57:22,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-01-01 00:57:22,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:22,463 INFO L225 Difference]: With dead ends: 4535 [2019-01-01 00:57:22,464 INFO L226 Difference]: Without dead ends: 2755 [2019-01-01 00:57:22,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:57:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-01-01 00:57:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2755. [2019-01-01 00:57:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2755 states. [2019-01-01 00:57:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 10202 transitions. [2019-01-01 00:57:22,550 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 10202 transitions. Word has length 37 [2019-01-01 00:57:22,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:22,551 INFO L480 AbstractCegarLoop]: Abstraction has 2755 states and 10202 transitions. [2019-01-01 00:57:22,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:57:22,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 10202 transitions. [2019-01-01 00:57:22,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 00:57:22,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:22,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:22,558 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:22,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:22,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1966895343, now seen corresponding path program 3 times [2019-01-01 00:57:22,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:22,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:22,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:22,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:57:22,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:22,834 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-01 00:57:22,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:22,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:57:22,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:57:22,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:57:22,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:57:22,835 INFO L87 Difference]: Start difference. First operand 2755 states and 10202 transitions. Second operand 6 states. [2019-01-01 00:57:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:23,008 INFO L93 Difference]: Finished difference Result 4611 states and 17130 transitions. [2019-01-01 00:57:23,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:57:23,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-01-01 00:57:23,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:23,019 INFO L225 Difference]: With dead ends: 4611 [2019-01-01 00:57:23,020 INFO L226 Difference]: Without dead ends: 2575 [2019-01-01 00:57:23,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-01 00:57:23,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-01-01 00:57:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2575. [2019-01-01 00:57:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2575 states. [2019-01-01 00:57:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2575 states to 2575 states and 9590 transitions. [2019-01-01 00:57:23,096 INFO L78 Accepts]: Start accepts. Automaton has 2575 states and 9590 transitions. Word has length 37 [2019-01-01 00:57:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:23,097 INFO L480 AbstractCegarLoop]: Abstraction has 2575 states and 9590 transitions. [2019-01-01 00:57:23,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:57:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2575 states and 9590 transitions. [2019-01-01 00:57:23,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 00:57:23,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:57:23,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:57:23,102 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:57:23,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:57:23,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1178894303, now seen corresponding path program 4 times [2019-01-01 00:57:23,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:57:23,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:57:23,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:23,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:57:23,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:57:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:57:23,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-01-01 00:57:23,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:57:23,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:57:23,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:57:23,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:57:23,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:57:23,235 INFO L87 Difference]: Start difference. First operand 2575 states and 9590 transitions. Second operand 7 states. [2019-01-01 00:57:23,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:57:23,362 INFO L93 Difference]: Finished difference Result 2063 states and 7542 transitions. [2019-01-01 00:57:23,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:57:23,362 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-01-01 00:57:23,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:57:23,363 INFO L225 Difference]: With dead ends: 2063 [2019-01-01 00:57:23,363 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 00:57:23,363 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-01 00:57:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 00:57:23,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 00:57:23,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 00:57:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 00:57:23,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2019-01-01 00:57:23,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:57:23,366 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 00:57:23,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:57:23,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 00:57:23,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 00:57:23,369 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:57:23,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:57:23 BasicIcfg [2019-01-01 00:57:23,370 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:57:23,371 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:57:23,371 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:57:23,371 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:57:23,372 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:57:15" (3/4) ... [2019-01-01 00:57:23,375 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 00:57:23,381 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-01-01 00:57:23,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-01-01 00:57:23,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-01-01 00:57:23,382 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2019-01-01 00:57:23,388 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-01 00:57:23,388 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 00:57:23,435 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:57:23,436 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:57:23,437 INFO L168 Benchmark]: Toolchain (without parser) took 9382.96 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 323.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 199.1 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:23,439 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:57:23,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:23,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.01 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-01 00:57:23,440 INFO L168 Benchmark]: Boogie Preprocessor took 34.23 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:23,442 INFO L168 Benchmark]: RCFGBuilder took 626.02 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:23,443 INFO L168 Benchmark]: TraceAbstraction took 7787.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 198.2 MB. Max. memory is 11.5 GB. [2019-01-01 00:57:23,445 INFO L168 Benchmark]: Witness Printer took 64.96 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:57:23,450 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 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 808.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.01 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 34.23 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 626.02 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7787.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 198.2 MB. Max. memory is 11.5 GB. * Witness Printer took 64.96 ms. Allocated memory is still 1.4 GB. Free memory is still 1.1 GB. 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 9 procedures, 86 locations, 1 error locations. SAFE Result, 7.6s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 538 SDtfs, 817 SDslu, 1387 SDs, 0 SdLazy, 162 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13134occurred 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: 1.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 24206 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...