./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi003_power.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/rfi003_power.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 31ae382edabe17ce34422996f792882116394642 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:22:09,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:22:09,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:22:09,152 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:22:09,153 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:22:09,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:22:09,159 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:22:09,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:22:09,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:22:09,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:22:09,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:22:09,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:22:09,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:22:09,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:22:09,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:22:09,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:22:09,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:22:09,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:22:09,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:22:09,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:22:09,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:22:09,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:22:09,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:22:09,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:22:09,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:22:09,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:22:09,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:22:09,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:22:09,191 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:22:09,192 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:22:09,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:22:09,193 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:22:09,194 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:22:09,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:22:09,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:22:09,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:22:09,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:22:09,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:22:09,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:22:09,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:22:09,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:22:09,205 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:22:09,236 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:22:09,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:22:09,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:22:09,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:22:09,239 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:22:09,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:22:09,240 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:22:09,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:22:09,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:22:09,241 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:22:09,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:22:09,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:22:09,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:22:09,243 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:22:09,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:22:09,243 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:22:09,244 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:22:09,244 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:22:09,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:22:09,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:22:09,245 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:22:09,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:22:09,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:22:09,246 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:22:09,246 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:22:09,246 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:22:09,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:22:09,247 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:22:09,247 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:22:09,247 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 -> 31ae382edabe17ce34422996f792882116394642 [2019-11-28 18:22:09,547 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:22:09,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:22:09,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:22:09,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:22:09,567 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:22:09,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi003_power.opt.i [2019-11-28 18:22:09,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71127297d/93e6c37a267042b5ab23225d529b0498/FLAG3faf0d291 [2019-11-28 18:22:10,230 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:22:10,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi003_power.opt.i [2019-11-28 18:22:10,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71127297d/93e6c37a267042b5ab23225d529b0498/FLAG3faf0d291 [2019-11-28 18:22:10,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71127297d/93e6c37a267042b5ab23225d529b0498 [2019-11-28 18:22:10,491 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:22:10,493 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:22:10,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:10,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:22:10,499 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:22:10,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:10" (1/1) ... [2019-11-28 18:22:10,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27932562 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:10, skipping insertion in model container [2019-11-28 18:22:10,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:22:10" (1/1) ... [2019-11-28 18:22:10,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:22:10,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:22:11,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:11,173 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:22:11,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:22:11,332 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:22:11,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:11 WrapperNode [2019-11-28 18:22:11,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:22:11,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:11,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:22:11,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:22:11,343 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:22:11" (1/1) ... [2019-11-28 18:22:11,363 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:22:11" (1/1) ... [2019-11-28 18:22:11,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:22:11,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:22:11,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:22:11,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:22:11,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:11" (1/1) ... [2019-11-28 18:22:11,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:11" (1/1) ... [2019-11-28 18:22:11,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:11" (1/1) ... [2019-11-28 18:22:11,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:11" (1/1) ... [2019-11-28 18:22:11,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:11" (1/1) ... [2019-11-28 18:22:11,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:11" (1/1) ... [2019-11-28 18:22:11,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:11" (1/1) ... [2019-11-28 18:22:11,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:22:11,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:22:11,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:22:11,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:22:11,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:11" (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:22:11,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:22:11,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:22:11,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:22:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:22:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:22:11,490 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:22:11,490 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:22:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:22:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:22:11,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:22:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:22:11,493 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:22:12,170 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:22:12,170 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:22:12,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:12 BoogieIcfgContainer [2019-11-28 18:22:12,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:22:12,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:22:12,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:22:12,177 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:22:12,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:22:10" (1/3) ... [2019-11-28 18:22:12,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fdc490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:12, skipping insertion in model container [2019-11-28 18:22:12,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:22:11" (2/3) ... [2019-11-28 18:22:12,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65fdc490 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:22:12, skipping insertion in model container [2019-11-28 18:22:12,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:12" (3/3) ... [2019-11-28 18:22:12,181 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.opt.i [2019-11-28 18:22:12,192 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:22:12,193 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:22:12,201 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:22:12,202 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:22:12,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,242 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,242 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,260 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,261 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,262 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,263 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,264 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,269 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,272 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,273 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:22:12,302 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:22:12,322 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:22:12,322 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:22:12,322 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:22:12,322 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:22:12,322 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:22:12,323 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:22:12,323 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:22:12,323 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:22:12,342 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 164 transitions [2019-11-28 18:22:12,344 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-11-28 18:22:12,431 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-11-28 18:22:12,432 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:12,448 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:12,473 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 136 places, 164 transitions [2019-11-28 18:22:12,517 INFO L134 PetriNetUnfolder]: 35/162 cut-off events. [2019-11-28 18:22:12,517 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:22:12,523 INFO L76 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 162 events. 35/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 556 event pairs. 6/131 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-11-28 18:22:12,538 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-11-28 18:22:12,540 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:22:16,945 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-11-28 18:22:17,072 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-11-28 18:22:17,118 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39492 [2019-11-28 18:22:17,119 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-11-28 18:22:17,124 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 65 places, 75 transitions [2019-11-28 18:22:17,582 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6150 states. [2019-11-28 18:22:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states. [2019-11-28 18:22:17,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-11-28 18:22:17,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:17,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-11-28 18:22:17,607 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:22:17,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:17,617 INFO L82 PathProgramCache]: Analyzing trace with hash 681495893, now seen corresponding path program 1 times [2019-11-28 18:22:17,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:17,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149246223] [2019-11-28 18:22:17,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:18,069 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:22:18,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149246223] [2019-11-28 18:22:18,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:18,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:18,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011112792] [2019-11-28 18:22:18,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:18,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:18,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:18,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:18,109 INFO L87 Difference]: Start difference. First operand 6150 states. Second operand 3 states. [2019-11-28 18:22:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:18,333 INFO L93 Difference]: Finished difference Result 5990 states and 20128 transitions. [2019-11-28 18:22:18,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:18,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-11-28 18:22:18,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:18,411 INFO L225 Difference]: With dead ends: 5990 [2019-11-28 18:22:18,411 INFO L226 Difference]: Without dead ends: 5642 [2019-11-28 18:22:18,416 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:22:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2019-11-28 18:22:18,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5642. [2019-11-28 18:22:18,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5642 states. [2019-11-28 18:22:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5642 states to 5642 states and 18923 transitions. [2019-11-28 18:22:18,779 INFO L78 Accepts]: Start accepts. Automaton has 5642 states and 18923 transitions. Word has length 5 [2019-11-28 18:22:18,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:18,780 INFO L462 AbstractCegarLoop]: Abstraction has 5642 states and 18923 transitions. [2019-11-28 18:22:18,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 5642 states and 18923 transitions. [2019-11-28 18:22:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:22:18,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:18,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:18,784 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:22:18,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:18,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1994037290, now seen corresponding path program 1 times [2019-11-28 18:22:18,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:18,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91552527] [2019-11-28 18:22:18,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:18,867 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:22:18,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91552527] [2019-11-28 18:22:18,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:18,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:18,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428436028] [2019-11-28 18:22:18,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:18,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:18,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:18,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:18,871 INFO L87 Difference]: Start difference. First operand 5642 states and 18923 transitions. Second operand 4 states. [2019-11-28 18:22:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:19,193 INFO L93 Difference]: Finished difference Result 8500 states and 27431 transitions. [2019-11-28 18:22:19,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:19,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:22:19,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:19,267 INFO L225 Difference]: With dead ends: 8500 [2019-11-28 18:22:19,267 INFO L226 Difference]: Without dead ends: 8487 [2019-11-28 18:22:19,268 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:22:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-11-28 18:22:19,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 7476. [2019-11-28 18:22:19,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7476 states. [2019-11-28 18:22:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7476 states to 7476 states and 24583 transitions. [2019-11-28 18:22:19,576 INFO L78 Accepts]: Start accepts. Automaton has 7476 states and 24583 transitions. Word has length 11 [2019-11-28 18:22:19,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:19,576 INFO L462 AbstractCegarLoop]: Abstraction has 7476 states and 24583 transitions. [2019-11-28 18:22:19,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:19,576 INFO L276 IsEmpty]: Start isEmpty. Operand 7476 states and 24583 transitions. [2019-11-28 18:22:19,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:19,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:19,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:19,583 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:22:19,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:19,584 INFO L82 PathProgramCache]: Analyzing trace with hash 638913215, now seen corresponding path program 1 times [2019-11-28 18:22:19,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:19,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770388929] [2019-11-28 18:22:19,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:19,634 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:22:19,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770388929] [2019-11-28 18:22:19,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:19,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:19,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142013423] [2019-11-28 18:22:19,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:19,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:19,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:19,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:19,637 INFO L87 Difference]: Start difference. First operand 7476 states and 24583 transitions. Second operand 3 states. [2019-11-28 18:22:19,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:19,844 INFO L93 Difference]: Finished difference Result 10006 states and 32837 transitions. [2019-11-28 18:22:19,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:19,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 18:22:19,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:19,895 INFO L225 Difference]: With dead ends: 10006 [2019-11-28 18:22:19,896 INFO L226 Difference]: Without dead ends: 10006 [2019-11-28 18:22:19,896 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:22:19,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10006 states. [2019-11-28 18:22:20,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10006 to 8662. [2019-11-28 18:22:20,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8662 states. [2019-11-28 18:22:20,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8662 states to 8662 states and 28605 transitions. [2019-11-28 18:22:20,313 INFO L78 Accepts]: Start accepts. Automaton has 8662 states and 28605 transitions. Word has length 14 [2019-11-28 18:22:20,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:20,315 INFO L462 AbstractCegarLoop]: Abstraction has 8662 states and 28605 transitions. [2019-11-28 18:22:20,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 8662 states and 28605 transitions. [2019-11-28 18:22:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:20,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:20,475 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:20,475 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:22:20,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:20,475 INFO L82 PathProgramCache]: Analyzing trace with hash 775445368, now seen corresponding path program 1 times [2019-11-28 18:22:20,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:20,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777134080] [2019-11-28 18:22:20,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:20,581 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:22:20,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777134080] [2019-11-28 18:22:20,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:20,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:20,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081748678] [2019-11-28 18:22:20,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:20,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:20,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:20,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:20,583 INFO L87 Difference]: Start difference. First operand 8662 states and 28605 transitions. Second operand 4 states. [2019-11-28 18:22:20,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:20,807 INFO L93 Difference]: Finished difference Result 10925 states and 35253 transitions. [2019-11-28 18:22:20,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:20,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:20,854 INFO L225 Difference]: With dead ends: 10925 [2019-11-28 18:22:20,854 INFO L226 Difference]: Without dead ends: 10913 [2019-11-28 18:22:20,854 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:22:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10913 states. [2019-11-28 18:22:21,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10913 to 9512. [2019-11-28 18:22:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9512 states. [2019-11-28 18:22:21,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9512 states to 9512 states and 31144 transitions. [2019-11-28 18:22:21,247 INFO L78 Accepts]: Start accepts. Automaton has 9512 states and 31144 transitions. Word has length 14 [2019-11-28 18:22:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:21,247 INFO L462 AbstractCegarLoop]: Abstraction has 9512 states and 31144 transitions. [2019-11-28 18:22:21,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:21,248 INFO L276 IsEmpty]: Start isEmpty. Operand 9512 states and 31144 transitions. [2019-11-28 18:22:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:22:21,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:21,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:21,251 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:22:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:21,252 INFO L82 PathProgramCache]: Analyzing trace with hash -289899718, now seen corresponding path program 1 times [2019-11-28 18:22:21,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:21,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150209387] [2019-11-28 18:22:21,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:21,297 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:22:21,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150209387] [2019-11-28 18:22:21,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:21,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:21,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502323608] [2019-11-28 18:22:21,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:21,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:21,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:21,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:21,300 INFO L87 Difference]: Start difference. First operand 9512 states and 31144 transitions. Second operand 4 states. [2019-11-28 18:22:21,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:21,523 INFO L93 Difference]: Finished difference Result 11905 states and 38437 transitions. [2019-11-28 18:22:21,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:22:21,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:22:21,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:21,567 INFO L225 Difference]: With dead ends: 11905 [2019-11-28 18:22:21,567 INFO L226 Difference]: Without dead ends: 11891 [2019-11-28 18:22:21,568 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:22:21,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11891 states. [2019-11-28 18:22:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11891 to 9738. [2019-11-28 18:22:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9738 states. [2019-11-28 18:22:21,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9738 states to 9738 states and 31931 transitions. [2019-11-28 18:22:21,879 INFO L78 Accepts]: Start accepts. Automaton has 9738 states and 31931 transitions. Word has length 14 [2019-11-28 18:22:21,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:21,880 INFO L462 AbstractCegarLoop]: Abstraction has 9738 states and 31931 transitions. [2019-11-28 18:22:21,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 9738 states and 31931 transitions. [2019-11-28 18:22:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:22:21,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:21,885 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:22:21,885 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:22:21,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 2043144141, now seen corresponding path program 1 times [2019-11-28 18:22:21,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:21,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621234250] [2019-11-28 18:22:21,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:21,985 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:22:21,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621234250] [2019-11-28 18:22:21,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:21,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:21,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625824942] [2019-11-28 18:22:21,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:21,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:21,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:21,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:21,988 INFO L87 Difference]: Start difference. First operand 9738 states and 31931 transitions. Second operand 3 states. [2019-11-28 18:22:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:22,045 INFO L93 Difference]: Finished difference Result 9230 states and 29799 transitions. [2019-11-28 18:22:22,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:22,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:22:22,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:22,079 INFO L225 Difference]: With dead ends: 9230 [2019-11-28 18:22:22,079 INFO L226 Difference]: Without dead ends: 9230 [2019-11-28 18:22:22,080 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:22:22,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9230 states. [2019-11-28 18:22:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9230 to 9070. [2019-11-28 18:22:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9070 states. [2019-11-28 18:22:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9070 states to 9070 states and 29315 transitions. [2019-11-28 18:22:22,509 INFO L78 Accepts]: Start accepts. Automaton has 9070 states and 29315 transitions. Word has length 16 [2019-11-28 18:22:22,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:22,510 INFO L462 AbstractCegarLoop]: Abstraction has 9070 states and 29315 transitions. [2019-11-28 18:22:22,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 9070 states and 29315 transitions. [2019-11-28 18:22:22,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:22:22,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:22,517 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:22:22,518 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:22:22,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:22,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1352148399, now seen corresponding path program 1 times [2019-11-28 18:22:22,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:22,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201820480] [2019-11-28 18:22:22,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:22,625 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:22:22,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201820480] [2019-11-28 18:22:22,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:22,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:22:22,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798886206] [2019-11-28 18:22:22,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:22,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:22,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:22,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:22,628 INFO L87 Difference]: Start difference. First operand 9070 states and 29315 transitions. Second operand 3 states. [2019-11-28 18:22:22,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:22,716 INFO L93 Difference]: Finished difference Result 15494 states and 49825 transitions. [2019-11-28 18:22:22,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:22,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 18:22:22,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:22,770 INFO L225 Difference]: With dead ends: 15494 [2019-11-28 18:22:22,771 INFO L226 Difference]: Without dead ends: 14910 [2019-11-28 18:22:22,771 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:22:22,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14910 states. [2019-11-28 18:22:23,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14910 to 14339. [2019-11-28 18:22:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14339 states. [2019-11-28 18:22:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14339 states to 14339 states and 46700 transitions. [2019-11-28 18:22:23,206 INFO L78 Accepts]: Start accepts. Automaton has 14339 states and 46700 transitions. Word has length 16 [2019-11-28 18:22:23,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:23,206 INFO L462 AbstractCegarLoop]: Abstraction has 14339 states and 46700 transitions. [2019-11-28 18:22:23,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 14339 states and 46700 transitions. [2019-11-28 18:22:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:22:23,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:23,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:23,214 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:22:23,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:23,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1236852315, now seen corresponding path program 1 times [2019-11-28 18:22:23,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:23,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408696541] [2019-11-28 18:22:23,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:23,333 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:22:23,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408696541] [2019-11-28 18:22:23,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:23,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:23,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368004656] [2019-11-28 18:22:23,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:23,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:23,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:23,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:23,336 INFO L87 Difference]: Start difference. First operand 14339 states and 46700 transitions. Second operand 4 states. [2019-11-28 18:22:23,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:23,416 INFO L93 Difference]: Finished difference Result 14188 states and 46235 transitions. [2019-11-28 18:22:23,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:23,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:22:23,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:23,460 INFO L225 Difference]: With dead ends: 14188 [2019-11-28 18:22:23,460 INFO L226 Difference]: Without dead ends: 14084 [2019-11-28 18:22:23,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14084 states. [2019-11-28 18:22:23,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14084 to 14084. [2019-11-28 18:22:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14084 states. [2019-11-28 18:22:23,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14084 states to 14084 states and 45897 transitions. [2019-11-28 18:22:23,883 INFO L78 Accepts]: Start accepts. Automaton has 14084 states and 45897 transitions. Word has length 17 [2019-11-28 18:22:23,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:23,884 INFO L462 AbstractCegarLoop]: Abstraction has 14084 states and 45897 transitions. [2019-11-28 18:22:23,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:23,884 INFO L276 IsEmpty]: Start isEmpty. Operand 14084 states and 45897 transitions. [2019-11-28 18:22:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 18:22:23,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:23,896 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:22:23,897 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:22:23,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:23,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2069901673, now seen corresponding path program 1 times [2019-11-28 18:22:23,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:23,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486066920] [2019-11-28 18:22:23,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:23,935 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:22:23,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486066920] [2019-11-28 18:22:23,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:23,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:23,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110292019] [2019-11-28 18:22:23,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:23,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:23,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:23,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:23,938 INFO L87 Difference]: Start difference. First operand 14084 states and 45897 transitions. Second operand 3 states. [2019-11-28 18:22:23,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:23,954 INFO L93 Difference]: Finished difference Result 1973 states and 4784 transitions. [2019-11-28 18:22:23,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:23,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 18:22:23,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:23,961 INFO L225 Difference]: With dead ends: 1973 [2019-11-28 18:22:23,961 INFO L226 Difference]: Without dead ends: 1973 [2019-11-28 18:22:23,962 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:22:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1973 states. [2019-11-28 18:22:23,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1973 to 1973. [2019-11-28 18:22:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1973 states. [2019-11-28 18:22:24,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1973 states to 1973 states and 4784 transitions. [2019-11-28 18:22:24,001 INFO L78 Accepts]: Start accepts. Automaton has 1973 states and 4784 transitions. Word has length 19 [2019-11-28 18:22:24,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,001 INFO L462 AbstractCegarLoop]: Abstraction has 1973 states and 4784 transitions. [2019-11-28 18:22:24,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:24,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1973 states and 4784 transitions. [2019-11-28 18:22:24,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:22:24,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,005 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:22:24,005 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:22:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,006 INFO L82 PathProgramCache]: Analyzing trace with hash -719161205, now seen corresponding path program 1 times [2019-11-28 18:22:24,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002435947] [2019-11-28 18:22:24,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:24,058 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:22:24,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002435947] [2019-11-28 18:22:24,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:24,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:24,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346079209] [2019-11-28 18:22:24,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:24,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:24,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:24,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:24,060 INFO L87 Difference]: Start difference. First operand 1973 states and 4784 transitions. Second operand 5 states. [2019-11-28 18:22:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:24,270 INFO L93 Difference]: Finished difference Result 2552 states and 6074 transitions. [2019-11-28 18:22:24,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:22:24,271 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:22:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:24,278 INFO L225 Difference]: With dead ends: 2552 [2019-11-28 18:22:24,278 INFO L226 Difference]: Without dead ends: 2516 [2019-11-28 18:22:24,279 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:22:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2516 states. [2019-11-28 18:22:24,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2516 to 2056. [2019-11-28 18:22:24,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-11-28 18:22:24,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 4961 transitions. [2019-11-28 18:22:24,322 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 4961 transitions. Word has length 26 [2019-11-28 18:22:24,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,322 INFO L462 AbstractCegarLoop]: Abstraction has 2056 states and 4961 transitions. [2019-11-28 18:22:24,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 4961 transitions. [2019-11-28 18:22:24,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:22:24,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,326 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:22:24,327 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:22:24,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1381829350, now seen corresponding path program 1 times [2019-11-28 18:22:24,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749397731] [2019-11-28 18:22:24,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:24,417 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:22:24,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749397731] [2019-11-28 18:22:24,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:24,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:22:24,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129291633] [2019-11-28 18:22:24,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:24,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:24,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:24,420 INFO L87 Difference]: Start difference. First operand 2056 states and 4961 transitions. Second operand 5 states. [2019-11-28 18:22:24,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:24,619 INFO L93 Difference]: Finished difference Result 2314 states and 5527 transitions. [2019-11-28 18:22:24,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:22:24,620 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:22:24,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:24,625 INFO L225 Difference]: With dead ends: 2314 [2019-11-28 18:22:24,625 INFO L226 Difference]: Without dead ends: 2314 [2019-11-28 18:22:24,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:22:24,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2019-11-28 18:22:24,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2115. [2019-11-28 18:22:24,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2019-11-28 18:22:24,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 5071 transitions. [2019-11-28 18:22:24,673 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 5071 transitions. Word has length 27 [2019-11-28 18:22:24,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:24,673 INFO L462 AbstractCegarLoop]: Abstraction has 2115 states and 5071 transitions. [2019-11-28 18:22:24,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:24,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 5071 transitions. [2019-11-28 18:22:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:22:24,679 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:24,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:22:24,680 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:22:24,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:24,680 INFO L82 PathProgramCache]: Analyzing trace with hash 2043230427, now seen corresponding path program 1 times [2019-11-28 18:22:24,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:24,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457290060] [2019-11-28 18:22:24,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:24,809 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:22:24,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457290060] [2019-11-28 18:22:24,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:24,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:24,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46868105] [2019-11-28 18:22:24,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:22:24,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:24,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:22:24,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:22:24,813 INFO L87 Difference]: Start difference. First operand 2115 states and 5071 transitions. Second operand 5 states. [2019-11-28 18:22:25,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:25,108 INFO L93 Difference]: Finished difference Result 2498 states and 5944 transitions. [2019-11-28 18:22:25,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 18:22:25,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:22:25,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:25,114 INFO L225 Difference]: With dead ends: 2498 [2019-11-28 18:22:25,114 INFO L226 Difference]: Without dead ends: 2462 [2019-11-28 18:22:25,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:22:25,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2019-11-28 18:22:25,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2055. [2019-11-28 18:22:25,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2055 states. [2019-11-28 18:22:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 4955 transitions. [2019-11-28 18:22:25,319 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 4955 transitions. Word has length 27 [2019-11-28 18:22:25,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:25,320 INFO L462 AbstractCegarLoop]: Abstraction has 2055 states and 4955 transitions. [2019-11-28 18:22:25,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:22:25,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 4955 transitions. [2019-11-28 18:22:25,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 18:22:25,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:25,325 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] [2019-11-28 18:22:25,325 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:22:25,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:25,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1601520558, now seen corresponding path program 1 times [2019-11-28 18:22:25,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:25,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527321945] [2019-11-28 18:22:25,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:25,432 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:22:25,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527321945] [2019-11-28 18:22:25,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:25,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:22:25,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616115172] [2019-11-28 18:22:25,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:22:25,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:25,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:22:25,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:22:25,435 INFO L87 Difference]: Start difference. First operand 2055 states and 4955 transitions. Second operand 4 states. [2019-11-28 18:22:25,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:25,455 INFO L93 Difference]: Finished difference Result 966 states and 2264 transitions. [2019-11-28 18:22:25,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:22:25,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-11-28 18:22:25,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:25,459 INFO L225 Difference]: With dead ends: 966 [2019-11-28 18:22:25,459 INFO L226 Difference]: Without dead ends: 966 [2019-11-28 18:22:25,459 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:22:25,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-11-28 18:22:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 658. [2019-11-28 18:22:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-28 18:22:25,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1494 transitions. [2019-11-28 18:22:25,480 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1494 transitions. Word has length 28 [2019-11-28 18:22:25,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:25,481 INFO L462 AbstractCegarLoop]: Abstraction has 658 states and 1494 transitions. [2019-11-28 18:22:25,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:22:25,481 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1494 transitions. [2019-11-28 18:22:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:25,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:25,484 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:22:25,485 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:22:25,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:25,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1254925043, now seen corresponding path program 1 times [2019-11-28 18:22:25,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:25,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291035856] [2019-11-28 18:22:25,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:25,698 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:22:25,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291035856] [2019-11-28 18:22:25,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:25,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:22:25,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713068263] [2019-11-28 18:22:25,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:22:25,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:25,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:22:25,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:22:25,702 INFO L87 Difference]: Start difference. First operand 658 states and 1494 transitions. Second operand 6 states. [2019-11-28 18:22:26,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:26,034 INFO L93 Difference]: Finished difference Result 2288 states and 5265 transitions. [2019-11-28 18:22:26,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 18:22:26,034 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-28 18:22:26,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:26,038 INFO L225 Difference]: With dead ends: 2288 [2019-11-28 18:22:26,038 INFO L226 Difference]: Without dead ends: 1516 [2019-11-28 18:22:26,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 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:22:26,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2019-11-28 18:22:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 741. [2019-11-28 18:22:26,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-11-28 18:22:26,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1680 transitions. [2019-11-28 18:22:26,057 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1680 transitions. Word has length 42 [2019-11-28 18:22:26,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:26,057 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 1680 transitions. [2019-11-28 18:22:26,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:22:26,058 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1680 transitions. [2019-11-28 18:22:26,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:26,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:26,060 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:22:26,060 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:22:26,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:26,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1626226089, now seen corresponding path program 2 times [2019-11-28 18:22:26,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:26,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39356482] [2019-11-28 18:22:26,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:22:26,157 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:22:26,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39356482] [2019-11-28 18:22:26,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:22:26,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:22:26,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544712830] [2019-11-28 18:22:26,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:22:26,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:22:26,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:22:26,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:22:26,160 INFO L87 Difference]: Start difference. First operand 741 states and 1680 transitions. Second operand 3 states. [2019-11-28 18:22:26,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:22:26,173 INFO L93 Difference]: Finished difference Result 1143 states and 2616 transitions. [2019-11-28 18:22:26,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:22:26,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-28 18:22:26,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:22:26,175 INFO L225 Difference]: With dead ends: 1143 [2019-11-28 18:22:26,175 INFO L226 Difference]: Without dead ends: 422 [2019-11-28 18:22:26,176 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:22:26,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-11-28 18:22:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2019-11-28 18:22:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-28 18:22:26,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 969 transitions. [2019-11-28 18:22:26,186 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 969 transitions. Word has length 42 [2019-11-28 18:22:26,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:22:26,187 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 969 transitions. [2019-11-28 18:22:26,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:22:26,187 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 969 transitions. [2019-11-28 18:22:26,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 18:22:26,190 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:22:26,190 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:22:26,191 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:22:26,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:22:26,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1127216463, now seen corresponding path program 3 times [2019-11-28 18:22:26,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:22:26,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202341632] [2019-11-28 18:22:26,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:22:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:22:26,331 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:22:26,332 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:22:26,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1635~0.base_35| 4) |v_#length_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_35|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1635~0.base_35|) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_35|) |v_ULTIMATE.start_main_~#t1635~0.offset_24| 0)) |v_#memory_int_17|) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_ULTIMATE.start_main_~#t1635~0.offset_24| 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_35| 1)) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_35|, #length=|v_#length_17|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ULTIMATE.start_main_~#t1635~0.offset=|v_ULTIMATE.start_main_~#t1635~0.offset_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ULTIMATE.start_main_~#t1635~0.base=|v_ULTIMATE.start_main_~#t1635~0.base_35|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, 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, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1636~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~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_~#t1635~0.offset, ~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, ULTIMATE.start_main_~#t1636~0.offset, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1635~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:22:26,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10|) 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1636~0.offset_9| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1636~0.base_10|) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10| 1) |v_#valid_25|) (not (= 0 |v_ULTIMATE.start_main_~#t1636~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10|) |v_ULTIMATE.start_main_~#t1636~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1636~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, #length] because there is no mapped edge [2019-11-28 18:22:26,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~x$r_buff1_thd0~0_Out-343296061 ~x$r_buff0_thd0~0_In-343296061) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-343296061 0)) (= ~y~0_Out-343296061 ~__unbuffered_p1_EAX~0_Out-343296061) (= ~y~0_Out-343296061 ~__unbuffered_p1_EBX~0_Out-343296061) (= ~x$r_buff0_thd2~0_Out-343296061 1) (= ~x$r_buff1_thd1~0_Out-343296061 ~x$r_buff0_thd1~0_In-343296061) (= ~y~0_Out-343296061 1) (= ~x$r_buff1_thd2~0_Out-343296061 ~x$r_buff0_thd2~0_In-343296061)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-343296061, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-343296061, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-343296061, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-343296061} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-343296061, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-343296061, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-343296061, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-343296061, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-343296061, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-343296061, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-343296061, ~y~0=~y~0_Out-343296061, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-343296061, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-343296061} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~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:22:26,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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:22:26,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In874112827 256) 0))) (or (let ((.cse1 (not (= 0 (mod ~x$r_buff0_thd1~0_In874112827 256))))) (and (= 0 |P0Thread1of1ForFork1_#t~ite22_Out874112827|) (= |P0Thread1of1ForFork1_#t~ite24_Out874112827| |P0Thread1of1ForFork1_#t~ite23_Out874112827|) (not (= (mod ~x$w_buff0_used~0_In874112827 256) 0)) .cse0 (or (not (= (mod ~x$w_buff1_used~0_In874112827 256) 0)) .cse1) (= |P0Thread1of1ForFork1_#t~ite23_Out874112827| |P0Thread1of1ForFork1_#t~ite22_Out874112827|) (or .cse1 (not (= (mod ~x$r_buff1_thd1~0_In874112827 256) 0))))) (and (= |P0Thread1of1ForFork1_#t~ite22_In874112827| |P0Thread1of1ForFork1_#t~ite22_Out874112827|) (= |P0Thread1of1ForFork1_#t~ite24_Out874112827| ~x$r_buff1_thd1~0_In874112827) (= |P0Thread1of1ForFork1_#t~ite23_In874112827| |P0Thread1of1ForFork1_#t~ite23_Out874112827|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In874112827, ~x$w_buff1_used~0=~x$w_buff1_used~0_In874112827, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In874112827, ~weak$$choice2~0=~weak$$choice2~0_In874112827, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In874112827|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In874112827, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In874112827|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In874112827, ~x$w_buff1_used~0=~x$w_buff1_used~0_In874112827, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In874112827, ~weak$$choice2~0=~weak$$choice2~0_In874112827, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out874112827|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out874112827|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out874112827|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In874112827} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:22:26,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:22:26,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-101790244 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-101790244 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-101790244 |P1Thread1of1ForFork0_#t~ite28_Out-101790244|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-101790244|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-101790244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-101790244} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-101790244, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-101790244|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-101790244} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:26,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1337286447 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1337286447 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1337286447 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1337286447 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1337286447| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out-1337286447| ~x$w_buff1_used~0_In-1337286447)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1337286447, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1337286447, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1337286447, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1337286447} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1337286447, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1337286447, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1337286447, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1337286447|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1337286447} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:26,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1382718785 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In-1382718785 ~x$r_buff0_thd2~0_Out-1382718785)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1382718785 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-1382718785) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1382718785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1382718785} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1382718785|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1382718785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1382718785} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:26,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1442001237 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1442001237 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1442001237 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1442001237 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1442001237|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In1442001237 |P1Thread1of1ForFork0_#t~ite31_Out1442001237|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1442001237, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1442001237, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1442001237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1442001237} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1442001237|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1442001237, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1442001237, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1442001237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1442001237} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:26,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, 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:22:26,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:22:26,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In2131197171 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2131197171 256) 0))) (or (and (= ~x~0_In2131197171 |ULTIMATE.start_main_#t~ite34_Out2131197171|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In2131197171 |ULTIMATE.start_main_#t~ite34_Out2131197171|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2131197171, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2131197171, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2131197171, ~x~0=~x~0_In2131197171} OutVars{~x$w_buff1~0=~x$w_buff1~0_In2131197171, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2131197171, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2131197171, ~x~0=~x~0_In2131197171, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out2131197171|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:26,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:26,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1350232446 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1350232446 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1350232446| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1350232446| ~x$w_buff0_used~0_In-1350232446)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1350232446, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1350232446} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1350232446, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1350232446|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1350232446} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:26,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1033986532 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1033986532 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1033986532 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1033986532 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-1033986532| ~x$w_buff1_used~0_In-1033986532) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite37_Out-1033986532| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1033986532, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1033986532, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1033986532, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033986532} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1033986532, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1033986532, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1033986532|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1033986532, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033986532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:26,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1071064305 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1071064305 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1071064305| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1071064305| ~x$r_buff0_thd0~0_In-1071064305)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1071064305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1071064305} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1071064305, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1071064305|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1071064305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:26,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1312366646 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1312366646 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1312366646 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1312366646 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In1312366646 |ULTIMATE.start_main_#t~ite39_Out1312366646|)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1312366646|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1312366646, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1312366646, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1312366646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1312366646} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1312366646, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1312366646|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1312366646, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1312366646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1312366646} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:26,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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:22:26,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:22:26 BasicIcfg [2019-11-28 18:22:26,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:22:26,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:22:26,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:22:26,440 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:22:26,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:22:12" (3/4) ... [2019-11-28 18:22:26,444 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:22:26,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~x$w_buff1_used~0_374) (= v_~__unbuffered_p1_EBX~0_96 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1635~0.base_35| 4) |v_#length_17|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_35|) 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1635~0.base_35|) (= v_~x$r_buff0_thd1~0_280 0) (= 0 v_~x~0_123) (= v_~x$flush_delayed~0_46 0) (= |v_#NULL.offset_6| 0) (= 0 v_~x$w_buff0_used~0_610) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_35| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1635~0.base_35|) |v_ULTIMATE.start_main_~#t1635~0.offset_24| 0)) |v_#memory_int_17|) (= v_~x$r_buff0_thd0~0_130 0) (= 0 v_~x$r_buff1_thd2~0_113) (= v_~y~0_101 0) (= v_~weak$$choice2~0_130 0) (= v_~x$r_buff1_thd0~0_131 0) (= 0 v_~x$w_buff0~0_392) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_ULTIMATE.start_main_~#t1635~0.offset_24| 0) (= 0 v_~__unbuffered_p0_EAX~0_68) (= 0 v_~x$w_buff1~0_230) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1635~0.base_35| 1)) (= 0 |v_#NULL.base_6|) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_15 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~x$r_buff0_thd2~0_177) (= 0 v_~__unbuffered_p1_EAX~0_95) (= 0 v_~__unbuffered_cnt~0_91) (= v_~x$r_buff1_thd1~0_230 0) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~weak$$choice0~0_13) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_392, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_280, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_46, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_230, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_68, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_95, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_35|, #length=|v_#length_17|, ~y~0=v_~y~0_101, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_87|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_113|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_374, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_113, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_131, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_177, ULTIMATE.start_main_~#t1635~0.offset=|v_ULTIMATE.start_main_~#t1635~0.offset_24|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_610, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~weak$$choice2~0=v_~weak$$choice2~0_130, ~x~0=v_~x~0_123, ULTIMATE.start_main_~#t1635~0.base=|v_ULTIMATE.start_main_~#t1635~0.base_35|, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, 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, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1636~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~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_~#t1635~0.offset, ~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, ULTIMATE.start_main_~#t1636~0.offset, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ULTIMATE.start_main_~#t1635~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-11-28 18:22:26,445 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L800-1-->L802: Formula: (and (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10|) 0) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| 4) |v_#length_9|) (= |v_ULTIMATE.start_main_~#t1636~0.offset_9| 0) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1636~0.base_10|) (= (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1636~0.base_10| 1) |v_#valid_25|) (not (= 0 |v_ULTIMATE.start_main_~#t1636~0.base_10|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1636~0.base_10|) |v_ULTIMATE.start_main_~#t1636~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_3|, ULTIMATE.start_main_~#t1636~0.base=|v_ULTIMATE.start_main_~#t1636~0.base_10|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1636~0.offset=|v_ULTIMATE.start_main_~#t1636~0.offset_9|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1636~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1636~0.offset, #length] because there is no mapped edge [2019-11-28 18:22:26,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L5-->L777: Formula: (and (= ~x$r_buff1_thd0~0_Out-343296061 ~x$r_buff0_thd0~0_In-343296061) (not (= P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-343296061 0)) (= ~y~0_Out-343296061 ~__unbuffered_p1_EAX~0_Out-343296061) (= ~y~0_Out-343296061 ~__unbuffered_p1_EBX~0_Out-343296061) (= ~x$r_buff0_thd2~0_Out-343296061 1) (= ~x$r_buff1_thd1~0_Out-343296061 ~x$r_buff0_thd1~0_In-343296061) (= ~y~0_Out-343296061 1) (= ~x$r_buff1_thd2~0_Out-343296061 ~x$r_buff0_thd2~0_In-343296061)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-343296061, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-343296061, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-343296061, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-343296061} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-343296061, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-343296061, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-343296061, P1Thread1of1ForFork0___VERIFIER_assert_~expression=P1Thread1of1ForFork0___VERIFIER_assert_~expression_In-343296061, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-343296061, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-343296061, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-343296061, ~y~0=~y~0_Out-343296061, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-343296061, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-343296061} AuxVars[] AssignedVars[~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~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:22:26,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [579] [579] L741-->L742: Formula: (and (= v_~x$r_buff0_thd1~0_49 v_~x$r_buff0_thd1~0_48) (not (= 0 (mod v_~weak$$choice2~0_17 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_17} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_7|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_48, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_17} 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:22:26,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In874112827 256) 0))) (or (let ((.cse1 (not (= 0 (mod ~x$r_buff0_thd1~0_In874112827 256))))) (and (= 0 |P0Thread1of1ForFork1_#t~ite22_Out874112827|) (= |P0Thread1of1ForFork1_#t~ite24_Out874112827| |P0Thread1of1ForFork1_#t~ite23_Out874112827|) (not (= (mod ~x$w_buff0_used~0_In874112827 256) 0)) .cse0 (or (not (= (mod ~x$w_buff1_used~0_In874112827 256) 0)) .cse1) (= |P0Thread1of1ForFork1_#t~ite23_Out874112827| |P0Thread1of1ForFork1_#t~ite22_Out874112827|) (or .cse1 (not (= (mod ~x$r_buff1_thd1~0_In874112827 256) 0))))) (and (= |P0Thread1of1ForFork1_#t~ite22_In874112827| |P0Thread1of1ForFork1_#t~ite22_Out874112827|) (= |P0Thread1of1ForFork1_#t~ite24_Out874112827| ~x$r_buff1_thd1~0_In874112827) (= |P0Thread1of1ForFork1_#t~ite23_In874112827| |P0Thread1of1ForFork1_#t~ite23_Out874112827|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In874112827, ~x$w_buff1_used~0=~x$w_buff1_used~0_In874112827, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In874112827, ~weak$$choice2~0=~weak$$choice2~0_In874112827, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_In874112827|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In874112827, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_In874112827|} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In874112827, ~x$w_buff1_used~0=~x$w_buff1_used~0_In874112827, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In874112827, ~weak$$choice2~0=~weak$$choice2~0_In874112827, P0Thread1of1ForFork1_#t~ite24=|P0Thread1of1ForFork1_#t~ite24_Out874112827|, P0Thread1of1ForFork1_#t~ite23=|P0Thread1of1ForFork1_#t~ite23_Out874112827|, P0Thread1of1ForFork1_#t~ite22=|P0Thread1of1ForFork1_#t~ite22_Out874112827|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In874112827} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite24, P0Thread1of1ForFork1_#t~ite23, P0Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-11-28 18:22:26,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [613] [613] L744-->L752: Formula: (and (= v_~x$flush_delayed~0_17 0) (not (= (mod v_~x$flush_delayed~0_18 256) 0)) (= v_~x$mem_tmp~0_6 v_~x~0_38) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~x$mem_tmp~0=v_~x$mem_tmp~0_6} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_6, ~x~0=v_~x~0_38} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-11-28 18:22:26,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-101790244 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-101790244 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-101790244 |P1Thread1of1ForFork0_#t~ite28_Out-101790244|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-101790244|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-101790244, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-101790244} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-101790244, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-101790244|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-101790244} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-11-28 18:22:26,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1337286447 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1337286447 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1337286447 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In-1337286447 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1337286447| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out-1337286447| ~x$w_buff1_used~0_In-1337286447)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1337286447, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1337286447, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1337286447, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1337286447} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1337286447, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1337286447, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1337286447, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1337286447|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1337286447} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-11-28 18:22:26,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L780-->L781: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1382718785 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In-1382718785 ~x$r_buff0_thd2~0_Out-1382718785)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1382718785 256)))) (or (and (= 0 ~x$r_buff0_thd2~0_Out-1382718785) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1382718785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1382718785} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1382718785|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1382718785, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1382718785} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-11-28 18:22:26,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L781-->L781-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1442001237 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1442001237 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1442001237 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In1442001237 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1442001237|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd2~0_In1442001237 |P1Thread1of1ForFork0_#t~ite31_Out1442001237|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1442001237, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1442001237, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1442001237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1442001237} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1442001237|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1442001237, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1442001237, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1442001237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1442001237} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-11-28 18:22:26,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L781-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_~x$r_buff1_thd2~0_57 |v_P1Thread1of1ForFork0_#t~ite31_32|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_31|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, 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:22:26,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [591] [591] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_12) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-11-28 18:22:26,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L808-2-->L808-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In2131197171 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In2131197171 256) 0))) (or (and (= ~x~0_In2131197171 |ULTIMATE.start_main_#t~ite34_Out2131197171|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In2131197171 |ULTIMATE.start_main_#t~ite34_Out2131197171|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In2131197171, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2131197171, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2131197171, ~x~0=~x~0_In2131197171} OutVars{~x$w_buff1~0=~x$w_buff1~0_In2131197171, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2131197171, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2131197171, ~x~0=~x~0_In2131197171, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out2131197171|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:26,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [587] [587] L808-4-->L809: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite34_9|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_9|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_12|, ~x~0=v_~x~0_24, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~x~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-11-28 18:22:26,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1350232446 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1350232446 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1350232446| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1350232446| ~x$w_buff0_used~0_In-1350232446)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1350232446, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1350232446} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1350232446, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1350232446|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1350232446} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-11-28 18:22:26,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1033986532 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1033986532 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1033986532 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1033986532 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite37_Out-1033986532| ~x$w_buff1_used~0_In-1033986532) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite37_Out-1033986532| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1033986532, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1033986532, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1033986532, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033986532} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1033986532, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1033986532, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1033986532|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1033986532, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1033986532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-11-28 18:22:26,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-1071064305 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1071064305 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1071064305| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1071064305| ~x$r_buff0_thd0~0_In-1071064305)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1071064305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1071064305} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1071064305, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1071064305|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1071064305} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-11-28 18:22:26,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1312366646 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In1312366646 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1312366646 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In1312366646 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In1312366646 |ULTIMATE.start_main_#t~ite39_Out1312366646|)) (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1312366646|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1312366646, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1312366646, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1312366646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1312366646} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1312366646, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1312366646|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1312366646, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1312366646, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1312366646} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-11-28 18:22:26,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L812-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_16 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_16 (ite (= (ite (not (and (= v_~y~0_42 2) (= 0 v_~__unbuffered_p0_EAX~0_30) (= 1 v_~__unbuffered_p1_EAX~0_39) (= v_~__unbuffered_p1_EBX~0_40 1))) 1 0) 0) 0 1)) (= v_~x$r_buff1_thd0~0_72 |v_ULTIMATE.start_main_#t~ite39_40|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_40|, ~y~0=v_~y~0_42} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_30, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~y~0=v_~y~0_42, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_72, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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:22:26,553 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:22:26,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:22:26,555 INFO L168 Benchmark]: Toolchain (without parser) took 16062.12 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 490.2 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -229.2 MB). Peak memory consumption was 261.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:26,556 INFO L168 Benchmark]: CDTParser took 0.89 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:26,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 838.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -102.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:26,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:22:26,558 INFO L168 Benchmark]: Boogie Preprocessor took 36.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:26,558 INFO L168 Benchmark]: RCFGBuilder took 739.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:26,559 INFO L168 Benchmark]: TraceAbstraction took 14266.25 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 391.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -191.7 MB). Peak memory consumption was 199.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:26,560 INFO L168 Benchmark]: Witness Printer took 113.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-28 18:22:26,563 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.89 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 838.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -102.1 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 739.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14266.25 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 391.1 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -191.7 MB). Peak memory consumption was 199.4 MB. Max. memory is 11.5 GB. * Witness Printer took 113.69 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 136 ProgramPointsBefore, 65 ProgramPointsAfterwards, 164 TransitionsBefore, 75 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 21 ChoiceCompositions, 4335 VarBasedMoverChecksPositive, 162 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 167 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 39492 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1635, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L802] FCALL, FORK 0 pthread_create(&t1636, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L736] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L736] 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) [L737] EXPR 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L777] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L737] 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)) [L738] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L738] 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)) [L739] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L739] 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)) [L740] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L740] 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)) [L742] 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)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, 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] [L777] 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) [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 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 [L808] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, 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] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] 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 [L811] 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, 130 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1611 SDtfs, 1277 SDslu, 2239 SDs, 0 SdLazy, 1009 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14339occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 8789 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 360 NumberOfCodeBlocks, 360 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 35485 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...