./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.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 aa6f701e3114f964d079a3c4b968eefa99b542c6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 18:33:33,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:33:33,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:33:33,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:33:33,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:33:33,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:33:33,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:33:33,176 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:33:33,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:33:33,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:33:33,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:33:33,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:33:33,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:33:33,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:33:33,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:33:33,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:33:33,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:33:33,187 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:33:33,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:33:33,191 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:33:33,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:33:33,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:33:33,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:33:33,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:33:33,199 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:33:33,199 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:33:33,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:33:33,200 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:33:33,201 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:33:33,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:33:33,202 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:33:33,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:33:33,204 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:33:33,205 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:33:33,206 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:33:33,206 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:33:33,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:33:33,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:33:33,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:33:33,209 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:33:33,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:33:33,210 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 18:33:33,225 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:33:33,226 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:33:33,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:33:33,228 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:33:33,228 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:33:33,228 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:33:33,228 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:33:33,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:33:33,229 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:33:33,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:33:33,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:33:33,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:33:33,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:33:33,230 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:33:33,230 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:33:33,230 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:33:33,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:33:33,231 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:33:33,231 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:33:33,231 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:33:33,231 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:33:33,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:33:33,232 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:33:33,232 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:33:33,232 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:33:33,232 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:33:33,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:33:33,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:33:33,233 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:33:33,233 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> aa6f701e3114f964d079a3c4b968eefa99b542c6 [2019-11-28 18:33:33,570 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:33:33,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:33:33,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:33:33,595 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:33:33,595 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:33:33,596 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i [2019-11-28 18:33:33,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7892b5604/84329880e3134ded850e60281b09016d/FLAGeaf95b934 [2019-11-28 18:33:34,142 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:33:34,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe033_rmo.opt.i [2019-11-28 18:33:34,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7892b5604/84329880e3134ded850e60281b09016d/FLAGeaf95b934 [2019-11-28 18:33:34,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7892b5604/84329880e3134ded850e60281b09016d [2019-11-28 18:33:34,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:33:34,442 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:33:34,443 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:33:34,443 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:33:34,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:33:34,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:33:34" (1/1) ... [2019-11-28 18:33:34,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29271dbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:34, skipping insertion in model container [2019-11-28 18:33:34,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:33:34" (1/1) ... [2019-11-28 18:33:34,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:33:34,542 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:33:35,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:33:35,077 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:33:35,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:33:35,223 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:33:35,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:35 WrapperNode [2019-11-28 18:33:35,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:33:35,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:33:35,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:33:35,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:33:35,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:35" (1/1) ... [2019-11-28 18:33:35,255 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:35" (1/1) ... [2019-11-28 18:33:35,287 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:33:35,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:33:35,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:33:35,288 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:33:35,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:35" (1/1) ... [2019-11-28 18:33:35,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:35" (1/1) ... [2019-11-28 18:33:35,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:35" (1/1) ... [2019-11-28 18:33:35,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:35" (1/1) ... [2019-11-28 18:33:35,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:35" (1/1) ... [2019-11-28 18:33:35,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:35" (1/1) ... [2019-11-28 18:33:35,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:35" (1/1) ... [2019-11-28 18:33:35,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:33:35,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:33:35,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:33:35,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:33:35,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:35" (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-11-28 18:33:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:33:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:33:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:33:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:33:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:33:35,422 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:33:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:33:35,422 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:33:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:33:35,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:33:35,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:33:35,425 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-28 18:33:36,142 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:33:36,142 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:33:36,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:36 BoogieIcfgContainer [2019-11-28 18:33:36,144 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:33:36,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:33:36,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:33:36,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:33:36,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:33:34" (1/3) ... [2019-11-28 18:33:36,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417e40ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:33:36, skipping insertion in model container [2019-11-28 18:33:36,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:33:35" (2/3) ... [2019-11-28 18:33:36,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417e40ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:33:36, skipping insertion in model container [2019-11-28 18:33:36,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:36" (3/3) ... [2019-11-28 18:33:36,153 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_rmo.opt.i [2019-11-28 18:33:36,164 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:33:36,164 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:33:36,173 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:33:36,174 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:33:36,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,228 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,229 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,230 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,230 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,230 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,268 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,269 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,270 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,270 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:33:36,304 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:33:36,327 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:33:36,327 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:33:36,328 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:33:36,328 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:33:36,328 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:33:36,328 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:33:36,328 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:33:36,328 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:33:36,355 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-11-28 18:33:36,357 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-11-28 18:33:36,449 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-11-28 18:33:36,450 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:33:36,465 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:33:36,486 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-11-28 18:33:36,529 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-11-28 18:33:36,529 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:33:36,537 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:33:36,554 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:33:36,555 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:33:40,859 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-11-28 18:33:41,004 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 18:33:41,143 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40283 [2019-11-28 18:33:41,143 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-11-28 18:33:41,148 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 78 transitions [2019-11-28 18:33:41,614 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-11-28 18:33:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-11-28 18:33:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:33:41,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:41,627 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:33:41,628 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:41,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash 673057218, now seen corresponding path program 1 times [2019-11-28 18:33:41,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:41,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536678722] [2019-11-28 18:33:41,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:41,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536678722] [2019-11-28 18:33:41,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:41,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:33:41,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423517078] [2019-11-28 18:33:41,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:41,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:41,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:41,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:41,932 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-11-28 18:33:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:42,165 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-11-28 18:33:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:42,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:33:42,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:42,236 INFO L225 Difference]: With dead ends: 6240 [2019-11-28 18:33:42,237 INFO L226 Difference]: Without dead ends: 5850 [2019-11-28 18:33:42,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:42,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-11-28 18:33:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-11-28 18:33:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-11-28 18:33:42,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-11-28 18:33:42,586 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-11-28 18:33:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:42,586 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-11-28 18:33:42,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-11-28 18:33:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:33:42,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:42,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:42,590 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:42,590 INFO L82 PathProgramCache]: Analyzing trace with hash 93905246, now seen corresponding path program 1 times [2019-11-28 18:33:42,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:42,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590959275] [2019-11-28 18:33:42,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:42,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:42,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590959275] [2019-11-28 18:33:42,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:42,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:42,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934335265] [2019-11-28 18:33:42,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:42,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:42,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:42,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:42,683 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 4 states. [2019-11-28 18:33:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:43,017 INFO L93 Difference]: Finished difference Result 9088 states and 29317 transitions. [2019-11-28 18:33:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:33:43,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:33:43,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:43,106 INFO L225 Difference]: With dead ends: 9088 [2019-11-28 18:33:43,107 INFO L226 Difference]: Without dead ends: 9073 [2019-11-28 18:33:43,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:43,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9073 states. [2019-11-28 18:33:43,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 8163. [2019-11-28 18:33:43,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8163 states. [2019-11-28 18:33:43,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 26811 transitions. [2019-11-28 18:33:43,453 INFO L78 Accepts]: Start accepts. Automaton has 8163 states and 26811 transitions. Word has length 11 [2019-11-28 18:33:43,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:43,454 INFO L462 AbstractCegarLoop]: Abstraction has 8163 states and 26811 transitions. [2019-11-28 18:33:43,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:43,454 INFO L276 IsEmpty]: Start isEmpty. Operand 8163 states and 26811 transitions. [2019-11-28 18:33:43,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:33:43,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:43,459 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:43,459 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:43,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:43,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1893769716, now seen corresponding path program 1 times [2019-11-28 18:33:43,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:43,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772843288] [2019-11-28 18:33:43,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:43,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772843288] [2019-11-28 18:33:43,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:43,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:43,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021941820] [2019-11-28 18:33:43,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:43,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:43,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:43,540 INFO L87 Difference]: Start difference. First operand 8163 states and 26811 transitions. Second operand 3 states. [2019-11-28 18:33:43,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:43,662 INFO L93 Difference]: Finished difference Result 10304 states and 33095 transitions. [2019-11-28 18:33:43,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:43,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:33:43,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:43,704 INFO L225 Difference]: With dead ends: 10304 [2019-11-28 18:33:43,704 INFO L226 Difference]: Without dead ends: 10304 [2019-11-28 18:33:43,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:43,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10304 states. [2019-11-28 18:33:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10304 to 8837. [2019-11-28 18:33:44,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8837 states. [2019-11-28 18:33:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 28865 transitions. [2019-11-28 18:33:44,137 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 28865 transitions. Word has length 14 [2019-11-28 18:33:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:44,137 INFO L462 AbstractCegarLoop]: Abstraction has 8837 states and 28865 transitions. [2019-11-28 18:33:44,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 28865 transitions. [2019-11-28 18:33:44,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:33:44,140 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:44,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:44,141 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:44,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:44,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1890038153, now seen corresponding path program 1 times [2019-11-28 18:33:44,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:44,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555636016] [2019-11-28 18:33:44,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:44,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:44,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555636016] [2019-11-28 18:33:44,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:44,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:44,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183095429] [2019-11-28 18:33:44,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:44,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:44,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:44,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:44,242 INFO L87 Difference]: Start difference. First operand 8837 states and 28865 transitions. Second operand 4 states. [2019-11-28 18:33:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:44,456 INFO L93 Difference]: Finished difference Result 10707 states and 34201 transitions. [2019-11-28 18:33:44,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:33:44,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:33:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:44,494 INFO L225 Difference]: With dead ends: 10707 [2019-11-28 18:33:44,494 INFO L226 Difference]: Without dead ends: 10697 [2019-11-28 18:33:44,494 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10697 states. [2019-11-28 18:33:44,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10697 to 9298. [2019-11-28 18:33:44,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9298 states. [2019-11-28 18:33:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9298 states to 9298 states and 30231 transitions. [2019-11-28 18:33:44,807 INFO L78 Accepts]: Start accepts. Automaton has 9298 states and 30231 transitions. Word has length 14 [2019-11-28 18:33:44,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:44,807 INFO L462 AbstractCegarLoop]: Abstraction has 9298 states and 30231 transitions. [2019-11-28 18:33:44,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand 9298 states and 30231 transitions. [2019-11-28 18:33:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:33:44,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:44,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:44,810 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:44,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash 422006117, now seen corresponding path program 1 times [2019-11-28 18:33:44,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:44,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737279227] [2019-11-28 18:33:44,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:44,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737279227] [2019-11-28 18:33:44,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:44,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:44,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877470927] [2019-11-28 18:33:44,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:44,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:44,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:44,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:44,874 INFO L87 Difference]: Start difference. First operand 9298 states and 30231 transitions. Second operand 4 states. [2019-11-28 18:33:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:45,079 INFO L93 Difference]: Finished difference Result 11850 states and 37991 transitions. [2019-11-28 18:33:45,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:33:45,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:33:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:45,107 INFO L225 Difference]: With dead ends: 11850 [2019-11-28 18:33:45,108 INFO L226 Difference]: Without dead ends: 11835 [2019-11-28 18:33:45,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:45,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11835 states. [2019-11-28 18:33:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11835 to 9707. [2019-11-28 18:33:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9707 states. [2019-11-28 18:33:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 31642 transitions. [2019-11-28 18:33:45,390 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 31642 transitions. Word has length 14 [2019-11-28 18:33:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:45,391 INFO L462 AbstractCegarLoop]: Abstraction has 9707 states and 31642 transitions. [2019-11-28 18:33:45,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 31642 transitions. [2019-11-28 18:33:45,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:33:45,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:45,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:33:45,396 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:45,396 INFO L82 PathProgramCache]: Analyzing trace with hash -247442678, now seen corresponding path program 1 times [2019-11-28 18:33:45,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:45,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589685090] [2019-11-28 18:33:45,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:45,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:45,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589685090] [2019-11-28 18:33:45,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:45,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:45,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753455472] [2019-11-28 18:33:45,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:45,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:45,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:45,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:45,438 INFO L87 Difference]: Start difference. First operand 9707 states and 31642 transitions. Second operand 3 states. [2019-11-28 18:33:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:45,455 INFO L93 Difference]: Finished difference Result 1607 states and 3887 transitions. [2019-11-28 18:33:45,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:45,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:33:45,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:45,460 INFO L225 Difference]: With dead ends: 1607 [2019-11-28 18:33:45,461 INFO L226 Difference]: Without dead ends: 1607 [2019-11-28 18:33:45,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:45,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-11-28 18:33:45,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2019-11-28 18:33:45,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-11-28 18:33:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-11-28 18:33:45,492 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 16 [2019-11-28 18:33:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:45,492 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-11-28 18:33:45,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-11-28 18:33:45,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:33:45,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:45,495 INFO L410 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] [2019-11-28 18:33:45,496 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:45,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:45,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1141853416, now seen corresponding path program 1 times [2019-11-28 18:33:45,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:45,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89710675] [2019-11-28 18:33:45,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:45,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89710675] [2019-11-28 18:33:45,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:45,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:45,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007379743] [2019-11-28 18:33:45,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:33:45,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:45,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:33:45,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:45,600 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 5 states. [2019-11-28 18:33:45,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:45,802 INFO L93 Difference]: Finished difference Result 2202 states and 5235 transitions. [2019-11-28 18:33:45,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:33:45,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:33:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:45,806 INFO L225 Difference]: With dead ends: 2202 [2019-11-28 18:33:45,806 INFO L226 Difference]: Without dead ends: 2200 [2019-11-28 18:33:45,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:33:45,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2019-11-28 18:33:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 1723. [2019-11-28 18:33:45,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-11-28 18:33:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 4159 transitions. [2019-11-28 18:33:45,923 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 4159 transitions. Word has length 26 [2019-11-28 18:33:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:45,924 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 4159 transitions. [2019-11-28 18:33:45,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:33:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 4159 transitions. [2019-11-28 18:33:45,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:33:45,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:45,930 INFO L410 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] [2019-11-28 18:33:45,931 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:45,931 INFO L82 PathProgramCache]: Analyzing trace with hash -344365836, now seen corresponding path program 1 times [2019-11-28 18:33:45,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:45,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591942007] [2019-11-28 18:33:45,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:45,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:45,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591942007] [2019-11-28 18:33:45,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:45,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:45,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040870129] [2019-11-28 18:33:45,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:45,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:45,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:45,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:45,996 INFO L87 Difference]: Start difference. First operand 1723 states and 4159 transitions. Second operand 3 states. [2019-11-28 18:33:46,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:46,039 INFO L93 Difference]: Finished difference Result 2209 states and 5197 transitions. [2019-11-28 18:33:46,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:46,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 18:33:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:46,042 INFO L225 Difference]: With dead ends: 2209 [2019-11-28 18:33:46,042 INFO L226 Difference]: Without dead ends: 2209 [2019-11-28 18:33:46,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2019-11-28 18:33:46,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 1753. [2019-11-28 18:33:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2019-11-28 18:33:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 4059 transitions. [2019-11-28 18:33:46,077 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 4059 transitions. Word has length 26 [2019-11-28 18:33:46,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:46,077 INFO L462 AbstractCegarLoop]: Abstraction has 1753 states and 4059 transitions. [2019-11-28 18:33:46,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 4059 transitions. [2019-11-28 18:33:46,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:33:46,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:46,081 INFO L410 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] [2019-11-28 18:33:46,081 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:46,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:46,082 INFO L82 PathProgramCache]: Analyzing trace with hash -281839928, now seen corresponding path program 1 times [2019-11-28 18:33:46,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:46,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553944436] [2019-11-28 18:33:46,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:46,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553944436] [2019-11-28 18:33:46,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:46,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:33:46,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116197132] [2019-11-28 18:33:46,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:33:46,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:46,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:33:46,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:46,226 INFO L87 Difference]: Start difference. First operand 1753 states and 4059 transitions. Second operand 5 states. [2019-11-28 18:33:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:46,618 INFO L93 Difference]: Finished difference Result 2526 states and 5750 transitions. [2019-11-28 18:33:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:33:46,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:33:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:46,623 INFO L225 Difference]: With dead ends: 2526 [2019-11-28 18:33:46,623 INFO L226 Difference]: Without dead ends: 2526 [2019-11-28 18:33:46,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:33:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2019-11-28 18:33:46,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2091. [2019-11-28 18:33:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2019-11-28 18:33:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 4785 transitions. [2019-11-28 18:33:46,668 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 4785 transitions. Word has length 26 [2019-11-28 18:33:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:46,670 INFO L462 AbstractCegarLoop]: Abstraction has 2091 states and 4785 transitions. [2019-11-28 18:33:46,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:33:46,671 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 4785 transitions. [2019-11-28 18:33:46,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:33:46,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:46,679 INFO L410 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] [2019-11-28 18:33:46,680 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:46,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:46,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1359644488, now seen corresponding path program 1 times [2019-11-28 18:33:46,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:46,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471956369] [2019-11-28 18:33:46,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:46,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471956369] [2019-11-28 18:33:46,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:46,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:46,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376168020] [2019-11-28 18:33:46,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:33:46,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:46,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:33:46,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:46,779 INFO L87 Difference]: Start difference. First operand 2091 states and 4785 transitions. Second operand 5 states. [2019-11-28 18:33:46,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:46,971 INFO L93 Difference]: Finished difference Result 2585 states and 5903 transitions. [2019-11-28 18:33:46,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:33:46,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:33:46,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:46,975 INFO L225 Difference]: With dead ends: 2585 [2019-11-28 18:33:46,976 INFO L226 Difference]: Without dead ends: 2583 [2019-11-28 18:33:46,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:33:46,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-11-28 18:33:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2064. [2019-11-28 18:33:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2064 states. [2019-11-28 18:33:47,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 4700 transitions. [2019-11-28 18:33:47,015 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 4700 transitions. Word has length 27 [2019-11-28 18:33:47,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:47,016 INFO L462 AbstractCegarLoop]: Abstraction has 2064 states and 4700 transitions. [2019-11-28 18:33:47,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:33:47,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 4700 transitions. [2019-11-28 18:33:47,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:33:47,020 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:47,020 INFO L410 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] [2019-11-28 18:33:47,021 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:47,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:47,021 INFO L82 PathProgramCache]: Analyzing trace with hash 620709763, now seen corresponding path program 1 times [2019-11-28 18:33:47,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:47,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92348817] [2019-11-28 18:33:47,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:47,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92348817] [2019-11-28 18:33:47,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:47,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:33:47,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575473972] [2019-11-28 18:33:47,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:33:47,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:47,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:33:47,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:47,092 INFO L87 Difference]: Start difference. First operand 2064 states and 4700 transitions. Second operand 4 states. [2019-11-28 18:33:47,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:47,110 INFO L93 Difference]: Finished difference Result 1075 states and 2243 transitions. [2019-11-28 18:33:47,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:33:47,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 18:33:47,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:47,112 INFO L225 Difference]: With dead ends: 1075 [2019-11-28 18:33:47,112 INFO L226 Difference]: Without dead ends: 1075 [2019-11-28 18:33:47,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:33:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2019-11-28 18:33:47,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 943. [2019-11-28 18:33:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2019-11-28 18:33:47,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1991 transitions. [2019-11-28 18:33:47,130 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1991 transitions. Word has length 27 [2019-11-28 18:33:47,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:47,130 INFO L462 AbstractCegarLoop]: Abstraction has 943 states and 1991 transitions. [2019-11-28 18:33:47,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:33:47,130 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1991 transitions. [2019-11-28 18:33:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:47,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:47,135 INFO L410 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-11-28 18:33:47,135 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:47,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:47,135 INFO L82 PathProgramCache]: Analyzing trace with hash 562189682, now seen corresponding path program 1 times [2019-11-28 18:33:47,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:47,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363318514] [2019-11-28 18:33:47,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:47,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:47,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363318514] [2019-11-28 18:33:47,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:47,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:33:47,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914308947] [2019-11-28 18:33:47,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:33:47,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:47,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:33:47,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:33:47,287 INFO L87 Difference]: Start difference. First operand 943 states and 1991 transitions. Second operand 5 states. [2019-11-28 18:33:47,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:47,408 INFO L93 Difference]: Finished difference Result 1146 states and 2377 transitions. [2019-11-28 18:33:47,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:33:47,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-28 18:33:47,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:47,410 INFO L225 Difference]: With dead ends: 1146 [2019-11-28 18:33:47,410 INFO L226 Difference]: Without dead ends: 1146 [2019-11-28 18:33:47,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:33:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2019-11-28 18:33:47,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 969. [2019-11-28 18:33:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 969 states. [2019-11-28 18:33:47,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2043 transitions. [2019-11-28 18:33:47,424 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 2043 transitions. Word has length 41 [2019-11-28 18:33:47,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:47,425 INFO L462 AbstractCegarLoop]: Abstraction has 969 states and 2043 transitions. [2019-11-28 18:33:47,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:33:47,425 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 2043 transitions. [2019-11-28 18:33:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:47,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:47,428 INFO L410 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-11-28 18:33:47,428 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:47,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:47,428 INFO L82 PathProgramCache]: Analyzing trace with hash 2091375240, now seen corresponding path program 2 times [2019-11-28 18:33:47,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:47,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364284481] [2019-11-28 18:33:47,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:47,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364284481] [2019-11-28 18:33:47,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:47,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 18:33:47,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069824681] [2019-11-28 18:33:47,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:33:47,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:47,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:33:47,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:33:47,598 INFO L87 Difference]: Start difference. First operand 969 states and 2043 transitions. Second operand 9 states. [2019-11-28 18:33:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:48,465 INFO L93 Difference]: Finished difference Result 2153 states and 4568 transitions. [2019-11-28 18:33:48,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 18:33:48,466 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-11-28 18:33:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:48,469 INFO L225 Difference]: With dead ends: 2153 [2019-11-28 18:33:48,469 INFO L226 Difference]: Without dead ends: 1885 [2019-11-28 18:33:48,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-11-28 18:33:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2019-11-28 18:33:48,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 971. [2019-11-28 18:33:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 971 states. [2019-11-28 18:33:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 2040 transitions. [2019-11-28 18:33:48,491 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 2040 transitions. Word has length 41 [2019-11-28 18:33:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:48,492 INFO L462 AbstractCegarLoop]: Abstraction has 971 states and 2040 transitions. [2019-11-28 18:33:48,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:33:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 2040 transitions. [2019-11-28 18:33:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:48,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:48,495 INFO L410 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-11-28 18:33:48,495 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:48,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:48,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1380359352, now seen corresponding path program 3 times [2019-11-28 18:33:48,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:48,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072883580] [2019-11-28 18:33:48,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:48,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:48,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072883580] [2019-11-28 18:33:48,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:48,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:33:48,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514031043] [2019-11-28 18:33:48,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:33:48,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:48,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:33:48,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:33:48,601 INFO L87 Difference]: Start difference. First operand 971 states and 2040 transitions. Second operand 6 states. [2019-11-28 18:33:48,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:48,857 INFO L93 Difference]: Finished difference Result 3362 states and 6955 transitions. [2019-11-28 18:33:48,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 18:33:48,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-28 18:33:48,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:48,862 INFO L225 Difference]: With dead ends: 3362 [2019-11-28 18:33:48,862 INFO L226 Difference]: Without dead ends: 2202 [2019-11-28 18:33:48,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-28 18:33:48,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states. [2019-11-28 18:33:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 1020. [2019-11-28 18:33:48,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-11-28 18:33:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 2127 transitions. [2019-11-28 18:33:48,889 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 2127 transitions. Word has length 41 [2019-11-28 18:33:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:48,890 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 2127 transitions. [2019-11-28 18:33:48,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:33:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 2127 transitions. [2019-11-28 18:33:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:48,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:48,893 INFO L410 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-11-28 18:33:48,893 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:48,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:48,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1129012948, now seen corresponding path program 4 times [2019-11-28 18:33:48,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:48,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473708072] [2019-11-28 18:33:48,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:49,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:49,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473708072] [2019-11-28 18:33:49,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:49,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:33:49,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060826949] [2019-11-28 18:33:49,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 18:33:49,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:49,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 18:33:49,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 18:33:49,073 INFO L87 Difference]: Start difference. First operand 1020 states and 2127 transitions. Second operand 9 states. [2019-11-28 18:33:49,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:49,769 INFO L93 Difference]: Finished difference Result 1204 states and 2357 transitions. [2019-11-28 18:33:49,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 18:33:49,770 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-11-28 18:33:49,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:49,772 INFO L225 Difference]: With dead ends: 1204 [2019-11-28 18:33:49,772 INFO L226 Difference]: Without dead ends: 1204 [2019-11-28 18:33:49,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-11-28 18:33:49,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2019-11-28 18:33:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 841. [2019-11-28 18:33:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-11-28 18:33:49,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1695 transitions. [2019-11-28 18:33:49,792 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1695 transitions. Word has length 41 [2019-11-28 18:33:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:49,792 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1695 transitions. [2019-11-28 18:33:49,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 18:33:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1695 transitions. [2019-11-28 18:33:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:49,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:49,795 INFO L410 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-11-28 18:33:49,795 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:49,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:49,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1290807276, now seen corresponding path program 5 times [2019-11-28 18:33:49,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:49,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642052744] [2019-11-28 18:33:49,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:49,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:49,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642052744] [2019-11-28 18:33:49,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:49,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:33:49,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304829689] [2019-11-28 18:33:49,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:33:49,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:49,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:33:49,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:33:49,890 INFO L87 Difference]: Start difference. First operand 841 states and 1695 transitions. Second operand 6 states. [2019-11-28 18:33:50,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:50,318 INFO L93 Difference]: Finished difference Result 1045 states and 2074 transitions. [2019-11-28 18:33:50,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:33:50,318 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-11-28 18:33:50,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:50,321 INFO L225 Difference]: With dead ends: 1045 [2019-11-28 18:33:50,321 INFO L226 Difference]: Without dead ends: 1045 [2019-11-28 18:33:50,321 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:33:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2019-11-28 18:33:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 847. [2019-11-28 18:33:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-11-28 18:33:50,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1706 transitions. [2019-11-28 18:33:50,342 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1706 transitions. Word has length 41 [2019-11-28 18:33:50,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:50,343 INFO L462 AbstractCegarLoop]: Abstraction has 847 states and 1706 transitions. [2019-11-28 18:33:50,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:33:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1706 transitions. [2019-11-28 18:33:50,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 18:33:50,346 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:50,346 INFO L410 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-11-28 18:33:50,346 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:50,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1489299242, now seen corresponding path program 6 times [2019-11-28 18:33:50,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:50,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493551734] [2019-11-28 18:33:50,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:50,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493551734] [2019-11-28 18:33:50,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:50,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:50,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101625488] [2019-11-28 18:33:50,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:50,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:50,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:50,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:50,473 INFO L87 Difference]: Start difference. First operand 847 states and 1706 transitions. Second operand 3 states. [2019-11-28 18:33:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:50,486 INFO L93 Difference]: Finished difference Result 847 states and 1704 transitions. [2019-11-28 18:33:50,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:50,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-28 18:33:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:50,488 INFO L225 Difference]: With dead ends: 847 [2019-11-28 18:33:50,488 INFO L226 Difference]: Without dead ends: 847 [2019-11-28 18:33:50,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-11-28 18:33:50,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 734. [2019-11-28 18:33:50,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2019-11-28 18:33:50,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1495 transitions. [2019-11-28 18:33:50,501 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1495 transitions. Word has length 41 [2019-11-28 18:33:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:50,501 INFO L462 AbstractCegarLoop]: Abstraction has 734 states and 1495 transitions. [2019-11-28 18:33:50,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:50,502 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1495 transitions. [2019-11-28 18:33:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:33:50,503 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:50,504 INFO L410 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, 1] [2019-11-28 18:33:50,504 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash 58672515, now seen corresponding path program 1 times [2019-11-28 18:33:50,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:50,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494482824] [2019-11-28 18:33:50,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:33:50,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 18:33:50,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494482824] [2019-11-28 18:33:50,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:33:50,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:33:50,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991180249] [2019-11-28 18:33:50,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:33:50,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:33:50,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:33:50,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:50,573 INFO L87 Difference]: Start difference. First operand 734 states and 1495 transitions. Second operand 3 states. [2019-11-28 18:33:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:33:50,585 INFO L93 Difference]: Finished difference Result 1223 states and 2487 transitions. [2019-11-28 18:33:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:33:50,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-28 18:33:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:33:50,587 INFO L225 Difference]: With dead ends: 1223 [2019-11-28 18:33:50,587 INFO L226 Difference]: Without dead ends: 507 [2019-11-28 18:33:50,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:33:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2019-11-28 18:33:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 507. [2019-11-28 18:33:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2019-11-28 18:33:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 1020 transitions. [2019-11-28 18:33:50,595 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 1020 transitions. Word has length 42 [2019-11-28 18:33:50,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:33:50,595 INFO L462 AbstractCegarLoop]: Abstraction has 507 states and 1020 transitions. [2019-11-28 18:33:50,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:33:50,595 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 1020 transitions. [2019-11-28 18:33:50,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:33:50,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:33:50,597 INFO L410 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, 1] [2019-11-28 18:33:50,597 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:33:50,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:33:50,597 INFO L82 PathProgramCache]: Analyzing trace with hash -296631181, now seen corresponding path program 2 times [2019-11-28 18:33:50,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:33:50,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371888671] [2019-11-28 18:33:50,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:33:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:33:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:33:50,694 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:33:50,694 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:33:50,699 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2571~0.base_24| 4) |v_#length_15|) (= 0 v_~x$r_buff0_thd2~0_163) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2571~0.base_24|) (= v_~x$r_buff0_thd0~0_130 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2571~0.base_24|) 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2571~0.base_24| 1)) (= v_~y~0_90 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2571~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2571~0.base_24|) |v_ULTIMATE.start_main_~#t2571~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~x$r_buff1_thd2~0_124) (= |v_ULTIMATE.start_main_~#t2571~0.offset_18| 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2572~0.offset=|v_ULTIMATE.start_main_~#t2572~0.offset_18|, ~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_~#t2571~0.base=|v_ULTIMATE.start_main_~#t2571~0.base_24|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, #length=|v_#length_15|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t2571~0.offset=|v_ULTIMATE.start_main_~#t2571~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ULTIMATE.start_main_~#t2572~0.base=|v_ULTIMATE.start_main_~#t2572~0.base_25|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2572~0.offset, ~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2571~0.base, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t2571~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2572~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:33:50,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2572~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t2572~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2572~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2572~0.base_11|) |v_ULTIMATE.start_main_~#t2572~0.offset_9| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2572~0.base_11| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2572~0.base_11|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2572~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2572~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2572~0.offset=|v_ULTIMATE.start_main_~#t2572~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2572~0.base=|v_ULTIMATE.start_main_~#t2572~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2572~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2572~0.base] because there is no mapped edge [2019-11-28 18:33:50,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:33:50,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1252423455 256)))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite9_Out-1252423455| |P0Thread1of1ForFork1_#t~ite8_Out-1252423455|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1252423455 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1252423455 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1252423455 256) 0)) (= (mod ~x$w_buff0_used~0_In-1252423455 256) 0))) (= ~x$w_buff0~0_In-1252423455 |P0Thread1of1ForFork1_#t~ite8_Out-1252423455|)) (and (= |P0Thread1of1ForFork1_#t~ite8_In-1252423455| |P0Thread1of1ForFork1_#t~ite8_Out-1252423455|) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite9_Out-1252423455| ~x$w_buff0~0_In-1252423455)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1252423455, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1252423455, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1252423455|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1252423455, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1252423455, ~weak$$choice2~0=~weak$$choice2~0_In-1252423455, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1252423455} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1252423455, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1252423455, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1252423455|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1252423455|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1252423455, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1252423455, ~weak$$choice2~0=~weak$$choice2~0_In-1252423455, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1252423455} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-11-28 18:33:50,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:33:50,708 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:33:50,709 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1223107028 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1223107028 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1223107028 |P1Thread1of1ForFork0_#t~ite28_Out1223107028|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1223107028|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1223107028, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1223107028} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1223107028, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1223107028|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1223107028} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:33:50,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In170441362 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In170441362 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In170441362 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In170441362 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out170441362| ~x$w_buff1_used~0_In170441362) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out170441362| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In170441362, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In170441362, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In170441362, ~x$w_buff0_used~0=~x$w_buff0_used~0_In170441362} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In170441362, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In170441362, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In170441362, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out170441362|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In170441362} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:33:50,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In-1470852727 ~x$r_buff0_thd2~0_Out-1470852727)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1470852727 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1470852727 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= 0 ~x$r_buff0_thd2~0_Out-1470852727) (not .cse2) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1470852727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1470852727} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1470852727|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1470852727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1470852727} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:33:50,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1008361533 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1008361533 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1008361533 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1008361533 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1008361533|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1008361533 |P1Thread1of1ForFork0_#t~ite31_Out-1008361533|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1008361533, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1008361533, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1008361533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1008361533} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1008361533|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1008361533, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1008361533, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1008361533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1008361533} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:33:50,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:33:50,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:33:50,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite35_Out1205869130| |ULTIMATE.start_main_#t~ite34_Out1205869130|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1205869130 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1205869130 256) 0))) (or (and .cse0 (= ~x~0_In1205869130 |ULTIMATE.start_main_#t~ite34_Out1205869130|) (or .cse1 .cse2)) (and .cse0 (= ~x$w_buff1~0_In1205869130 |ULTIMATE.start_main_#t~ite34_Out1205869130|) (not .cse2) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1205869130, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1205869130, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1205869130, ~x~0=~x~0_In1205869130} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1205869130, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1205869130|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1205869130, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1205869130, ~x~0=~x~0_In1205869130, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1205869130|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:33:50,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-222576838 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-222576838 256)))) (or (and (= ~x$w_buff0_used~0_In-222576838 |ULTIMATE.start_main_#t~ite36_Out-222576838|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out-222576838|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-222576838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-222576838} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-222576838, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-222576838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-222576838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:33:50,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In2020135907 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In2020135907 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2020135907 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In2020135907 256) 0))) (or (and (= ~x$w_buff1_used~0_In2020135907 |ULTIMATE.start_main_#t~ite37_Out2020135907|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite37_Out2020135907| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2020135907, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2020135907, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2020135907, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2020135907} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2020135907, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2020135907, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2020135907|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2020135907, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2020135907} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:33:50,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1172714170 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1172714170 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-1172714170|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1172714170 |ULTIMATE.start_main_#t~ite38_Out-1172714170|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1172714170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1172714170} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1172714170, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1172714170|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1172714170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:33:50,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1376350335 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1376350335 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1376350335 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1376350335 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1376350335 |ULTIMATE.start_main_#t~ite39_Out-1376350335|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1376350335|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1376350335, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1376350335, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1376350335, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376350335} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1376350335, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1376350335|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1376350335, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1376350335, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376350335} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:33:50,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:33:50,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:33:50 BasicIcfg [2019-11-28 18:33:50,819 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:33:50,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:33:50,820 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:33:50,820 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:33:50,821 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:33:36" (3/4) ... [2019-11-28 18:33:50,825 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:33:50,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2571~0.base_24| 4) |v_#length_15|) (= 0 v_~x$r_buff0_thd2~0_163) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2571~0.base_24|) (= v_~x$r_buff0_thd0~0_130 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2571~0.base_24|) 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2571~0.base_24| 1)) (= v_~y~0_90 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2571~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2571~0.base_24|) |v_ULTIMATE.start_main_~#t2571~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~x$r_buff1_thd2~0_124) (= |v_ULTIMATE.start_main_~#t2571~0.offset_18| 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2572~0.offset=|v_ULTIMATE.start_main_~#t2572~0.offset_18|, ~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_~#t2571~0.base=|v_ULTIMATE.start_main_~#t2571~0.base_24|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, #length=|v_#length_15|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t2571~0.offset=|v_ULTIMATE.start_main_~#t2571~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ULTIMATE.start_main_~#t2572~0.base=|v_ULTIMATE.start_main_~#t2572~0.base_25|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2572~0.offset, ~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2571~0.base, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t2571~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2572~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:33:50,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2572~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t2572~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2572~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2572~0.base_11|) |v_ULTIMATE.start_main_~#t2572~0.offset_9| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2572~0.base_11| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2572~0.base_11|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2572~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2572~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2572~0.offset=|v_ULTIMATE.start_main_~#t2572~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2572~0.base=|v_ULTIMATE.start_main_~#t2572~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2572~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2572~0.base] because there is no mapped edge [2019-11-28 18:33:50,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:33:50,830 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1252423455 256)))) (or (and .cse0 (= |P0Thread1of1ForFork1_#t~ite9_Out-1252423455| |P0Thread1of1ForFork1_#t~ite8_Out-1252423455|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1252423455 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1252423455 256))) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1252423455 256) 0)) (= (mod ~x$w_buff0_used~0_In-1252423455 256) 0))) (= ~x$w_buff0~0_In-1252423455 |P0Thread1of1ForFork1_#t~ite8_Out-1252423455|)) (and (= |P0Thread1of1ForFork1_#t~ite8_In-1252423455| |P0Thread1of1ForFork1_#t~ite8_Out-1252423455|) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite9_Out-1252423455| ~x$w_buff0~0_In-1252423455)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1252423455, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1252423455, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1252423455|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1252423455, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1252423455, ~weak$$choice2~0=~weak$$choice2~0_In-1252423455, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1252423455} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1252423455, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1252423455, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1252423455|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1252423455|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1252423455, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1252423455, ~weak$$choice2~0=~weak$$choice2~0_In-1252423455, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1252423455} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-11-28 18:33:50,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-11-28 18:33:50,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:33:50,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1223107028 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1223107028 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1223107028 |P1Thread1of1ForFork0_#t~ite28_Out1223107028|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out1223107028|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1223107028, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1223107028} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1223107028, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out1223107028|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1223107028} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:33:50,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In170441362 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In170441362 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In170441362 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In170441362 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out170441362| ~x$w_buff1_used~0_In170441362) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out170441362| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In170441362, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In170441362, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In170441362, ~x$w_buff0_used~0=~x$w_buff0_used~0_In170441362} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In170441362, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In170441362, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In170441362, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out170441362|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In170441362} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:33:50,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse1 (= ~x$r_buff0_thd2~0_In-1470852727 ~x$r_buff0_thd2~0_Out-1470852727)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1470852727 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1470852727 256) 0))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and (= 0 ~x$r_buff0_thd2~0_Out-1470852727) (not .cse2) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1470852727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1470852727} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1470852727|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1470852727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1470852727} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:33:50,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1008361533 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1008361533 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1008361533 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1008361533 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1008361533|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd2~0_In-1008361533 |P1Thread1of1ForFork0_#t~ite31_Out-1008361533|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1008361533, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1008361533, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1008361533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1008361533} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1008361533|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1008361533, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1008361533, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1008361533, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1008361533} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:33:50,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-11-28 18:33:50,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:33:50,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite35_Out1205869130| |ULTIMATE.start_main_#t~ite34_Out1205869130|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In1205869130 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In1205869130 256) 0))) (or (and .cse0 (= ~x~0_In1205869130 |ULTIMATE.start_main_#t~ite34_Out1205869130|) (or .cse1 .cse2)) (and .cse0 (= ~x$w_buff1~0_In1205869130 |ULTIMATE.start_main_#t~ite34_Out1205869130|) (not .cse2) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1205869130, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1205869130, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1205869130, ~x~0=~x~0_In1205869130} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1205869130, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out1205869130|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1205869130, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1205869130, ~x~0=~x~0_In1205869130, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1205869130|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:33:50,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-222576838 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-222576838 256)))) (or (and (= ~x$w_buff0_used~0_In-222576838 |ULTIMATE.start_main_#t~ite36_Out-222576838|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite36_Out-222576838|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-222576838, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-222576838} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-222576838, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-222576838|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-222576838} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:33:50,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In2020135907 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In2020135907 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2020135907 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In2020135907 256) 0))) (or (and (= ~x$w_buff1_used~0_In2020135907 |ULTIMATE.start_main_#t~ite37_Out2020135907|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite37_Out2020135907| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2020135907, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2020135907, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2020135907, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2020135907} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2020135907, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2020135907, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2020135907|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2020135907, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2020135907} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:33:50,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1172714170 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1172714170 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-1172714170|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In-1172714170 |ULTIMATE.start_main_#t~ite38_Out-1172714170|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1172714170, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1172714170} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1172714170, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1172714170|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1172714170} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:33:50,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1376350335 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-1376350335 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1376350335 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1376350335 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1376350335 |ULTIMATE.start_main_#t~ite39_Out-1376350335|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite39_Out-1376350335|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1376350335, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1376350335, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1376350335, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376350335} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1376350335, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-1376350335|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1376350335, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1376350335, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1376350335} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:33:50,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:33:50,995 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:33:50,995 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:33:50,998 INFO L168 Benchmark]: Toolchain (without parser) took 16555.84 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 521.7 MB). Free memory was 945.6 MB in the beginning and 1.4 GB in the end (delta: -435.5 MB). Peak memory consumption was 86.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:50,998 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:33:50,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 781.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:50,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.87 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-11-28 18:33:50,999 INFO L168 Benchmark]: Boogie Preprocessor took 64.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:51,000 INFO L168 Benchmark]: RCFGBuilder took 792.00 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: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:51,000 INFO L168 Benchmark]: TraceAbstraction took 14674.12 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 382.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -351.3 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:51,000 INFO L168 Benchmark]: Witness Printer took 176.06 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-11-28 18:33:51,002 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 781.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -161.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.87 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 64.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 792.00 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: 44.6 MB). Peak memory consumption was 44.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14674.12 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 382.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -351.3 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * Witness Printer took 176.06 ms. Allocated memory is still 1.6 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 134 ProgramPointsBefore, 66 ProgramPointsAfterwards, 162 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4187 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 40283 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2571, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2572, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2065 SDtfs, 1991 SDslu, 3972 SDs, 0 SdLazy, 2829 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 39 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9707occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 10870 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 536 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 476 ConstructedInterpolants, 0 QuantifiedInterpolants, 53064 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...