./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix022_power.oepc.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/mix022_power.oepc.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 d2e090f7e83a575d605535d45cb53c24f4de9fdf ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:07:37,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 18:07:37,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 18:07:37,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 18:07:37,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 18:07:37,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 18:07:37,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 18:07:37,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 18:07:37,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 18:07:37,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 18:07:37,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 18:07:37,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 18:07:37,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 18:07:37,264 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 18:07:37,265 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 18:07:37,266 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 18:07:37,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 18:07:37,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 18:07:37,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 18:07:37,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 18:07:37,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 18:07:37,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 18:07:37,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 18:07:37,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 18:07:37,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 18:07:37,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 18:07:37,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 18:07:37,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 18:07:37,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 18:07:37,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 18:07:37,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 18:07:37,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 18:07:37,286 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 18:07:37,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 18:07:37,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 18:07:37,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 18:07:37,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 18:07:37,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 18:07:37,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 18:07:37,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 18:07:37,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 18:07:37,292 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:07:37,306 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 18:07:37,307 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 18:07:37,308 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 18:07:37,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 18:07:37,309 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 18:07:37,309 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 18:07:37,309 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 18:07:37,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 18:07:37,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 18:07:37,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 18:07:37,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 18:07:37,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 18:07:37,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 18:07:37,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 18:07:37,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 18:07:37,312 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 18:07:37,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 18:07:37,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 18:07:37,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 18:07:37,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 18:07:37,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 18:07:37,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 18:07:37,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 18:07:37,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 18:07:37,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 18:07:37,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 18:07:37,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 18:07:37,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 18:07:37,316 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 18:07:37,316 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 -> d2e090f7e83a575d605535d45cb53c24f4de9fdf [2019-11-28 18:07:37,609 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 18:07:37,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 18:07:37,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 18:07:37,628 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 18:07:37,628 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 18:07:37,629 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix022_power.oepc.i [2019-11-28 18:07:37,690 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac0afcf9/8d16afe37b414c7ebb31f354e1a9d6e7/FLAGb47060729 [2019-11-28 18:07:38,238 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 18:07:38,239 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix022_power.oepc.i [2019-11-28 18:07:38,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac0afcf9/8d16afe37b414c7ebb31f354e1a9d6e7/FLAGb47060729 [2019-11-28 18:07:38,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ac0afcf9/8d16afe37b414c7ebb31f354e1a9d6e7 [2019-11-28 18:07:38,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 18:07:38,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 18:07:38,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 18:07:38,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 18:07:38,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 18:07:38,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:07:38" (1/1) ... [2019-11-28 18:07:38,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8bbb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:38, skipping insertion in model container [2019-11-28 18:07:38,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:07:38" (1/1) ... [2019-11-28 18:07:38,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 18:07:38,598 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 18:07:39,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:07:39,132 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 18:07:39,258 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 18:07:39,342 INFO L208 MainTranslator]: Completed translation [2019-11-28 18:07:39,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:39 WrapperNode [2019-11-28 18:07:39,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 18:07:39,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 18:07:39,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 18:07:39,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 18:07:39,353 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:07:39" (1/1) ... [2019-11-28 18:07:39,373 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:07:39" (1/1) ... [2019-11-28 18:07:39,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 18:07:39,409 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 18:07:39,409 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 18:07:39,409 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 18:07:39,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:39" (1/1) ... [2019-11-28 18:07:39,420 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:39" (1/1) ... [2019-11-28 18:07:39,424 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:39" (1/1) ... [2019-11-28 18:07:39,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:39" (1/1) ... [2019-11-28 18:07:39,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:39" (1/1) ... [2019-11-28 18:07:39,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:39" (1/1) ... [2019-11-28 18:07:39,443 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:39" (1/1) ... [2019-11-28 18:07:39,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 18:07:39,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 18:07:39,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 18:07:39,450 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 18:07:39,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:39" (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:07:39,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 18:07:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-28 18:07:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 18:07:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 18:07:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-28 18:07:39,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-28 18:07:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-28 18:07:39,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-28 18:07:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-28 18:07:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 18:07:39,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 18:07:39,517 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:07:40,329 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 18:07:40,330 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-28 18:07:40,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:40 BoogieIcfgContainer [2019-11-28 18:07:40,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 18:07:40,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 18:07:40,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 18:07:40,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 18:07:40,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:07:38" (1/3) ... [2019-11-28 18:07:40,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622ca4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:07:40, skipping insertion in model container [2019-11-28 18:07:40,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:07:39" (2/3) ... [2019-11-28 18:07:40,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622ca4e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:07:40, skipping insertion in model container [2019-11-28 18:07:40,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:40" (3/3) ... [2019-11-28 18:07:40,340 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_power.oepc.i [2019-11-28 18:07:40,350 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-28 18:07:40,350 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 18:07:40,357 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 18:07:40,358 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-11-28 18:07:40,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,395 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,395 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,395 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,396 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,401 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,402 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,403 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,404 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,405 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,406 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,409 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,409 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,411 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,412 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,413 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,414 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,415 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,416 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,419 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,420 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,421 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,422 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,423 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,424 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,425 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-28 18:07:40,461 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-28 18:07:40,482 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 18:07:40,483 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 18:07:40,483 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 18:07:40,483 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 18:07:40,483 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 18:07:40,484 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 18:07:40,484 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 18:07:40,484 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 18:07:40,502 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-11-28 18:07:40,505 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:07:40,591 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:07:40,591 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:07:40,609 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:07:40,633 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-11-28 18:07:40,683 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-11-28 18:07:40,683 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-11-28 18:07:40,698 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-11-28 18:07:40,719 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-11-28 18:07:40,720 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-11-28 18:07:45,303 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-28 18:07:45,685 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-11-28 18:07:45,808 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-28 18:07:45,846 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-11-28 18:07:45,846 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-11-28 18:07:45,849 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-11-28 18:07:46,457 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-11-28 18:07:46,461 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-11-28 18:07:46,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-11-28 18:07:46,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:46,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-11-28 18:07:46,470 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:46,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:46,480 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-11-28 18:07:46,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:46,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415919441] [2019-11-28 18:07:46,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:46,794 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:07:46,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415919441] [2019-11-28 18:07:46,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:46,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-28 18:07:46,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180222956] [2019-11-28 18:07:46,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:07:46,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:46,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:07:46,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:07:46,832 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-11-28 18:07:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:47,128 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-11-28 18:07:47,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:07:47,131 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-11-28 18:07:47,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:47,237 INFO L225 Difference]: With dead ends: 8468 [2019-11-28 18:07:47,246 INFO L226 Difference]: Without dead ends: 7976 [2019-11-28 18:07:47,250 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:07:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-11-28 18:07:47,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-11-28 18:07:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-11-28 18:07:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-11-28 18:07:47,732 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-11-28 18:07:47,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:47,733 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-11-28 18:07:47,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:07:47,733 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-11-28 18:07:47,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 18:07:47,738 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:47,738 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:47,739 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:47,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:47,739 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-11-28 18:07:47,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:47,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378021926] [2019-11-28 18:07:47,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:47,882 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:07:47,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378021926] [2019-11-28 18:07:47,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:47,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:07:47,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621171698] [2019-11-28 18:07:47,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:07:47,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:47,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:07:47,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:47,887 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-11-28 18:07:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:48,291 INFO L93 Difference]: Finished difference Result 12178 states and 37599 transitions. [2019-11-28 18:07:48,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:07:48,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 18:07:48,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:48,375 INFO L225 Difference]: With dead ends: 12178 [2019-11-28 18:07:48,375 INFO L226 Difference]: Without dead ends: 12171 [2019-11-28 18:07:48,376 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:07:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12171 states. [2019-11-28 18:07:48,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12171 to 10893. [2019-11-28 18:07:48,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10893 states. [2019-11-28 18:07:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10893 states to 10893 states and 34228 transitions. [2019-11-28 18:07:48,981 INFO L78 Accepts]: Start accepts. Automaton has 10893 states and 34228 transitions. Word has length 11 [2019-11-28 18:07:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:48,982 INFO L462 AbstractCegarLoop]: Abstraction has 10893 states and 34228 transitions. [2019-11-28 18:07:48,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:07:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 10893 states and 34228 transitions. [2019-11-28 18:07:48,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 18:07:48,993 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:48,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:48,993 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:48,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:48,994 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-11-28 18:07:48,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:48,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936183698] [2019-11-28 18:07:48,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:49,128 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:07:49,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936183698] [2019-11-28 18:07:49,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:49,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:07:49,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023554010] [2019-11-28 18:07:49,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:07:49,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:49,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:07:49,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:49,132 INFO L87 Difference]: Start difference. First operand 10893 states and 34228 transitions. Second operand 4 states. [2019-11-28 18:07:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:49,366 INFO L93 Difference]: Finished difference Result 13366 states and 41774 transitions. [2019-11-28 18:07:49,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:07:49,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 18:07:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:49,419 INFO L225 Difference]: With dead ends: 13366 [2019-11-28 18:07:49,419 INFO L226 Difference]: Without dead ends: 13366 [2019-11-28 18:07:49,420 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:07:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13366 states. [2019-11-28 18:07:49,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13366 to 11878. [2019-11-28 18:07:49,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11878 states. [2019-11-28 18:07:49,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11878 states to 11878 states and 37348 transitions. [2019-11-28 18:07:49,856 INFO L78 Accepts]: Start accepts. Automaton has 11878 states and 37348 transitions. Word has length 14 [2019-11-28 18:07:49,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:49,858 INFO L462 AbstractCegarLoop]: Abstraction has 11878 states and 37348 transitions. [2019-11-28 18:07:49,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:07:49,858 INFO L276 IsEmpty]: Start isEmpty. Operand 11878 states and 37348 transitions. [2019-11-28 18:07:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 18:07:49,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:49,862 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:07:49,862 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:49,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:49,863 INFO L82 PathProgramCache]: Analyzing trace with hash 525416671, now seen corresponding path program 1 times [2019-11-28 18:07:49,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:49,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577765661] [2019-11-28 18:07:49,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:49,979 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:07:49,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577765661] [2019-11-28 18:07:49,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:49,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:07:49,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458036863] [2019-11-28 18:07:49,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:07:49,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:49,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:07:49,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:49,985 INFO L87 Difference]: Start difference. First operand 11878 states and 37348 transitions. Second operand 4 states. [2019-11-28 18:07:50,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:50,090 INFO L93 Difference]: Finished difference Result 12465 states and 38564 transitions. [2019-11-28 18:07:50,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:07:50,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-28 18:07:50,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:50,139 INFO L225 Difference]: With dead ends: 12465 [2019-11-28 18:07:50,140 INFO L226 Difference]: Without dead ends: 11793 [2019-11-28 18:07:50,140 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 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:07:50,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11793 states. [2019-11-28 18:07:50,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11793 to 11793. [2019-11-28 18:07:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11793 states. [2019-11-28 18:07:50,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11793 states to 11793 states and 37047 transitions. [2019-11-28 18:07:50,686 INFO L78 Accepts]: Start accepts. Automaton has 11793 states and 37047 transitions. Word has length 16 [2019-11-28 18:07:50,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:50,687 INFO L462 AbstractCegarLoop]: Abstraction has 11793 states and 37047 transitions. [2019-11-28 18:07:50,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:07:50,687 INFO L276 IsEmpty]: Start isEmpty. Operand 11793 states and 37047 transitions. [2019-11-28 18:07:50,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 18:07:50,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:50,692 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:07:50,692 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:50,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:50,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1370321063, now seen corresponding path program 1 times [2019-11-28 18:07:50,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:50,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227776388] [2019-11-28 18:07:50,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:50,781 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:07:50,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227776388] [2019-11-28 18:07:50,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:50,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:07:50,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930712683] [2019-11-28 18:07:50,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:07:50,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:50,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:07:50,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:50,783 INFO L87 Difference]: Start difference. First operand 11793 states and 37047 transitions. Second operand 4 states. [2019-11-28 18:07:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:50,825 INFO L93 Difference]: Finished difference Result 2332 states and 5798 transitions. [2019-11-28 18:07:50,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:07:50,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-28 18:07:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:50,833 INFO L225 Difference]: With dead ends: 2332 [2019-11-28 18:07:50,834 INFO L226 Difference]: Without dead ends: 1661 [2019-11-28 18:07:50,834 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:07:50,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2019-11-28 18:07:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1609. [2019-11-28 18:07:50,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-11-28 18:07:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3605 transitions. [2019-11-28 18:07:50,867 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3605 transitions. Word has length 17 [2019-11-28 18:07:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:50,868 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3605 transitions. [2019-11-28 18:07:50,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:07:50,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3605 transitions. [2019-11-28 18:07:50,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 18:07:50,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:50,874 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] [2019-11-28 18:07:50,874 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:50,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:50,875 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-11-28 18:07:50,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:50,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916763290] [2019-11-28 18:07:50,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:51,040 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:07:51,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916763290] [2019-11-28 18:07:51,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:51,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:07:51,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651997753] [2019-11-28 18:07:51,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:07:51,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:51,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:07:51,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:07:51,043 INFO L87 Difference]: Start difference. First operand 1609 states and 3605 transitions. Second operand 6 states. [2019-11-28 18:07:51,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:51,640 INFO L93 Difference]: Finished difference Result 4481 states and 9905 transitions. [2019-11-28 18:07:51,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:07:51,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-28 18:07:51,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:51,651 INFO L225 Difference]: With dead ends: 4481 [2019-11-28 18:07:51,651 INFO L226 Difference]: Without dead ends: 4446 [2019-11-28 18:07:51,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:07:51,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-11-28 18:07:51,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2169. [2019-11-28 18:07:51,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-11-28 18:07:51,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 4909 transitions. [2019-11-28 18:07:51,708 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 4909 transitions. Word has length 25 [2019-11-28 18:07:51,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:51,708 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 4909 transitions. [2019-11-28 18:07:51,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:07:51,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 4909 transitions. [2019-11-28 18:07:51,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:07:51,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:51,712 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:07:51,712 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:51,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:51,712 INFO L82 PathProgramCache]: Analyzing trace with hash -662536504, now seen corresponding path program 1 times [2019-11-28 18:07:51,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:51,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684199168] [2019-11-28 18:07:51,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:51,795 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:07:51,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684199168] [2019-11-28 18:07:51,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:51,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 18:07:51,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577491234] [2019-11-28 18:07:51,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:07:51,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:51,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:07:51,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:07:51,799 INFO L87 Difference]: Start difference. First operand 2169 states and 4909 transitions. Second operand 5 states. [2019-11-28 18:07:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:52,258 INFO L93 Difference]: Finished difference Result 3139 states and 6955 transitions. [2019-11-28 18:07:52,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 18:07:52,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-11-28 18:07:52,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:52,266 INFO L225 Difference]: With dead ends: 3139 [2019-11-28 18:07:52,267 INFO L226 Difference]: Without dead ends: 3139 [2019-11-28 18:07:52,267 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:07:52,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-11-28 18:07:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2639. [2019-11-28 18:07:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-11-28 18:07:52,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 5924 transitions. [2019-11-28 18:07:52,315 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 5924 transitions. Word has length 26 [2019-11-28 18:07:52,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:52,316 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 5924 transitions. [2019-11-28 18:07:52,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:07:52,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 5924 transitions. [2019-11-28 18:07:52,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 18:07:52,320 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:52,320 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:07:52,320 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:52,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:52,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-11-28 18:07:52,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:52,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595325328] [2019-11-28 18:07:52,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:52,407 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:07:52,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595325328] [2019-11-28 18:07:52,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:52,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:07:52,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514482781] [2019-11-28 18:07:52,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 18:07:52,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:52,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 18:07:52,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 18:07:52,409 INFO L87 Difference]: Start difference. First operand 2639 states and 5924 transitions. Second operand 6 states. [2019-11-28 18:07:52,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:52,978 INFO L93 Difference]: Finished difference Result 5512 states and 12000 transitions. [2019-11-28 18:07:52,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 18:07:52,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-28 18:07:52,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:52,991 INFO L225 Difference]: With dead ends: 5512 [2019-11-28 18:07:52,991 INFO L226 Difference]: Without dead ends: 5483 [2019-11-28 18:07:52,992 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:07:53,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2019-11-28 18:07:53,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 2614. [2019-11-28 18:07:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2019-11-28 18:07:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 5890 transitions. [2019-11-28 18:07:53,057 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 5890 transitions. Word has length 26 [2019-11-28 18:07:53,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:53,058 INFO L462 AbstractCegarLoop]: Abstraction has 2614 states and 5890 transitions. [2019-11-28 18:07:53,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 18:07:53,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 5890 transitions. [2019-11-28 18:07:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 18:07:53,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:53,063 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:07:53,063 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:53,063 INFO L82 PathProgramCache]: Analyzing trace with hash -312964189, now seen corresponding path program 1 times [2019-11-28 18:07:53,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:53,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520549966] [2019-11-28 18:07:53,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:53,131 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:07:53,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520549966] [2019-11-28 18:07:53,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:53,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 18:07:53,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109013194] [2019-11-28 18:07:53,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 18:07:53,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:53,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 18:07:53,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 18:07:53,133 INFO L87 Difference]: Start difference. First operand 2614 states and 5890 transitions. Second operand 5 states. [2019-11-28 18:07:53,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:53,177 INFO L93 Difference]: Finished difference Result 1600 states and 3459 transitions. [2019-11-28 18:07:53,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 18:07:53,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-28 18:07:53,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:53,181 INFO L225 Difference]: With dead ends: 1600 [2019-11-28 18:07:53,181 INFO L226 Difference]: Without dead ends: 1454 [2019-11-28 18:07:53,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:07:53,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2019-11-28 18:07:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1353. [2019-11-28 18:07:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2019-11-28 18:07:53,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2958 transitions. [2019-11-28 18:07:53,206 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2958 transitions. Word has length 27 [2019-11-28 18:07:53,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:53,206 INFO L462 AbstractCegarLoop]: Abstraction has 1353 states and 2958 transitions. [2019-11-28 18:07:53,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 18:07:53,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2958 transitions. [2019-11-28 18:07:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:07:53,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:53,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:53,211 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:53,212 INFO L82 PathProgramCache]: Analyzing trace with hash 62245946, now seen corresponding path program 1 times [2019-11-28 18:07:53,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:53,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962545525] [2019-11-28 18:07:53,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:53,330 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:07:53,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962545525] [2019-11-28 18:07:53,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:53,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:07:53,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121704847] [2019-11-28 18:07:53,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:07:53,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:53,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:07:53,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:07:53,333 INFO L87 Difference]: Start difference. First operand 1353 states and 2958 transitions. Second operand 7 states. [2019-11-28 18:07:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:54,632 INFO L93 Difference]: Finished difference Result 2931 states and 6214 transitions. [2019-11-28 18:07:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 18:07:54,632 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-11-28 18:07:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:54,637 INFO L225 Difference]: With dead ends: 2931 [2019-11-28 18:07:54,637 INFO L226 Difference]: Without dead ends: 2931 [2019-11-28 18:07:54,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-28 18:07:54,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2019-11-28 18:07:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 1433. [2019-11-28 18:07:54,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2019-11-28 18:07:54,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 3150 transitions. [2019-11-28 18:07:54,675 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 3150 transitions. Word has length 51 [2019-11-28 18:07:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:54,676 INFO L462 AbstractCegarLoop]: Abstraction has 1433 states and 3150 transitions. [2019-11-28 18:07:54,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:07:54,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 3150 transitions. [2019-11-28 18:07:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 18:07:54,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:54,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:54,681 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:54,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:54,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1305614862, now seen corresponding path program 2 times [2019-11-28 18:07:54,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:54,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308051866] [2019-11-28 18:07:54,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:54,805 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:07:54,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308051866] [2019-11-28 18:07:54,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:54,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:07:54,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767201716] [2019-11-28 18:07:54,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:07:54,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:54,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:07:54,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:07:54,807 INFO L87 Difference]: Start difference. First operand 1433 states and 3150 transitions. Second operand 3 states. [2019-11-28 18:07:55,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:55,029 INFO L93 Difference]: Finished difference Result 1846 states and 4008 transitions. [2019-11-28 18:07:55,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:07:55,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-28 18:07:55,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:55,032 INFO L225 Difference]: With dead ends: 1846 [2019-11-28 18:07:55,032 INFO L226 Difference]: Without dead ends: 1846 [2019-11-28 18:07:55,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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:07:55,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1846 states. [2019-11-28 18:07:55,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1846 to 1443. [2019-11-28 18:07:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1443 states. [2019-11-28 18:07:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 3176 transitions. [2019-11-28 18:07:55,053 INFO L78 Accepts]: Start accepts. Automaton has 1443 states and 3176 transitions. Word has length 51 [2019-11-28 18:07:55,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:55,053 INFO L462 AbstractCegarLoop]: Abstraction has 1443 states and 3176 transitions. [2019-11-28 18:07:55,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:07:55,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1443 states and 3176 transitions. [2019-11-28 18:07:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:07:55,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:55,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:55,057 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:55,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:55,057 INFO L82 PathProgramCache]: Analyzing trace with hash -972871791, now seen corresponding path program 1 times [2019-11-28 18:07:55,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:55,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17180764] [2019-11-28 18:07:55,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:55,262 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:07:55,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17180764] [2019-11-28 18:07:55,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:55,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:07:55,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862702273] [2019-11-28 18:07:55,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:07:55,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:55,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:07:55,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:07:55,264 INFO L87 Difference]: Start difference. First operand 1443 states and 3176 transitions. Second operand 10 states. [2019-11-28 18:07:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:57,075 INFO L93 Difference]: Finished difference Result 3036 states and 6454 transitions. [2019-11-28 18:07:57,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-28 18:07:57,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-28 18:07:57,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:57,080 INFO L225 Difference]: With dead ends: 3036 [2019-11-28 18:07:57,080 INFO L226 Difference]: Without dead ends: 3036 [2019-11-28 18:07:57,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2019-11-28 18:07:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2019-11-28 18:07:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 1536. [2019-11-28 18:07:57,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2019-11-28 18:07:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 3363 transitions. [2019-11-28 18:07:57,113 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 3363 transitions. Word has length 52 [2019-11-28 18:07:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:57,114 INFO L462 AbstractCegarLoop]: Abstraction has 1536 states and 3363 transitions. [2019-11-28 18:07:57,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:07:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 3363 transitions. [2019-11-28 18:07:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:07:57,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:57,117 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:57,117 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:57,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1641556840, now seen corresponding path program 1 times [2019-11-28 18:07:57,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:57,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013400994] [2019-11-28 18:07:57,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:57,266 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:07:57,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013400994] [2019-11-28 18:07:57,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:57,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 18:07:57,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800432091] [2019-11-28 18:07:57,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:07:57,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:57,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:07:57,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:07:57,275 INFO L87 Difference]: Start difference. First operand 1536 states and 3363 transitions. Second operand 7 states. [2019-11-28 18:07:58,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:58,360 INFO L93 Difference]: Finished difference Result 3046 states and 6389 transitions. [2019-11-28 18:07:58,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 18:07:58,360 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-28 18:07:58,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:58,364 INFO L225 Difference]: With dead ends: 3046 [2019-11-28 18:07:58,364 INFO L226 Difference]: Without dead ends: 3046 [2019-11-28 18:07:58,365 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-28 18:07:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2019-11-28 18:07:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 1511. [2019-11-28 18:07:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1511 states. [2019-11-28 18:07:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 3310 transitions. [2019-11-28 18:07:58,397 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 3310 transitions. Word has length 52 [2019-11-28 18:07:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:58,398 INFO L462 AbstractCegarLoop]: Abstraction has 1511 states and 3310 transitions. [2019-11-28 18:07:58,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:07:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 3310 transitions. [2019-11-28 18:07:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:07:58,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:58,401 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:58,401 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:58,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:58,402 INFO L82 PathProgramCache]: Analyzing trace with hash 843046701, now seen corresponding path program 2 times [2019-11-28 18:07:58,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:58,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855769775] [2019-11-28 18:07:58,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:58,498 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:07:58,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855769775] [2019-11-28 18:07:58,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:58,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:07:58,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214175065] [2019-11-28 18:07:58,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:07:58,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:58,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:07:58,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:07:58,501 INFO L87 Difference]: Start difference. First operand 1511 states and 3310 transitions. Second operand 4 states. [2019-11-28 18:07:58,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:07:58,522 INFO L93 Difference]: Finished difference Result 2707 states and 5921 transitions. [2019-11-28 18:07:58,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:07:58,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-28 18:07:58,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:07:58,524 INFO L225 Difference]: With dead ends: 2707 [2019-11-28 18:07:58,524 INFO L226 Difference]: Without dead ends: 1265 [2019-11-28 18:07:58,525 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:07:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2019-11-28 18:07:58,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1265. [2019-11-28 18:07:58,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1265 states. [2019-11-28 18:07:58,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1265 states to 1265 states and 2741 transitions. [2019-11-28 18:07:58,545 INFO L78 Accepts]: Start accepts. Automaton has 1265 states and 2741 transitions. Word has length 52 [2019-11-28 18:07:58,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:07:58,546 INFO L462 AbstractCegarLoop]: Abstraction has 1265 states and 2741 transitions. [2019-11-28 18:07:58,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:07:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1265 states and 2741 transitions. [2019-11-28 18:07:58,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:07:58,549 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:07:58,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:07:58,549 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:07:58,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:07:58,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1250007013, now seen corresponding path program 3 times [2019-11-28 18:07:58,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:07:58,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95529493] [2019-11-28 18:07:58,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:07:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:07:58,918 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:07:58,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95529493] [2019-11-28 18:07:58,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:07:58,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 18:07:58,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99133199] [2019-11-28 18:07:58,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 18:07:58,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:07:58,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 18:07:58,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-28 18:07:58,920 INFO L87 Difference]: Start difference. First operand 1265 states and 2741 transitions. Second operand 10 states. [2019-11-28 18:08:00,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:00,758 INFO L93 Difference]: Finished difference Result 2399 states and 5115 transitions. [2019-11-28 18:08:00,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-28 18:08:00,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-11-28 18:08:00,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:00,762 INFO L225 Difference]: With dead ends: 2399 [2019-11-28 18:08:00,762 INFO L226 Difference]: Without dead ends: 1838 [2019-11-28 18:08:00,763 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2019-11-28 18:08:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-28 18:08:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1360. [2019-11-28 18:08:00,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2019-11-28 18:08:00,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 2949 transitions. [2019-11-28 18:08:00,786 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 2949 transitions. Word has length 52 [2019-11-28 18:08:00,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:00,786 INFO L462 AbstractCegarLoop]: Abstraction has 1360 states and 2949 transitions. [2019-11-28 18:08:00,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 18:08:00,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 2949 transitions. [2019-11-28 18:08:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:00,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:00,790 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:00,790 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:00,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1036508302, now seen corresponding path program 2 times [2019-11-28 18:08:00,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:00,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563337357] [2019-11-28 18:08:00,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:00,860 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:08:00,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563337357] [2019-11-28 18:08:00,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:00,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:08:00,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179863234] [2019-11-28 18:08:00,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 18:08:00,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:00,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 18:08:00,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 18:08:00,862 INFO L87 Difference]: Start difference. First operand 1360 states and 2949 transitions. Second operand 4 states. [2019-11-28 18:08:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:00,915 INFO L93 Difference]: Finished difference Result 1346 states and 2907 transitions. [2019-11-28 18:08:00,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 18:08:00,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-28 18:08:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:00,918 INFO L225 Difference]: With dead ends: 1346 [2019-11-28 18:08:00,918 INFO L226 Difference]: Without dead ends: 1346 [2019-11-28 18:08:00,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:08:00,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-11-28 18:08:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1287. [2019-11-28 18:08:00,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1287 states. [2019-11-28 18:08:00,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 2779 transitions. [2019-11-28 18:08:00,937 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 2779 transitions. Word has length 52 [2019-11-28 18:08:00,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:00,937 INFO L462 AbstractCegarLoop]: Abstraction has 1287 states and 2779 transitions. [2019-11-28 18:08:00,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 18:08:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2779 transitions. [2019-11-28 18:08:00,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:00,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:00,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:00,941 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:00,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:00,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1344860508, now seen corresponding path program 1 times [2019-11-28 18:08:00,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:00,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466491375] [2019-11-28 18:08:00,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:00,983 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:08:00,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466491375] [2019-11-28 18:08:00,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:00,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 18:08:00,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582211970] [2019-11-28 18:08:00,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:08:00,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:00,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:08:00,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:08:00,985 INFO L87 Difference]: Start difference. First operand 1287 states and 2779 transitions. Second operand 3 states. [2019-11-28 18:08:01,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:01,016 INFO L93 Difference]: Finished difference Result 1472 states and 3080 transitions. [2019-11-28 18:08:01,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:08:01,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:08:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:01,019 INFO L225 Difference]: With dead ends: 1472 [2019-11-28 18:08:01,019 INFO L226 Difference]: Without dead ends: 1472 [2019-11-28 18:08:01,019 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:08:01,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2019-11-28 18:08:01,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1196. [2019-11-28 18:08:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1196 states. [2019-11-28 18:08:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 2570 transitions. [2019-11-28 18:08:01,043 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 2570 transitions. Word has length 52 [2019-11-28 18:08:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:01,043 INFO L462 AbstractCegarLoop]: Abstraction has 1196 states and 2570 transitions. [2019-11-28 18:08:01,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:08:01,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 2570 transitions. [2019-11-28 18:08:01,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-28 18:08:01,047 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:01,047 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:01,047 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:01,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1423404713, now seen corresponding path program 4 times [2019-11-28 18:08:01,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:01,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422882449] [2019-11-28 18:08:01,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:01,103 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:08:01,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422882449] [2019-11-28 18:08:01,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:01,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 18:08:01,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324341461] [2019-11-28 18:08:01,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 18:08:01,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:01,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 18:08:01,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 18:08:01,105 INFO L87 Difference]: Start difference. First operand 1196 states and 2570 transitions. Second operand 3 states. [2019-11-28 18:08:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:01,118 INFO L93 Difference]: Finished difference Result 1195 states and 2568 transitions. [2019-11-28 18:08:01,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 18:08:01,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-28 18:08:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:01,120 INFO L225 Difference]: With dead ends: 1195 [2019-11-28 18:08:01,120 INFO L226 Difference]: Without dead ends: 1195 [2019-11-28 18:08:01,121 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:08:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2019-11-28 18:08:01,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 897. [2019-11-28 18:08:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 897 states. [2019-11-28 18:08:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1947 transitions. [2019-11-28 18:08:01,136 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1947 transitions. Word has length 52 [2019-11-28 18:08:01,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:01,136 INFO L462 AbstractCegarLoop]: Abstraction has 897 states and 1947 transitions. [2019-11-28 18:08:01,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 18:08:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1947 transitions. [2019-11-28 18:08:01,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:08:01,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:01,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:01,139 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:01,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:01,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1803579188, now seen corresponding path program 1 times [2019-11-28 18:08:01,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:01,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475034997] [2019-11-28 18:08:01,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 18:08:01,220 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:08:01,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475034997] [2019-11-28 18:08:01,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 18:08:01,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 18:08:01,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831315133] [2019-11-28 18:08:01,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 18:08:01,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 18:08:01,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 18:08:01,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 18:08:01,221 INFO L87 Difference]: Start difference. First operand 897 states and 1947 transitions. Second operand 7 states. [2019-11-28 18:08:01,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 18:08:01,376 INFO L93 Difference]: Finished difference Result 1467 states and 3095 transitions. [2019-11-28 18:08:01,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 18:08:01,377 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-11-28 18:08:01,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 18:08:01,378 INFO L225 Difference]: With dead ends: 1467 [2019-11-28 18:08:01,379 INFO L226 Difference]: Without dead ends: 1014 [2019-11-28 18:08:01,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-28 18:08:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2019-11-28 18:08:01,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 885. [2019-11-28 18:08:01,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-11-28 18:08:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1895 transitions. [2019-11-28 18:08:01,395 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1895 transitions. Word has length 53 [2019-11-28 18:08:01,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 18:08:01,395 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 1895 transitions. [2019-11-28 18:08:01,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 18:08:01,395 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1895 transitions. [2019-11-28 18:08:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 18:08:01,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 18:08:01,398 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 18:08:01,398 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 18:08:01,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 18:08:01,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 2 times [2019-11-28 18:08:01,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 18:08:01,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859400721] [2019-11-28 18:08:01,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 18:08:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:08:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 18:08:01,507 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 18:08:01,507 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 18:08:01,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29| 1)) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t585~0.base_29| 4)) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t585~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29|) 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t585~0.base_29|) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29|) |v_ULTIMATE.start_main_~#t585~0.offset_20| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t585~0.base=|v_ULTIMATE.start_main_~#t585~0.base_29|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_17|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ULTIMATE.start_main_~#t585~0.offset=|v_ULTIMATE.start_main_~#t585~0.offset_20|, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t585~0.base, #length, ~y~0, ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t585~0.offset, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:08:01,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t586~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t586~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t586~0.base_12|) (= |v_ULTIMATE.start_main_~#t586~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12|) |v_ULTIMATE.start_main_~#t586~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_12|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:08:01,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:08:01,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1502809594 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1502809594 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1502809594|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1502809594 |P0Thread1of1ForFork0_#t~ite5_Out-1502809594|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1502809594, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1502809594} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1502809594|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1502809594, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1502809594} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:08:01,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In508590166 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In508590166 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In508590166 256))) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In508590166 256))) (= (mod ~y$w_buff0_used~0_In508590166 256) 0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out508590166| |P1Thread1of1ForFork1_#t~ite14_Out508590166|) (= ~y$w_buff0~0_In508590166 |P1Thread1of1ForFork1_#t~ite14_Out508590166|)) (and (= |P1Thread1of1ForFork1_#t~ite14_In508590166| |P1Thread1of1ForFork1_#t~ite14_Out508590166|) (= ~y$w_buff0~0_In508590166 |P1Thread1of1ForFork1_#t~ite15_Out508590166|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In508590166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508590166, ~y$w_buff0~0=~y$w_buff0~0_In508590166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In508590166, ~weak$$choice2~0=~weak$$choice2~0_In508590166, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In508590166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508590166} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In508590166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508590166, ~y$w_buff0~0=~y$w_buff0~0_In508590166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In508590166, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out508590166|, ~weak$$choice2~0=~weak$$choice2~0_In508590166, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out508590166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508590166} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:08:01,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1238851628 256)))) (or (and (= ~y$w_buff1~0_In1238851628 |P1Thread1of1ForFork1_#t~ite17_Out1238851628|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1238851628 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1238851628 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In1238851628 256) 0) .cse0) (and (= (mod ~y$w_buff1_used~0_In1238851628 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite18_Out1238851628| |P1Thread1of1ForFork1_#t~ite17_Out1238851628|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite17_In1238851628| |P1Thread1of1ForFork1_#t~ite17_Out1238851628|) (= |P1Thread1of1ForFork1_#t~ite18_Out1238851628| ~y$w_buff1~0_In1238851628) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1238851628, ~y$w_buff1~0=~y$w_buff1~0_In1238851628, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1238851628, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1238851628, ~weak$$choice2~0=~weak$$choice2~0_In1238851628, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1238851628|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1238851628} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1238851628, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1238851628|, ~y$w_buff1~0=~y$w_buff1~0_In1238851628, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1238851628, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1238851628, ~weak$$choice2~0=~weak$$choice2~0_In1238851628, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1238851628|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1238851628} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:08:01,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-460841796 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-460841796 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-460841796 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-460841796 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-460841796 |P0Thread1of1ForFork0_#t~ite6_Out-460841796|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-460841796|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-460841796, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-460841796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-460841796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460841796} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-460841796|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-460841796, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-460841796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-460841796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460841796} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:08:01,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_In-2019514602 ~y$r_buff0_thd1~0_Out-2019514602)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-2019514602 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-2019514602 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-2019514602) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2019514602, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2019514602} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2019514602, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2019514602|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2019514602} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:08:01,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2086063597 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2086063597 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In2086063597 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2086063597 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out2086063597|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd1~0_In2086063597 |P0Thread1of1ForFork0_#t~ite8_Out2086063597|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2086063597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2086063597, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2086063597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2086063597} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2086063597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2086063597, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2086063597|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2086063597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2086063597} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:08:01,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1570503531 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out1570503531| ~y$w_buff0_used~0_In1570503531) (= |P1Thread1of1ForFork1_#t~ite20_In1570503531| |P1Thread1of1ForFork1_#t~ite20_Out1570503531|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out1570503531| |P1Thread1of1ForFork1_#t~ite20_Out1570503531|) (= ~y$w_buff0_used~0_In1570503531 |P1Thread1of1ForFork1_#t~ite20_Out1570503531|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1570503531 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1570503531 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1570503531 256))) (= 0 (mod ~y$w_buff0_used~0_In1570503531 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1570503531, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570503531, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1570503531|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1570503531, ~weak$$choice2~0=~weak$$choice2~0_In1570503531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570503531} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1570503531, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570503531, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1570503531|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1570503531, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1570503531|, ~weak$$choice2~0=~weak$$choice2~0_In1570503531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570503531} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:08:01,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:08:01,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In597800782 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In597800782 256) 0))) (or (= (mod ~y$w_buff0_used~0_In597800782 256) 0) (and (= (mod ~y$w_buff1_used~0_In597800782 256) 0) .cse0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In597800782 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out597800782| |P1Thread1of1ForFork1_#t~ite30_Out597800782|) (= |P1Thread1of1ForFork1_#t~ite29_Out597800782| ~y$r_buff1_thd2~0_In597800782)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite30_Out597800782| ~y$r_buff1_thd2~0_In597800782) (= |P1Thread1of1ForFork1_#t~ite29_In597800782| |P1Thread1of1ForFork1_#t~ite29_Out597800782|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In597800782, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In597800782|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597800782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In597800782, ~weak$$choice2~0=~weak$$choice2~0_In597800782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597800782} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In597800782, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out597800782|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out597800782|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597800782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In597800782, ~weak$$choice2~0=~weak$$choice2~0_In597800782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597800782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:08:01,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:08:01,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:08:01,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-2120013689 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2120013689 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-2120013689 |P1Thread1of1ForFork1_#t~ite32_Out-2120013689|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-2120013689| ~y$w_buff1~0_In-2120013689)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120013689, ~y$w_buff1~0=~y$w_buff1~0_In-2120013689, ~y~0=~y~0_In-2120013689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120013689} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120013689, ~y$w_buff1~0=~y$w_buff1~0_In-2120013689, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2120013689|, ~y~0=~y~0_In-2120013689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120013689} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:08:01,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:08:01,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1100964365 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1100964365 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1100964365|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1100964365 |P1Thread1of1ForFork1_#t~ite34_Out-1100964365|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1100964365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1100964365} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1100964365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1100964365, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1100964365|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:08:01,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1917796579 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1917796579 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1917796579 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1917796579 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1917796579| ~y$w_buff1_used~0_In-1917796579)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1917796579| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1917796579, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1917796579, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1917796579, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1917796579} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1917796579, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1917796579, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1917796579, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1917796579|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1917796579} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:08:01,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1619958721 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1619958721 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1619958721|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1619958721| ~y$r_buff0_thd2~0_In-1619958721)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1619958721, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1619958721} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1619958721, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1619958721, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1619958721|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:08:01,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In344923534 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In344923534 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In344923534 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In344923534 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out344923534|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In344923534 |P1Thread1of1ForFork1_#t~ite37_Out344923534|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In344923534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In344923534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In344923534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In344923534} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In344923534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In344923534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In344923534, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out344923534|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In344923534} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:01,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:01,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:08:01,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1712978252 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1712978252 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1712978252| ~y$w_buff1~0_In1712978252)) (and (= |ULTIMATE.start_main_#t~ite40_Out1712978252| ~y~0_In1712978252) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1712978252, ~y~0=~y~0_In1712978252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1712978252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1712978252} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1712978252|, ~y$w_buff1~0=~y$w_buff1~0_In1712978252, ~y~0=~y~0_In1712978252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1712978252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1712978252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:08:01,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:08:01,525 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1275925583 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1275925583 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1275925583| ~y$w_buff0_used~0_In-1275925583)) (and (= |ULTIMATE.start_main_#t~ite42_Out-1275925583| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1275925583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1275925583} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1275925583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1275925583, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1275925583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:08:01,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1114368751 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1114368751 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1114368751 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1114368751 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1114368751| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out1114368751| ~y$w_buff1_used~0_In1114368751) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1114368751, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1114368751, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1114368751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1114368751} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1114368751, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1114368751, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1114368751|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1114368751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1114368751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:08:01,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1403330770 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1403330770 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1403330770| 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In1403330770 |ULTIMATE.start_main_#t~ite44_Out1403330770|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1403330770, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1403330770} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1403330770, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1403330770, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1403330770|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:08:01,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In817479783 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In817479783 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In817479783 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In817479783 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In817479783 |ULTIMATE.start_main_#t~ite45_Out817479783|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite45_Out817479783|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In817479783, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In817479783, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In817479783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817479783} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In817479783, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In817479783, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In817479783, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out817479783|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817479783} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:08:01,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:08:01,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:08:01 BasicIcfg [2019-11-28 18:08:01,596 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 18:08:01,597 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 18:08:01,597 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 18:08:01,597 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 18:08:01,598 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:07:40" (3/4) ... [2019-11-28 18:08:01,601 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 18:08:01,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29| 1)) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t585~0.base_29| 4)) (= 0 v_~__unbuffered_cnt~0_62) (= |v_ULTIMATE.start_main_~#t585~0.offset_20| 0) (= v_~y$mem_tmp~0_26 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t585~0.base_29|) 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t585~0.base_29|) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= 0 |v_#NULL.base_5|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t585~0.base_29|) |v_ULTIMATE.start_main_~#t585~0.offset_20| 0)) |v_#memory_int_15|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t585~0.base=|v_ULTIMATE.start_main_~#t585~0.base_29|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_17|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_14|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, ULTIMATE.start_main_~#t585~0.offset=|v_ULTIMATE.start_main_~#t585~0.offset_20|, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t585~0.base, #length, ~y~0, ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ULTIMATE.start_main_~#t585~0.offset, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-11-28 18:08:01,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t586~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t586~0.base_12| 4) |v_#length_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t586~0.base_12|) (= |v_ULTIMATE.start_main_~#t586~0.offset_10| 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t586~0.base_12|) |v_ULTIMATE.start_main_~#t586~0.offset_10| 1))) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t586~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t586~0.base=|v_ULTIMATE.start_main_~#t586~0.base_12|, ULTIMATE.start_main_~#t586~0.offset=|v_ULTIMATE.start_main_~#t586~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t586~0.base, ULTIMATE.start_main_~#t586~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-11-28 18:08:01,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-11-28 18:08:01,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1502809594 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1502809594 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1502809594|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1502809594 |P0Thread1of1ForFork0_#t~ite5_Out-1502809594|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1502809594, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1502809594} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1502809594|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1502809594, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1502809594} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-11-28 18:08:01,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In508590166 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In508590166 256) 0))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In508590166 256))) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In508590166 256))) (= (mod ~y$w_buff0_used~0_In508590166 256) 0))) .cse1 (= |P1Thread1of1ForFork1_#t~ite15_Out508590166| |P1Thread1of1ForFork1_#t~ite14_Out508590166|) (= ~y$w_buff0~0_In508590166 |P1Thread1of1ForFork1_#t~ite14_Out508590166|)) (and (= |P1Thread1of1ForFork1_#t~ite14_In508590166| |P1Thread1of1ForFork1_#t~ite14_Out508590166|) (= ~y$w_buff0~0_In508590166 |P1Thread1of1ForFork1_#t~ite15_Out508590166|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In508590166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508590166, ~y$w_buff0~0=~y$w_buff0~0_In508590166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In508590166, ~weak$$choice2~0=~weak$$choice2~0_In508590166, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In508590166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508590166} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In508590166, ~y$w_buff0_used~0=~y$w_buff0_used~0_In508590166, ~y$w_buff0~0=~y$w_buff0~0_In508590166, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In508590166, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out508590166|, ~weak$$choice2~0=~weak$$choice2~0_In508590166, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out508590166|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In508590166} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-11-28 18:08:01,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1238851628 256)))) (or (and (= ~y$w_buff1~0_In1238851628 |P1Thread1of1ForFork1_#t~ite17_Out1238851628|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1238851628 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1238851628 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In1238851628 256) 0) .cse0) (and (= (mod ~y$w_buff1_used~0_In1238851628 256) 0) .cse0))) (= |P1Thread1of1ForFork1_#t~ite18_Out1238851628| |P1Thread1of1ForFork1_#t~ite17_Out1238851628|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite17_In1238851628| |P1Thread1of1ForFork1_#t~ite17_Out1238851628|) (= |P1Thread1of1ForFork1_#t~ite18_Out1238851628| ~y$w_buff1~0_In1238851628) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1238851628, ~y$w_buff1~0=~y$w_buff1~0_In1238851628, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1238851628, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1238851628, ~weak$$choice2~0=~weak$$choice2~0_In1238851628, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In1238851628|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1238851628} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1238851628, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out1238851628|, ~y$w_buff1~0=~y$w_buff1~0_In1238851628, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1238851628, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1238851628, ~weak$$choice2~0=~weak$$choice2~0_In1238851628, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1238851628|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1238851628} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-11-28 18:08:01,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-460841796 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-460841796 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-460841796 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-460841796 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-460841796 |P0Thread1of1ForFork0_#t~ite6_Out-460841796|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-460841796|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-460841796, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-460841796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-460841796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460841796} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-460841796|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-460841796, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-460841796, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-460841796, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460841796} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-11-28 18:08:01,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_In-2019514602 ~y$r_buff0_thd1~0_Out-2019514602)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-2019514602 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-2019514602 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-2019514602) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2019514602, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2019514602} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2019514602, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2019514602|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2019514602} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-11-28 18:08:01,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2086063597 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2086063597 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In2086063597 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2086063597 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out2086063597|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd1~0_In2086063597 |P0Thread1of1ForFork0_#t~ite8_Out2086063597|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2086063597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2086063597, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2086063597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2086063597} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2086063597, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2086063597, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out2086063597|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2086063597, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2086063597} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-11-28 18:08:01,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1570503531 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out1570503531| ~y$w_buff0_used~0_In1570503531) (= |P1Thread1of1ForFork1_#t~ite20_In1570503531| |P1Thread1of1ForFork1_#t~ite20_Out1570503531|)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite21_Out1570503531| |P1Thread1of1ForFork1_#t~ite20_Out1570503531|) (= ~y$w_buff0_used~0_In1570503531 |P1Thread1of1ForFork1_#t~ite20_Out1570503531|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1570503531 256)))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1570503531 256))) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1570503531 256))) (= 0 (mod ~y$w_buff0_used~0_In1570503531 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1570503531, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570503531, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1570503531|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1570503531, ~weak$$choice2~0=~weak$$choice2~0_In1570503531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570503531} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1570503531, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1570503531, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1570503531|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1570503531, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1570503531|, ~weak$$choice2~0=~weak$$choice2~0_In1570503531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1570503531} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-11-28 18:08:01,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-11-28 18:08:01,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In597800782 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In597800782 256) 0))) (or (= (mod ~y$w_buff0_used~0_In597800782 256) 0) (and (= (mod ~y$w_buff1_used~0_In597800782 256) 0) .cse0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In597800782 256))))) .cse1 (= |P1Thread1of1ForFork1_#t~ite29_Out597800782| |P1Thread1of1ForFork1_#t~ite30_Out597800782|) (= |P1Thread1of1ForFork1_#t~ite29_Out597800782| ~y$r_buff1_thd2~0_In597800782)) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite30_Out597800782| ~y$r_buff1_thd2~0_In597800782) (= |P1Thread1of1ForFork1_#t~ite29_In597800782| |P1Thread1of1ForFork1_#t~ite29_Out597800782|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In597800782, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In597800782|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597800782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In597800782, ~weak$$choice2~0=~weak$$choice2~0_In597800782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597800782} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In597800782, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out597800782|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out597800782|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In597800782, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In597800782, ~weak$$choice2~0=~weak$$choice2~0_In597800782, ~y$w_buff1_used~0=~y$w_buff1_used~0_In597800782} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-11-28 18:08:01,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-11-28 18:08:01,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-11-28 18:08:01,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-2120013689 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2120013689 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In-2120013689 |P1Thread1of1ForFork1_#t~ite32_Out-2120013689|)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-2120013689| ~y$w_buff1~0_In-2120013689)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120013689, ~y$w_buff1~0=~y$w_buff1~0_In-2120013689, ~y~0=~y~0_In-2120013689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120013689} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120013689, ~y$w_buff1~0=~y$w_buff1~0_In-2120013689, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-2120013689|, ~y~0=~y~0_In-2120013689, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120013689} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-11-28 18:08:01,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-11-28 18:08:01,613 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1100964365 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1100964365 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1100964365|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1100964365 |P1Thread1of1ForFork1_#t~ite34_Out-1100964365|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1100964365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1100964365} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1100964365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1100964365, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1100964365|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-11-28 18:08:01,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1917796579 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1917796579 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1917796579 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-1917796579 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out-1917796579| ~y$w_buff1_used~0_In-1917796579)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1917796579| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1917796579, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1917796579, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1917796579, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1917796579} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1917796579, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1917796579, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1917796579, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1917796579|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1917796579} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-11-28 18:08:01,614 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1619958721 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1619958721 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1619958721|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-1619958721| ~y$r_buff0_thd2~0_In-1619958721)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1619958721, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1619958721} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1619958721, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1619958721, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1619958721|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-11-28 18:08:01,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In344923534 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In344923534 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In344923534 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In344923534 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out344923534|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd2~0_In344923534 |P1Thread1of1ForFork1_#t~ite37_Out344923534|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In344923534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In344923534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In344923534, ~y$w_buff1_used~0=~y$w_buff1_used~0_In344923534} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In344923534, ~y$w_buff0_used~0=~y$w_buff0_used~0_In344923534, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In344923534, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out344923534|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In344923534} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:01,615 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-11-28 18:08:01,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-11-28 18:08:01,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1712978252 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1712978252 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out1712978252| ~y$w_buff1~0_In1712978252)) (and (= |ULTIMATE.start_main_#t~ite40_Out1712978252| ~y~0_In1712978252) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1712978252, ~y~0=~y~0_In1712978252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1712978252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1712978252} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1712978252|, ~y$w_buff1~0=~y$w_buff1~0_In1712978252, ~y~0=~y~0_In1712978252, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1712978252, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1712978252} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-11-28 18:08:01,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-11-28 18:08:01,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1275925583 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1275925583 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1275925583| ~y$w_buff0_used~0_In-1275925583)) (and (= |ULTIMATE.start_main_#t~ite42_Out-1275925583| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1275925583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1275925583} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1275925583, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1275925583, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1275925583|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-11-28 18:08:01,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1114368751 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1114368751 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1114368751 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1114368751 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out1114368751| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out1114368751| ~y$w_buff1_used~0_In1114368751) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1114368751, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1114368751, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1114368751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1114368751} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1114368751, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1114368751, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1114368751|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1114368751, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1114368751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-11-28 18:08:01,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1403330770 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1403330770 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1403330770| 0) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In1403330770 |ULTIMATE.start_main_#t~ite44_Out1403330770|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1403330770, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1403330770} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1403330770, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1403330770, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1403330770|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-11-28 18:08:01,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In817479783 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In817479783 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In817479783 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In817479783 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In817479783 |ULTIMATE.start_main_#t~ite45_Out817479783|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite45_Out817479783|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In817479783, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In817479783, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In817479783, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817479783} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In817479783, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In817479783, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In817479783, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out817479783|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In817479783} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-11-28 18:08:01,619 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-11-28 18:08:01,713 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 18:08:01,716 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 18:08:01,718 INFO L168 Benchmark]: Toolchain (without parser) took 23188.29 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 839.9 MB). Free memory was 952.3 MB in the beginning and 1.3 GB in the end (delta: -392.1 MB). Peak memory consumption was 447.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:01,718 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:08:01,721 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:01,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:01,723 INFO L168 Benchmark]: Boogie Preprocessor took 40.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 18:08:01,729 INFO L168 Benchmark]: RCFGBuilder took 881.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:01,730 INFO L168 Benchmark]: TraceAbstraction took 21263.82 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 695.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -301.4 MB). Peak memory consumption was 393.8 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:01,730 INFO L168 Benchmark]: Witness Printer took 119.29 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-28 18:08:01,736 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 812.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -160.4 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 881.47 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21263.82 ms. Allocated memory was 1.2 GB in the beginning and 1.9 GB in the end (delta: 695.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -301.4 MB). Peak memory consumption was 393.8 MB. Max. memory is 11.5 GB. * Witness Printer took 119.29 ms. Allocated memory is still 1.9 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 18.7 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.3s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t585, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t586, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 21.0s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2549 SDtfs, 3351 SDslu, 5348 SDs, 0 SdLazy, 5330 SolverSat, 288 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 44 SyntacticMatches, 19 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11878occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 14741 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 737 NumberOfCodeBlocks, 737 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 665 ConstructedInterpolants, 0 QuantifiedInterpolants, 117256 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...