./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/pthread-wmm/thin002_pso.oepc_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/thin002_pso.oepc_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 296506a137ce7a60cbf4cc21a9df8f0ab9fd9395 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:59:22,127 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 00:59:22,132 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 00:59:22,148 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 00:59:22,149 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 00:59:22,151 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 00:59:22,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 00:59:22,159 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 00:59:22,163 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 00:59:22,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 00:59:22,166 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 00:59:22,166 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 00:59:22,167 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 00:59:22,169 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 00:59:22,178 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 00:59:22,179 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 00:59:22,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 00:59:22,184 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 00:59:22,188 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 00:59:22,190 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 00:59:22,193 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 00:59:22,196 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 00:59:22,200 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 00:59:22,202 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 00:59:22,202 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 00:59:22,203 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 00:59:22,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 00:59:22,207 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 00:59:22,208 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 00:59:22,211 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 00:59:22,211 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 00:59:22,213 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 00:59:22,215 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 00:59:22,215 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 00:59:22,216 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 00:59:22,217 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 00:59:22,217 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:59:22,244 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 00:59:22,245 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 00:59:22,246 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 00:59:22,246 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 00:59:22,246 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 00:59:22,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 00:59:22,247 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 00:59:22,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 00:59:22,247 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 00:59:22,247 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 00:59:22,247 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-01 00:59:22,247 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 00:59:22,248 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-01 00:59:22,248 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 00:59:22,248 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 00:59:22,248 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 00:59:22,248 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-01 00:59:22,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 00:59:22,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 00:59:22,249 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 00:59:22,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 00:59:22,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 00:59:22,249 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 00:59:22,250 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 00:59:22,250 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-01 00:59:22,250 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 00:59:22,250 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 00:59:22,250 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-01 00:59:22,250 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 -> 296506a137ce7a60cbf4cc21a9df8f0ab9fd9395 [2019-01-01 00:59:22,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 00:59:22,332 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 00:59:22,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 00:59:22,342 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 00:59:22,342 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 00:59:22,343 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/pthread-wmm/thin002_pso.oepc_true-unreach-call.i [2019-01-01 00:59:22,415 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706794072/cf3e98c36ae3449cadb97b36342f262b/FLAGddd3c8ea4 [2019-01-01 00:59:23,029 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 00:59:23,029 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/pthread-wmm/thin002_pso.oepc_true-unreach-call.i [2019-01-01 00:59:23,046 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706794072/cf3e98c36ae3449cadb97b36342f262b/FLAGddd3c8ea4 [2019-01-01 00:59:23,260 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/706794072/cf3e98c36ae3449cadb97b36342f262b [2019-01-01 00:59:23,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 00:59:23,266 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 00:59:23,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 00:59:23,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 00:59:23,271 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 00:59:23,272 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:59:23" (1/1) ... [2019-01-01 00:59:23,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c017a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:23, skipping insertion in model container [2019-01-01 00:59:23,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 12:59:23" (1/1) ... [2019-01-01 00:59:23,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 00:59:23,336 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 00:59:23,856 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:59:23,877 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 00:59:23,950 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 00:59:24,120 INFO L195 MainTranslator]: Completed translation [2019-01-01 00:59:24,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:24 WrapperNode [2019-01-01 00:59:24,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 00:59:24,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 00:59:24,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 00:59:24,123 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 00:59:24,130 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:59:24" (1/1) ... [2019-01-01 00:59:24,146 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:59:24" (1/1) ... [2019-01-01 00:59:24,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 00:59:24,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 00:59:24,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 00:59:24,171 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 00:59:24,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:24" (1/1) ... [2019-01-01 00:59:24,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:24" (1/1) ... [2019-01-01 00:59:24,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:24" (1/1) ... [2019-01-01 00:59:24,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:24" (1/1) ... [2019-01-01 00:59:24,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:24" (1/1) ... [2019-01-01 00:59:24,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:24" (1/1) ... [2019-01-01 00:59:24,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:24" (1/1) ... [2019-01-01 00:59:24,202 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 00:59:24,203 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 00:59:24,203 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 00:59:24,203 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 00:59:24,204 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:24" (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:59:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 00:59:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-01-01 00:59:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 00:59:24,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 00:59:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-01-01 00:59:24,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-01-01 00:59:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-01-01 00:59:24,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-01-01 00:59:24,294 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-01-01 00:59:24,294 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-01-01 00:59:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-01-01 00:59:24,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-01-01 00:59:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-01-01 00:59:24,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 00:59:24,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 00:59:24,301 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:59:24,955 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 00:59:24,955 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 00:59:24,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:59:24 BoogieIcfgContainer [2019-01-01 00:59:24,956 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 00:59:24,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 00:59:24,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 00:59:24,962 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 00:59:24,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 12:59:23" (1/3) ... [2019-01-01 00:59:24,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45606bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:59:24, skipping insertion in model container [2019-01-01 00:59:24,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 12:59:24" (2/3) ... [2019-01-01 00:59:24,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45606bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 12:59:24, skipping insertion in model container [2019-01-01 00:59:24,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:59:24" (3/3) ... [2019-01-01 00:59:24,966 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_pso.oepc_true-unreach-call.i [2019-01-01 00:59:25,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,016 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,016 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,017 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,017 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,018 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,018 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,022 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,024 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,024 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,024 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,024 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,025 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,025 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,025 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,026 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,026 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,026 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,026 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,026 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,027 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,027 WARN L317 ript$VariableManager]: TermVariabe Thread3_P3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,027 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,027 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,027 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,027 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,029 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,029 WARN L317 ript$VariableManager]: TermVariabe |Thread3_P3_#t~nondet6.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-01 00:59:25,054 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-01-01 00:59:25,054 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 00:59:25,064 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-01 00:59:25,081 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-01 00:59:25,114 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 00:59:25,115 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 00:59:25,115 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-01 00:59:25,115 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 00:59:25,115 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 00:59:25,115 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 00:59:25,116 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 00:59:25,116 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 00:59:25,116 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 00:59:25,126 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70places, 66 transitions [2019-01-01 00:59:25,998 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 13138 states. [2019-01-01 00:59:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 13138 states. [2019-01-01 00:59:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-01 00:59:26,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:26,035 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:59:26,037 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:26,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:26,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1445141644, now seen corresponding path program 1 times [2019-01-01 00:59:26,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:26,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:26,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:26,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:26,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:26,466 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:59:26,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:26,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 00:59:26,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 00:59:26,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 00:59:26,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 00:59:26,497 INFO L87 Difference]: Start difference. First operand 13138 states. Second operand 4 states. [2019-01-01 00:59:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:26,973 INFO L93 Difference]: Finished difference Result 13744 states and 55795 transitions. [2019-01-01 00:59:26,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 00:59:26,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-01-01 00:59:26,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:27,060 INFO L225 Difference]: With dead ends: 13744 [2019-01-01 00:59:27,061 INFO L226 Difference]: Without dead ends: 5631 [2019-01-01 00:59:27,063 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-01 00:59:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5631 states. [2019-01-01 00:59:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5631 to 5631. [2019-01-01 00:59:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5631 states. [2019-01-01 00:59:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5631 states to 5631 states and 22354 transitions. [2019-01-01 00:59:27,549 INFO L78 Accepts]: Start accepts. Automaton has 5631 states and 22354 transitions. Word has length 37 [2019-01-01 00:59:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:27,551 INFO L480 AbstractCegarLoop]: Abstraction has 5631 states and 22354 transitions. [2019-01-01 00:59:27,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 00:59:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 5631 states and 22354 transitions. [2019-01-01 00:59:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-01 00:59:27,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:27,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:27,562 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:27,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:27,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1883999228, now seen corresponding path program 1 times [2019-01-01 00:59:27,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:27,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:27,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:27,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:27,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:27,837 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:59:27,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:27,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 00:59:27,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 00:59:27,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 00:59:27,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 00:59:27,841 INFO L87 Difference]: Start difference. First operand 5631 states and 22354 transitions. Second operand 5 states. [2019-01-01 00:59:28,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:28,289 INFO L93 Difference]: Finished difference Result 6143 states and 23834 transitions. [2019-01-01 00:59:28,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 00:59:28,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-01-01 00:59:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:28,341 INFO L225 Difference]: With dead ends: 6143 [2019-01-01 00:59:28,341 INFO L226 Difference]: Without dead ends: 5519 [2019-01-01 00:59:28,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:59:28,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5519 states. [2019-01-01 00:59:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5519 to 5519. [2019-01-01 00:59:28,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5519 states. [2019-01-01 00:59:28,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5519 states to 5519 states and 21822 transitions. [2019-01-01 00:59:28,553 INFO L78 Accepts]: Start accepts. Automaton has 5519 states and 21822 transitions. Word has length 38 [2019-01-01 00:59:28,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:28,554 INFO L480 AbstractCegarLoop]: Abstraction has 5519 states and 21822 transitions. [2019-01-01 00:59:28,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 00:59:28,554 INFO L276 IsEmpty]: Start isEmpty. Operand 5519 states and 21822 transitions. [2019-01-01 00:59:28,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-01 00:59:28,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:28,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:28,563 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:28,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:28,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1586589234, now seen corresponding path program 1 times [2019-01-01 00:59:28,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:28,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:28,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:28,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:28,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:28,750 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:59:28,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:28,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 00:59:28,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 00:59:28,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 00:59:28,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-01 00:59:28,752 INFO L87 Difference]: Start difference. First operand 5519 states and 21822 transitions. Second operand 6 states. [2019-01-01 00:59:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:29,029 INFO L93 Difference]: Finished difference Result 5455 states and 20830 transitions. [2019-01-01 00:59:29,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:59:29,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-01-01 00:59:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:29,066 INFO L225 Difference]: With dead ends: 5455 [2019-01-01 00:59:29,066 INFO L226 Difference]: Without dead ends: 4847 [2019-01-01 00:59:29,067 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:59:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2019-01-01 00:59:29,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 4847. [2019-01-01 00:59:29,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4847 states. [2019-01-01 00:59:29,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4847 states to 4847 states and 18798 transitions. [2019-01-01 00:59:29,208 INFO L78 Accepts]: Start accepts. Automaton has 4847 states and 18798 transitions. Word has length 39 [2019-01-01 00:59:29,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:29,209 INFO L480 AbstractCegarLoop]: Abstraction has 4847 states and 18798 transitions. [2019-01-01 00:59:29,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 00:59:29,209 INFO L276 IsEmpty]: Start isEmpty. Operand 4847 states and 18798 transitions. [2019-01-01 00:59:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-01 00:59:29,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:29,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:29,217 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:29,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:29,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2117960818, now seen corresponding path program 1 times [2019-01-01 00:59:29,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:29,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:29,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:29,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:29,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:29,351 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:59:29,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:29,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:59:29,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:59:29,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:59:29,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:59:29,354 INFO L87 Difference]: Start difference. First operand 4847 states and 18798 transitions. Second operand 7 states. [2019-01-01 00:59:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:29,902 INFO L93 Difference]: Finished difference Result 3567 states and 13038 transitions. [2019-01-01 00:59:29,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 00:59:29,905 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-01-01 00:59:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:29,923 INFO L225 Difference]: With dead ends: 3567 [2019-01-01 00:59:29,924 INFO L226 Difference]: Without dead ends: 3055 [2019-01-01 00:59:29,925 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:59:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2019-01-01 00:59:30,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 3055. [2019-01-01 00:59:30,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3055 states. [2019-01-01 00:59:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3055 states to 3055 states and 11182 transitions. [2019-01-01 00:59:30,072 INFO L78 Accepts]: Start accepts. Automaton has 3055 states and 11182 transitions. Word has length 40 [2019-01-01 00:59:30,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:30,076 INFO L480 AbstractCegarLoop]: Abstraction has 3055 states and 11182 transitions. [2019-01-01 00:59:30,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:59:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3055 states and 11182 transitions. [2019-01-01 00:59:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 00:59:30,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:30,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:30,084 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:30,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:30,086 INFO L82 PathProgramCache]: Analyzing trace with hash -2066804268, now seen corresponding path program 1 times [2019-01-01 00:59:30,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:30,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:30,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:30,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:30,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:30,408 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:59:30,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:30,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:59:30,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:59:30,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:59:30,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:59:30,411 INFO L87 Difference]: Start difference. First operand 3055 states and 11182 transitions. Second operand 7 states. [2019-01-01 00:59:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:30,638 INFO L93 Difference]: Finished difference Result 4735 states and 17542 transitions. [2019-01-01 00:59:30,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:59:30,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-01 00:59:30,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:30,650 INFO L225 Difference]: With dead ends: 4735 [2019-01-01 00:59:30,650 INFO L226 Difference]: Without dead ends: 2459 [2019-01-01 00:59:30,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-01 00:59:30,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2019-01-01 00:59:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2459. [2019-01-01 00:59:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2459 states. [2019-01-01 00:59:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2459 states to 2459 states and 9126 transitions. [2019-01-01 00:59:30,735 INFO L78 Accepts]: Start accepts. Automaton has 2459 states and 9126 transitions. Word has length 41 [2019-01-01 00:59:30,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:30,735 INFO L480 AbstractCegarLoop]: Abstraction has 2459 states and 9126 transitions. [2019-01-01 00:59:30,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:59:30,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2459 states and 9126 transitions. [2019-01-01 00:59:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 00:59:30,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:30,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:30,741 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:30,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:30,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1267331510, now seen corresponding path program 2 times [2019-01-01 00:59:30,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:30,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:30,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:30,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 00:59:30,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:31,120 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:59:31,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:31,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 00:59:31,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 00:59:31,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 00:59:31,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:59:31,123 INFO L87 Difference]: Start difference. First operand 2459 states and 9126 transitions. Second operand 12 states. [2019-01-01 00:59:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:31,484 INFO L93 Difference]: Finished difference Result 4219 states and 15686 transitions. [2019-01-01 00:59:31,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:59:31,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-01-01 00:59:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:31,503 INFO L225 Difference]: With dead ends: 4219 [2019-01-01 00:59:31,504 INFO L226 Difference]: Without dead ends: 2423 [2019-01-01 00:59:31,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-01-01 00:59:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-01-01 00:59:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2019-01-01 00:59:31,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-01-01 00:59:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 9034 transitions. [2019-01-01 00:59:31,583 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 9034 transitions. Word has length 41 [2019-01-01 00:59:31,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:31,584 INFO L480 AbstractCegarLoop]: Abstraction has 2423 states and 9034 transitions. [2019-01-01 00:59:31,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 00:59:31,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 9034 transitions. [2019-01-01 00:59:31,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 00:59:31,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:31,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:31,591 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:31,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:31,591 INFO L82 PathProgramCache]: Analyzing trace with hash -947505724, now seen corresponding path program 3 times [2019-01-01 00:59:31,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:31,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:31,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:31,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:59:31,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:31,972 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:59:31,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:31,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 00:59:31,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 00:59:31,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 00:59:31,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:59:31,974 INFO L87 Difference]: Start difference. First operand 2423 states and 9034 transitions. Second operand 12 states. [2019-01-01 00:59:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:32,395 INFO L93 Difference]: Finished difference Result 4087 states and 15338 transitions. [2019-01-01 00:59:32,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:59:32,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-01-01 00:59:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:32,410 INFO L225 Difference]: With dead ends: 4087 [2019-01-01 00:59:32,410 INFO L226 Difference]: Without dead ends: 2327 [2019-01-01 00:59:32,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-01-01 00:59:32,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2327 states. [2019-01-01 00:59:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2327 to 2327. [2019-01-01 00:59:32,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2327 states. [2019-01-01 00:59:32,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2327 states to 2327 states and 8754 transitions. [2019-01-01 00:59:32,476 INFO L78 Accepts]: Start accepts. Automaton has 2327 states and 8754 transitions. Word has length 41 [2019-01-01 00:59:32,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:32,476 INFO L480 AbstractCegarLoop]: Abstraction has 2327 states and 8754 transitions. [2019-01-01 00:59:32,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 00:59:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2327 states and 8754 transitions. [2019-01-01 00:59:32,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 00:59:32,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:32,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:32,482 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:32,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:32,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1706270886, now seen corresponding path program 4 times [2019-01-01 00:59:32,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:32,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:32,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:32,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:59:32,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:32,883 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:59:32,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:32,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 00:59:32,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 00:59:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 00:59:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-01-01 00:59:32,885 INFO L87 Difference]: Start difference. First operand 2327 states and 8754 transitions. Second operand 12 states. [2019-01-01 00:59:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:33,227 INFO L93 Difference]: Finished difference Result 4007 states and 15114 transitions. [2019-01-01 00:59:33,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-01 00:59:33,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-01-01 00:59:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:33,237 INFO L225 Difference]: With dead ends: 4007 [2019-01-01 00:59:33,237 INFO L226 Difference]: Without dead ends: 2307 [2019-01-01 00:59:33,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-01-01 00:59:33,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2019-01-01 00:59:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2019-01-01 00:59:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2307 states. [2019-01-01 00:59:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 8714 transitions. [2019-01-01 00:59:33,308 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 8714 transitions. Word has length 41 [2019-01-01 00:59:33,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:33,308 INFO L480 AbstractCegarLoop]: Abstraction has 2307 states and 8714 transitions. [2019-01-01 00:59:33,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 00:59:33,308 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 8714 transitions. [2019-01-01 00:59:33,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-01 00:59:33,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 00:59:33,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 00:59:33,313 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-01 00:59:33,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 00:59:33,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1979481092, now seen corresponding path program 5 times [2019-01-01 00:59:33,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 00:59:33,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 00:59:33,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:33,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 00:59:33,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 00:59:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 00:59:33,523 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:59:33,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 00:59:33,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 00:59:33,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 00:59:33,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 00:59:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 00:59:33,525 INFO L87 Difference]: Start difference. First operand 2307 states and 8714 transitions. Second operand 7 states. [2019-01-01 00:59:33,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 00:59:33,598 INFO L93 Difference]: Finished difference Result 1795 states and 6666 transitions. [2019-01-01 00:59:33,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 00:59:33,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-01-01 00:59:33,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 00:59:33,598 INFO L225 Difference]: With dead ends: 1795 [2019-01-01 00:59:33,598 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 00:59:33,599 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:59:33,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 00:59:33,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 00:59:33,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 00:59:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 00:59:33,600 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-01-01 00:59:33,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 00:59:33,600 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 00:59:33,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 00:59:33,600 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 00:59:33,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 00:59:33,604 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-01-01 00:59:33,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 12:59:33 BasicIcfg [2019-01-01 00:59:33,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 00:59:33,606 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 00:59:33,606 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 00:59:33,606 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 00:59:33,607 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 12:59:24" (3/4) ... [2019-01-01 00:59:33,611 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 00:59:33,619 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P0 [2019-01-01 00:59:33,619 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P1 [2019-01-01 00:59:33,619 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P2 [2019-01-01 00:59:33,620 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure P3 [2019-01-01 00:59:33,625 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-01 00:59:33,625 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-01 00:59:33,674 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 00:59:33,674 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 00:59:33,675 INFO L168 Benchmark]: Toolchain (without parser) took 10410.65 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 332.4 MB). Free memory was 952.7 MB in the beginning and 916.7 MB in the end (delta: 36.0 MB). Peak memory consumption was 368.4 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:33,677 INFO L168 Benchmark]: CDTParser took 0.16 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-01 00:59:33,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 854.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:33,679 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.77 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-01 00:59:33,679 INFO L168 Benchmark]: Boogie Preprocessor took 32.12 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:59:33,680 INFO L168 Benchmark]: RCFGBuilder took 752.97 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.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:33,680 INFO L168 Benchmark]: TraceAbstraction took 8649.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 916.7 MB in the end (delta: 187.9 MB). Peak memory consumption was 378.2 MB. Max. memory is 11.5 GB. [2019-01-01 00:59:33,681 INFO L168 Benchmark]: Witness Printer took 68.40 ms. Allocated memory is still 1.4 GB. Free memory is still 916.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 00:59:33,685 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.16 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 854.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -183.0 MB). Peak memory consumption was 54.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.77 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 32.12 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 752.97 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.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8649.36 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 190.3 MB). Free memory was 1.1 GB in the beginning and 916.7 MB in the end (delta: 187.9 MB). Peak memory consumption was 378.2 MB. Max. memory is 11.5 GB. * Witness Printer took 68.40 ms. Allocated memory is still 1.4 GB. Free memory is still 916.7 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 9 procedures, 90 locations, 1 error locations. SAFE Result, 8.5s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 3.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 735 SDtfs, 1159 SDslu, 3579 SDs, 0 SdLazy, 541 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13138occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 54990 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...